Oblivious key-value stores and amplification for private set intersection

DOI10.1007/978-3-030-84245-1_14zbMath1486.94101OpenAlexW3183199186MaRDI QIDQ2128570

Avishay Yanai, Benny Pinkas, Ni Trieu, Mike Rosulek, Gayathri Garimella

Publication date: 22 April 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-84245-1_14

zbMATH Keywords

failure probabilitytwo-party PSI protocols

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (10)

SE-PSI: fog/cloud server-aided enhanced secure and effective private set intersection on scalable datasets with Bloom Filter ⋮ MPCCache: privacy-preserving multi-party cooperative cache sharing at the edge ⋮ Hiding the input-size in multi-party private set intersection ⋮ Private polynomial commitments and applications to MPC ⋮ Improved private set intersection for sets with small entries ⋮ Structure-aware private set intersection, with applications to fuzzy matching ⋮ Practical multi-party private set intersection cardinality and intersection-sum under arbitrary collusion ⋮ Cuckoo hashing in cryptography: optimal parameters, robustness and applications ⋮ Half-tree: halving the cost of tree expansion in COT and DPF ⋮ Malicious secure, structure-aware private set intersection

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient scalable multiparty private set-intersection via garbled Bloom filters
• VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE
• Private set intersection in the internet setting from lightweight oblivious PRF
• PSI from PaXoS: fast, malicious private set intersection
• Scalable private set union from symmetric-key techniques
• Efficient circuit-based PSI with linear communication
• An algebraic approach to maliciously secure private set intersection
• SpOT-light: lightweight private set intersection from sparse OT extension
• Efficient pseudorandom correlation generators: silent OT extension and more
• The communication complexity of threshold private set intersection
• Efficient Concurrent Covert Computation of String Equality and Set Intersection
• Oblivious transfer and polynomial evaluation
• Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection
• More general completeness theorems for secure two-party computation
• Privacy-Preserving Group Discovery with Linear Complexity
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - CRYPTO 2003
• Privacy-Preserving Set Operations
• Probability and Computing
• Scalable Multi-party Private Set-Intersection
• Improved Private Set Intersection Against Malicious Adversaries
• More Robust Hashing: Cuckoo Hashing with a Stash
• Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries

This page was built for publication: Oblivious key-value stores and amplification for private set intersection