Efficient set intersection with simulation-based security
From MaRDI portal
Publication:271588
DOI10.1007/s00145-014-9190-0zbMath1351.94044DBLPjournals/joc/FreedmanHNP16OpenAlexW2129550671WikidataQ59379588 ScholiaQ59379588MaRDI QIDQ271588
Carmit Hazay, Kobbi Nissim, Michael J. Freedman, Benny Pinkas
Publication date: 7 April 2016
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-014-9190-0
Related Items (11)
Privacy-preserving mixed set operations ⋮ Efficient private set intersection cardinality protocol in the reverse unbalanced setting ⋮ \textsf{Catalic}: delegated PSI cardinality with applications to contact tracing ⋮ Provably Secure Fair Mutual Private Set Intersection Cardinality Utilizing Bloom Filter ⋮ New Realizations of Efficient and Secure Private Set Intersection Protocols Preserving Fairness ⋮ Scalable Multi-party Private Set-Intersection ⋮ Secure and efficient multiparty private set intersection cardinality ⋮ Server-aided private set intersection based on reputation ⋮ Private set operations from oblivious switching ⋮ PSI-stats: private set intersection protocols supporting secure statistical functions ⋮ Two-sided malicious security for private intersection-sum with cardinality
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Explicit and efficient hash families suffice for cuckoo hashing with a stash
- A proof of security of Yao's protocol for two-party computation
- Efficient robust private set intersection
- How to construct constant-round zero-knowledge proof systems for NP
- Secure two-party computation via cut-and-choose oblivious transfer
- Security and composition of multiparty cryptographic protocols
- Applications of matrix methods to the theory of lower bounds in computational complexity
- Oblivious transfer and polynomial evaluation
- Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting
- Multiparty Computation from Somewhat Homomorphic Encryption
- (If) Size Matters: Size-Hiding Private Set Intersection
- How asymmetry helps load balancing
- Efficient Set Operations in the Presence of Malicious Adversaries
- Almost random graphs with simple hash functions
- Asymmetric balanced allocation with simple hash functions
- Fast Secure Computation of Set Intersection
- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- A New Protocol for Conditional Disclosure of Secrets and Its Applications
- Uniform Hashing in Constant Time and Optimal Space
- Private Intersection of Certified Sets
- A public key cryptosystem and a signature scheme based on discrete logarithms
- New directions in cryptography
- The Probabilistic Communication Complexity of Set Intersection
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Balanced Allocations
- Cuckoo hashing
- Foundations of Cryptography
- Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing
- Advances in Cryptology - EUROCRYPT 2004
- The Power of Simple Tabulation Hashing
- Efficient Two-Party Secure Computation on Committed Inputs
- Efficient generation of shared RSA keys
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Privacy-Preserving Set Operations
- Theory of Cryptography
- More Robust Hashing: Cuckoo Hashing with a Stash
- Advances in Cryptology - ASIACRYPT 2003
- A fair and efficient solution to the socialist millionaires' problem
This page was built for publication: Efficient set intersection with simulation-based security
