Improved private set intersection for sets with small entries
From MaRDI portal
Publication:6067359
DOI10.1007/978-3-031-31371-4_7MaRDI QIDQ6067359
Publication date: 16 November 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer system organization (68Mxx)
Cites Work
- Efficient circuit-based PSI via cuckoo hashing
- Secure arithmetic computation with constant computational overhead
- VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE
- Efficient pseudorandom correlation generators from ring-LPN
- Private set intersection in the internet setting from lightweight oblivious PRF
- PSI from PaXoS: fast, malicious private set intersection
- 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
- Scalable private set union from symmetric-key techniques
- 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
- Balanced allocation and dictionaries with tightly packed constant size bins
- Hashing, Load Balancing and Multiple Choice
- Privacy-Preserving Set Operations
- Improved Private Set Intersection Against Malicious Adversaries
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
This page was built for publication: Improved private set intersection for sets with small entries
