Private set operations from oblivious switching
From MaRDI portal
Recommendations
- Privacy-Preserving Set Operations
- An efficient toolkit for computing private set operations
- Privacy-preserving mixed set operations
- Private set intersection: new generic constructions and feasibility results
- Oblivious key-value stores and amplification for private set intersection
- Invertible polynomial representation for private set operations
- A fair and efficient mutual private set intersection protocol from a two-way oblivious pseudorandom function
Cites work
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Combining private set intersection with secure two-party computation
- Efficient circuit-based PSI via cuckoo hashing
- Efficient circuit-based PSI with linear communication
- Efficient pseudorandom correlation generators: silent OT extension and more
- Efficient set intersection with simulation-based security
- How to hide circuits in MPC an efficient framework for private function evaluation
- Improved OT extension for transferring short secrets
- Improved private set intersection against malicious adversaries
- Privacy-Preserving Set Operations
- Private intersection of certified sets
- Private set intersection in the internet setting from lightweight oblivious PRF
- Privately computing set-union and set-intersection cardinality via Bloom filters
- PSI from PaXoS: fast, malicious private set intersection
- Scalable private set union from symmetric-key techniques
- Secure and efficient private set intersection cardinality using Bloom filter
- SpOT-light: lightweight private set intersection from sparse OT extension
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
- Two-sided malicious security for private intersection-sum with cardinality
Cited in
(24)- Efficient robust private set intersection
- An efficient toolkit for computing private set operations
- PSI-stats: private set intersection protocols supporting secure statistical functions
- Two-sided malicious security for private intersection-sum with cardinality
- Private identity agreement for private set functionalities
- Scalable private set union from symmetric-key techniques
- Size-hiding in private set intersection: existential results and constructions
- Privately computing set-union and set-intersection cardinality via Bloom filters
- Private intersection of certified sets
- Practical multi-party private set intersection cardinality and intersection-sum under arbitrary collusion
- Finding one common item, privately
- Private join and compute from PIR with default
- Malicious secure, structure-aware private set intersection
- Predicate private set intersection with linear complexity
- Scalable multi-party private set union from multi-query secret-shared private membership test
- Improved circuit-based PSI via equality preserving compression
- Private set operations from multi-query reverse private membership test
- Computation efficient structure-aware PSI from incremental function secret sharing
- Unbalanced private computation on set intersection with reduced computation and communication
- Efficient permutation correlations and batched random access for two-party computation
- Updatable private set intersection revisited: extended functionalities, deletion, and worst-case complexity
- Malicious private set union with two-sided output
- Is PSI really faster than PSU? Achieving efficient PSU with invertible Bloom filters
- Secret-shared shuffle from authenticated correlations
This page was built for publication: Private set operations from oblivious switching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2061976)
