Improved private set intersection for sets with small entries

DOI10.1007/978-3-031-31371-4_7MaRDI QIDQ6067359zbMATH OpenFDO

Authors Dung Bui, Geoffroy Couteau

Publication date 16 November 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-31371-4_7

Mathematics Subject Classification ID

Computer system organization (68Mxx) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Private set intersection in the internet setting from lightweight oblivious PRF
• Linear-complexity private set intersection protocols secure in malicious model
• Private set intersection: new generic constructions and feasibility results
• An algebraic approach to maliciously secure private set intersection
• PSI from PaXoS: fast, malicious private set intersection

Cites work

• An algebraic approach to maliciously secure private set intersection
• Balanced allocation and dictionaries with tightly packed constant size bins
• Efficient circuit-based PSI via cuckoo hashing
• Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
• Efficient pseudorandom correlation generators from ring-LPN
• Efficient pseudorandom correlation generators: silent OT extension and more
• Hashing, load balancing and multiple choice
• Improved private set intersection against malicious adversaries
• Oblivious key-value stores and amplification for private set intersection
• Polynomial representation is tricky: maliciously secure private set intersection revisited
• Privacy-Preserving Set Operations
• 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
• Secure arithmetic computation with constant computational overhead
• Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
• SpOT-light: lightweight private set intersection from sparse OT extension
• The communication complexity of threshold private set intersection
• VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE

Cited in

(14)

• SpOT-light: lightweight private set intersection from sparse OT extension
• Laconic private set intersection and applications
• Credibility in private set membership
• Threshold private set intersection with better communication complexity
• Scalable multi-party private set union from multi-query secret-shared private membership test
• Practically efficient private set intersection from trusted hardware with side-channels
• Improved circuit-based PSI via equality preserving compression
• Fuzzy private set intersection with large hyperballs
• The hardness of LPN over any integer ring and field for PCG applications
• New framework for structure-aware PSI from distributed function secret sharing
• Fuzzy private set intersection from VOLE
• Fast pseudorandom correlation functions from sparse LPN
• Pseudorandom correlation functions for garbled circuits
• Amortizing Circuit-PSI in the multiple sender/receiver setting

This page was built for publication: Improved private set intersection for sets with small entries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6067359)