Finding one common item, privately
From MaRDI portal
Publication:6134834
DOI10.1007/978-3-031-14791-3_20zbMATH Open1518.94044OpenAlexW4294698925MaRDI QIDQ6134834FDOQ6134834
Authors: Tyler Beauregard, Janabel Xia, Mike Rosulek 
Publication date: 25 July 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-14791-3_20
Recommendations
- Private set-intersection with common set-up
- Private set intersection: new generic constructions and feasibility results
- Private set intersection in the internet setting from lightweight oblivious PRF
- (If) size matters: size-hiding private set intersection
- Structure-aware private set intersection, with applications to fuzzy matching
Cites Work
- Advances in Cryptology - EUROCRYPT 2004
- Fast secure computation of set intersection
- Privacy-Preserving Set Operations
- Title not available (Why is that?)
- Linear-complexity private set intersection protocols secure in malicious model
- Efficient circuit-based PSI via cuckoo hashing
- Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation
- Efficient circuit-based PSI with linear communication
- Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
- Private set intersection in the internet setting from lightweight oblivious PRF
- PSI from PaXoS: fast, malicious private set intersection
- SpOT-light: lightweight private set intersection from sparse OT extension
- Improved Private Set Intersection Against Malicious Adversaries
- Private set operations from oblivious switching
Cited In (1)
This page was built for publication: Finding one common item, privately
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134834)
