Theory of Cryptography
From MaRDI portal
Publication:5711649
DOI10.1007/b106171zbMath1079.94546OpenAlexW4251449056WikidataQ59379672 ScholiaQ59379672MaRDI QIDQ5711649
Benny Pinkas, Michael J. Freedman, Omer Reingold, Yuval Ishai
Publication date: 7 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106171
secure two-party protocolsprivate information retrievaloblivious pseudorandom functionsprivacy-preserving protocolsSecure keyword search
Related Items (43)
Efficient set intersection with simulation-based security ⋮ MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications ⋮ Rate-limited secure function evaluation ⋮ Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters ⋮ A fast and simple partially oblivious PRF, with applications ⋮ Private set intersection: new generic constructions and feasibility results ⋮ A Fair and Efficient Mutual Private Set Intersection Protocol from a Two-Way Oblivious Pseudorandom Function ⋮ Efficient Computations over Encrypted Data Blocks ⋮ 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 ⋮ Oblivious Keyword Search with Authorization ⋮ 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 ⋮ \textsf{Catalic}: delegated PSI cardinality with applications to contact tracing ⋮ Oblivious pseudorandom functions from isogenies ⋮ Efficient set operations in the presence of malicious adversaries ⋮ On the impossibility of structure-preserving deterministic primitives ⋮ Reconstructing Generalized Staircase Polygons with Uniform Step Length ⋮ New Communication-Efficient Oblivious Transfer Protocols Based on Pairings ⋮ Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs ⋮ Rate-Limited Secure Function Evaluation: Definitions and Constructions ⋮ Constraining Pseudorandom Functions Privately ⋮ Scalable Multi-party Private Set-Intersection ⋮ Universally Composable Adaptive Oblivious Transfer ⋮ Towards Robust Computation on Encrypted Data ⋮ Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries ⋮ Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries ⋮ Efficient and secure outsourced approximate pattern matching protocol ⋮ Adaptive oblivious transfer with access control from lattice assumptions ⋮ Round-optimal verifiable oblivious pseudorandom functions from ideal lattices ⋮ On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding ⋮ The Feasibility of Outsourced Database Search in the Plain Model ⋮ Two-Message, Oblivious Evaluation of Cryptographic Functionalities ⋮ Functional encryption for set intersection in the multi-client setting ⋮ Private set intersection in the internet setting from lightweight oblivious PRF ⋮ Augmented Oblivious Polynomial Evaluation Protocol and Its Applications ⋮ Pseudorandom Functions: Three Decades Later
This page was built for publication: Theory of Cryptography
