An efficient toolkit for computing third-party private set intersection
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1301967 (Why is no real title available?)
- A new analysis of the false positive rate of a Bloom filter
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Actively secure 1-out-of-N OT extension with application to private set intersection
- Advances in Cryptology - EUROCRYPT 2004
- An efficient toolkit for computing private set operations
- Cuckoo hashing
- Cuckoo hashing: Further analysis
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Efficient circuit-based PSI via cuckoo hashing
- Efficient circuit-based PSI with linear communication
- On the false-positive rate of Bloom filters
- Private set intersection in the internet setting from lightweight oblivious PRF
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Scalable multi-party private set-intersection
- Secure two-party computation is practical
- SpOT-light: lightweight private set intersection from sparse OT extension
- Space efficient hash tables with worst case constant access time
- Space/time trade-offs in hash coding with allowable errors
- Theory of Cryptography
- VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE
- \textsf{Catalic}: delegated PSI cardinality with applications to contact tracing
This page was built for publication: An efficient toolkit for computing third-party private set intersection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6955337)
