Keyword search and oblivious pseudorandom functions
From MaRDI portal
Recommendations
Cited in
(72)- On the impossibility of structure-preserving deterministic primitives
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- Efficient and secure outsourced approximate pattern matching protocol
- Oblivious keyword search
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
- On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding
- Functional encryption for set intersection in the multi-client setting
- Private set intersection in the internet setting from lightweight oblivious PRF
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
- A fast and simple partially oblivious PRF, with applications
- Private set intersection: new generic constructions and feasibility results
- \textsf{Catalic}: delegated PSI cardinality with applications to contact tracing
- Oblivious pseudorandom functions from isogenies
- Efficient set intersection with simulation-based security
- The feasibility of outsourced database search in the plain model
- Two-message, oblivious evaluation of cryptographic functionalities
- A fair and efficient mutual private set intersection protocol from a two-way oblivious pseudorandom function
- Efficient computations over encrypted data blocks
- Oblivious keyword search with authorization
- Privately computing set-union and set-intersection cardinality via Bloom filters
- Rate-limited secure function evaluation
- New Communication-Efficient Oblivious Transfer Protocols Based on Pairings
- Universally Composable Adaptive Oblivious Transfer
- Towards Robust Computation on Encrypted Data
- Efficient set operations in the presence of malicious adversaries
- Reconstructing generalized staircase polygons with uniform step length
- Rate-limited secure function evaluation: definitions and constructions
- Pseudorandom functions: three decades later
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Constraining pseudorandom functions privately
- Scalable multi-party private set-intersection
- Augmented oblivious polynomial evaluation protocol and its applications
- Adaptive oblivious transfer with access control from lattice assumptions
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
- Anonymous tokens with public metadata and applications to private contact tracing
- Actively secure arithmetic computation and VOLE with constant computational overhead
- Private polynomial commitments and applications to MPC
- Secure two-party input-size reduction: challenges, solutions and applications
- Structure-aware private set intersection, with applications to fuzzy matching
- How to obfuscate MPC inputs
- 3-party distributed ORAM from oblivious set membership
- Cryptanalysis of an oblivious PRF from supersingular isogenies
- ParaDiSE: efficient threshold authenticated encryption in fully malicious model
- Malicious secure, structure-aware private set intersection
- Linear Complexity Private Set Intersection for Secure Two-Party Protocols
- Element distinctness and bounded input size in private set intersection and related protocols
- Private computations on set intersection
- \textsf{PERKS}: persistent and distributed key acquisition for secure storage from passwords
- Composable oblivious pseudo-random functions via garbled circuits
- A post-quantum round-optimal oblivious PRF from isogenies
- New proof systems and an OPRF from CSIDH
- Private set operations from multi-query reverse private membership test
- A formal treatment of end-to-end encrypted cloud storage
- Improved alternating-moduli PRFs and post-quantum signatures
- Fast private set intersection from polynomial multiplication triples
- \textsc{Leap}: a fast, lattice-based OPRF with application to private set intersection
- Instantiating the hash-then-evaluate paradigm: strengthening PRFs, PCFs, and OPRFs
- An efficient toolkit for computing third-party private set intersection
- The concrete security of two-party computation: simple definitions, and tight proofs for PSI and OPRFs
- Threshold PAKE with security against compromise of all servers
- Verifiable oblivious pseudorandom functions from lattices: practical-ish and thresholdisable
- The Legendre pseudorandom function as a multivariate quadratic cryptosystem: security and applications
- New framework for structure-aware PSI from distributed function secret sharing
- Adaptively secure threshold blind BLS signatures and threshold oblivious PRF
- Game changer: a modular framework for OPRF security
- Efficient garbled pseudorandom functions and lookup tables from minimal assumption
- Combining oblivious pseudorandom functions
- Two-factor authentication can harden servers against offline password search
- OneTwoPAKE: two-round strong asymmetric PAKE with ideal security
- Oblivious pseudorandom functions in non-commutative groups
- Amortizing Circuit-PSI in the multiple sender/receiver setting
- Threshold oblivious pseudorandom functions from isogeny group actions
This page was built for publication: Keyword search and oblivious pseudorandom functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5711649)
