Private set operations from oblivious switching
From MaRDI portal
Publication:2061976
DOI10.1007/978-3-030-75248-4_21OpenAlexW3164295456MaRDI QIDQ2061976
Mike Rosulek, Payman Mohassel, Gayathri Garimella, Jaspal Singh, Saeed Sadeghian
Publication date: 21 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-75248-4_21
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer system organization (68Mxx)
Related Items
Practical multi-party private set intersection cardinality and intersection-sum under arbitrary collusion ⋮ Finding one common item, privately ⋮ Malicious secure, structure-aware private set intersection ⋮ PSI-stats: private set intersection protocols supporting secure statistical functions
Cites Work
- Efficient set intersection with simulation-based security
- Efficient circuit-based PSI via cuckoo hashing
- Combining private set intersection with secure two-party computation
- Secure and efficient private set intersection cardinality using Bloom filter
- Two-sided malicious security for private intersection-sum with cardinality
- Private set intersection in the internet setting from lightweight oblivious PRF
- PSI from PaXoS: fast, malicious private set intersection
- Scalable private set union from symmetric-key techniques
- Efficient circuit-based PSI with linear communication
- SpOT-light: lightweight private set intersection from sparse OT extension
- Efficient pseudorandom correlation generators: silent OT extension and more
- Improved OT Extension for Transferring Short Secrets
- Two Halves Make a Whole
- Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters
- Private Intersection of Certified Sets
- How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - CRYPTO 2003
- Privacy-Preserving Set Operations
- Improved Private Set Intersection Against Malicious Adversaries
