PSI from PaXoS: fast, malicious private set intersection
From MaRDI portal
Publication:2119031
DOI10.1007/978-3-030-45724-2_25zbMath1492.94160OpenAlexW3013638630MaRDI QIDQ2119031
Benny Pinkas, Mike Rosulek, Ni Trieu, Avishay Yanai
Publication date: 23 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-45724-2_25
Related Items
Oblivious key-value stores and amplification for private set intersection ⋮ Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes ⋮ Polynomial representation is tricky: maliciously secure private set intersection revisited ⋮ Multi-party updatable delegated private set intersection ⋮ 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 ⋮ Threshold private set intersection with better communication complexity ⋮ Structure-aware private set intersection, with applications to fuzzy matching ⋮ Adaptively code-correlation robustness functions and its applications to private set intersection ⋮ Practical and malicious private set intersection with improved efficiency ⋮ Finding one common item, privately ⋮ MyOPE: malicious security for oblivious polynomial evaluation ⋮ Cuckoo hashing in cryptography: optimal parameters, robustness and applications ⋮ SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model ⋮ Private join and compute from PIR with default ⋮ Malicious secure, structure-aware private set intersection ⋮ Amortizing rate-1 OT and applications to PIR and PSI ⋮ VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE ⋮ Multi-party threshold private set intersection with sublinear communication ⋮ Private set operations from oblivious switching ⋮ Efficient and tight oblivious transfer from PKE with tight multi-user security ⋮ Two-sided malicious security for private intersection-sum with cardinality ⋮ Private set intersection in the internet setting from lightweight oblivious PRF
Uses Software
Cites Work
- Unnamed Item
- Efficient circuit-based PSI via cuckoo hashing
- 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
- Improved OT Extension for Transferring Short Secrets
- Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection
- Bloomier Filters: A Second Look
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Uniform Hashing in Constant Time and Optimal Space
- Foundations of Cryptography
- On the power of commutativity in cryptography
- Cuckoo hashing
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - CRYPTO 2003
- Improved Private Set Intersection Against Malicious Adversaries
- Public Key Cryptography - PKC 2006
- More Robust Hashing: Cuckoo Hashing with a Stash
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
- Graphs, hypergraphs and hashing
