Predicate private set intersection with linear complexity
From MaRDI portal
Publication:6535113
DOI10.1007/978-3-031-33491-7_6zbMATH Open1540.68093MaRDI QIDQ6535113FDOQ6535113
Authors: Yaxi Yang, Jian Weng, Yufeng Yi, Changyu Dong, Leo Yu Zhang, Jianying Zhou 
Publication date: 10 November 2023
Recommendations
- Faster unbalanced private set intersection
- Linear Complexity Private Set Intersection for Secure Two-Party Protocols
- Efficient private set intersection cardinality protocol in the reverse unbalanced setting
- PSI-stats: private set intersection protocols supporting secure statistical functions
- Efficient scalable multiparty private set-intersection via garbled Bloom filters
Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Privacy of data (68P27)
Cites Work
- Cuckoo hashing
- Advances in Cryptology - CRYPTO 2003
- Improved OT extension for transferring short secrets
- Efficient circuit-based PSI via cuckoo hashing
- Efficient circuit-based PSI with linear communication
- How to simulate it -- a tutorial on the simulation proof technique
- Private set intersection in the internet setting from lightweight oblivious PRF
- PSI from PaXoS: fast, malicious private set intersection
- SpOT-light: lightweight private set intersection from sparse OT extension
- Private set operations from oblivious switching
- PSI-stats: private set intersection protocols supporting secure statistical functions
- From oblivious AES to efficient and secure database join in the multiparty setting
- Private join and compute from PIR with default
Cited In (2)
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)
