Paper 2018/238
Private Set Intersection with Linear Communication from General Assumptions
Brett Hemenway Falk, Daniel Noble, and Rafail Ostrovsky
Abstract
This work presents a hashing-based algorithm for Private Set Intersection (PSI) in
the honest-but-curious setting. The protocol is generic, modular and provides both asymptotic
and concrete efficiency improvements over existing PSI protocols.
If each player has
Note: Added doi link to WPES version.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Minor revision. Workshop on Privacy in the Electronic Society, 2019
- DOI
- 10.1145/3338498.3358645
- Contact author(s)
-
fbrett @ cis upenn edu
dgnoble @ cis upenn edu - History
- 2019-10-02: last of 2 revisions
- 2018-03-05: received
- See all versions
- Short URL
- https://ia.cr/2018/238
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2018/238, author = {Brett Hemenway Falk and Daniel Noble and Rafail Ostrovsky}, title = {Private Set Intersection with Linear Communication from General Assumptions}, howpublished = {Cryptology {ePrint} Archive, Paper 2018/238}, year = {2018}, doi = {10.1145/3338498.3358645}, url = {https://eprint.iacr.org/2018/238} }