Oblivious key-value stores and amplification for private set intersection
From MaRDI portal
(Redirected from Publication:2128570)
Recommendations
- Private set intersection in the internet setting from lightweight oblivious PRF
- PSI from PaXoS: fast, malicious private set intersection
- Private set intersection: new generic constructions and feasibility results
- SpOT-light: lightweight private set intersection from sparse OT extension
- An algebraic approach to maliciously secure private set intersection
Cites work
- scientific article; zbMATH DE number 1301967 (Why is no real title available?)
- Actively secure 1-out-of-\(N\) OT extension with application to private set intersection
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- An algebraic approach to maliciously secure private set intersection
- Efficient Concurrent Covert Computation of String Equality and Set Intersection
- Efficient circuit-based PSI with linear communication
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
- Efficient pseudorandom correlation generators: silent OT extension and more
- Efficient scalable multiparty private set-intersection via garbled Bloom filters
- Improved private set intersection against malicious adversaries
- More general completeness theorems for secure two-party computation
- More robust hashing: cuckoo hashing with a stash
- Oblivious transfer and polynomial evaluation
- PSI from PaXoS: fast, malicious private set intersection
- Privacy-Preserving Set Operations
- Privacy-preserving group discovery with linear complexity
- Private set intersection in the internet setting from lightweight oblivious PRF
- Probability and Computing
- Scalable multi-party private set-intersection
- Scalable private set union from symmetric-key techniques
- SpOT-light: lightweight private set intersection from sparse OT extension
- The communication complexity of threshold private set intersection
- The pure literal rule threshold and cores in random hypergraphs
- VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE
Cited in
(20)- Improved private set intersection for sets with small entries
- Cuckoo hashing in cryptography: optimal parameters, robustness and applications
- Private set operations from oblivious switching
- Private polynomial commitments and applications to MPC
- Malicious secure, structure-aware private set intersection
- Computation efficient structure-aware PSI from incremental function secret sharing
- Privacy-preserving Dijkstra
- Private computations on set intersection
- MPCCache: privacy-preserving multi-party cooperative cache sharing at the edge
- Maliciously Secure Multi-party PSI with Lower Bandwidth and Faster Computation
- Practically efficient private set intersection from trusted hardware with side-channels
- Improved circuit-based PSI via equality preserving compression
- Half-tree: halving the cost of tree expansion in COT and DPF
- Hiding the input-size in multi-party private set intersection
- Scalable multi-party private set union from multi-query secret-shared private membership test
- Private set operations from multi-query reverse private membership test
- Fuzzy private set intersection with large hyperballs
- Practical multi-party private set intersection cardinality and intersection-sum under arbitrary collusion
- SE-PSI: fog/cloud server-aided enhanced secure and effective private set intersection on scalable datasets with Bloom Filter
- Structure-aware private set intersection, with applications to fuzzy matching
This page was built for publication: Oblivious key-value stores and amplification for private set intersection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2128570)
