Private computations on set intersection
From MaRDI portal
Cites work
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Applied cryptography and network security. 7th international conference, ACNS 2009, Paris-Rocquencourt, France, June 2--5, 2009. Proceedings
- Applied cryptography and network security. 9th international conference, ACNS 2011, Nerja, Spain, June 7--10, 2011. Proceedings
- Combining private set intersection with secure two-party computation
- Efficient circuit-based PSI with linear communication
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Fast secure computation of set intersection
- Foundations of Cryptography
- scientific article; zbMATH DE number 1256767 (Why is no real title available?)
- Linear-complexity private set intersection protocols secure in malicious model
- Lower Bounds for Oblivious Transfer Reductions
- Oblivious key-value stores and amplification for private set intersection
- Oblivious transfers and intersecting codes
- Privacy-Preserving Set Operations
- Privacy-Preserving Set Union
- Private intersection of certified sets
- Private set intersection in the internet setting from lightweight oblivious PRF
- Private set intersection: new generic constructions and feasibility results
- PSI from PaXoS: fast, malicious private set intersection
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- SpOT-light: lightweight private set intersection from sparse OT extension
- The communication complexity of threshold private set intersection
- Theory of Cryptography
- Tutorials on the foundations of cryptography. Dedicated to Oded Goldreich
This page was built for publication: Private computations on set intersection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6613361)
