Predicate private set intersection with linear complexity

DOI10.1007/978-3-031-33491-7_6zbMATH Open1540.68093MaRDI QIDQ6535113

Jian Weng, Yufeng Yi, Jianying Zhou, Changyu Dong, Leo Yu Zhang, Yaxi Yang

Publication date: 10 November 2023

zbMATH Keywords

private set intersectionsecure comparisonsecure two-party computation

Mathematics Subject Classification ID

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

Cites Work

• Efficient circuit-based PSI via cuckoo hashing
• Private set operations from oblivious switching
• PSI-stats: private set intersection protocols supporting secure statistical functions
• Private set intersection in the internet setting from lightweight oblivious PRF
• PSI from PaXoS: fast, malicious private set intersection
• Efficient circuit-based PSI with linear communication
• SpOT-light: lightweight private set intersection from sparse OT extension
• Improved OT Extension for Transferring Short Secrets
• From Oblivious AES to Efficient and Secure Database Join in the Multiparty Setting
• Cuckoo hashing
• How to Simulate It – A Tutorial on the Simulation Proof Technique
• Advances in Cryptology - CRYPTO 2003
• Private join and compute from PIR with default

This page was built for publication: Predicate private set intersection with linear complexity

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