Linear Complexity Private Set Intersection for Secure Two-Party Protocols

DOI10.1007/978-3-030-65411-5_20MaRDI QIDQ6488032zbMATH OpenFDO

Authors F. Karakoç, Alptekin Küpçü

Publication date 22 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-65411-5_20

Mathematics Subject Classification ID

Privacy of data (68P27) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)

Recommendations

• Linear-complexity private set intersection protocols secure in malicious model
• Efficient circuit-based PSI with linear communication
• Combining private set intersection with secure two-party computation
• Private set intersection in the internet setting from lightweight oblivious PRF
• An algebraic approach to maliciously secure private set intersection

Cites work

• Advances in Cryptology - CRYPTO 2003
• An algebraic approach to maliciously secure private set intersection
• An efficient toolkit for computing private set operations
• Combining private set intersection with secure two-party computation
• Cuckoo hashing
• Efficient circuit-based PSI via cuckoo hashing
• Efficient circuit-based PSI with linear communication
• Efficient pseudorandom correlation generators: silent OT extension and more
• How to simulate it -- a tutorial on the simulation proof technique
• On the power of commutativity in cryptography
• PSI from PaXoS: fast, malicious private set intersection
• Secure and efficient private set intersection cardinality using Bloom filter
• Space/time trade-offs in hash coding with allowable errors
• Theory of Cryptography

Cited in

(8)

• Combining private set intersection with secure two-party computation
• Multi-party threshold private set intersection with sublinear communication
• PSI-stats: private set intersection protocols supporting secure statistical functions
• Efficient circuit-based PSI with linear communication
• Linear-complexity private set intersection protocols secure in malicious model
• Predicate private set intersection with linear complexity
• Computation efficient structure-aware PSI from incremental function secret sharing
• The Legendre pseudorandom function as a multivariate quadratic cryptosystem: security and applications

This page was built for publication: Linear Complexity Private Set Intersection for Secure Two-Party Protocols

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