Fast secure computation of set intersection
From MaRDI portal
Recommendations
- GUC-secure set-intersection computation
- Efficient set intersection with simulation-based security
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Advances in Cryptology - EUROCRYPT 2004
Cited in
(31)- On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding
- Secure computation of two set-relationships with the unencrypted method
- Scalable multi-party private set-intersection
- Finding one common item, privately
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
- Efficient set intersection with simulation-based security
- An Unconditionally Secure Protocol for Multi-Party Set Intersection
- Efficient set operations in the presence of malicious adversaries
- Private set intersection: new generic constructions and feasibility results
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- New realizations of efficient and secure private set intersection protocols preserving fairness
- Efficient set operations in the presence of malicious adversaries
- Linear-time 2-party secure merge from additively homomorphic encryption
- Secure and efficient multiparty private set intersection cardinality
- Malicious secure, structure-aware private set intersection
- Adaptively secure threshold blind BLS signatures and threshold oblivious PRF
- Game changer: a modular framework for OPRF security
- Private computations on set intersection
- Private set-intersection with common set-up
- An efficient approach for secure multi-party computation without authenticated channel
- Privately computing set-union and set-intersection cardinality via Bloom filters
- TOPPSS: cost-minimal password-protected secret sharing based on threshold OPRF
- Efficient Concurrent Covert Computation of String Equality and Set Intersection
- Laconic private set intersection and applications
- Secure set intersection with untrusted hardware tokens
- Structure-aware private set intersection, with applications to fuzzy matching
- Two-client and multi-client functional encryption for set intersection
- Computation efficient structure-aware PSI from incremental function secret sharing
- GUC-secure set-intersection computation
- Oblivious pseudorandom functions from isogenies
- Low-leakage secure search for Boolean expressions
This page was built for publication: Fast secure computation of set intersection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3588357)
