Private set intersection

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Private set intersection
General
Related tohomomorphic encryption

Private set intersection is a secure multiparty computation cryptographic technique[1] that allows two parties holding sets to compare encrypted versions of these sets in order to compute the intersection. In this scenario, neither party reveals anything to the counterparty except for the elements in the intersection.

Other variants of this exist, such as the server-client scenario, in which only the client learns the intersection of her set with the set of the server, without the server learning intersection of his set with the clients. [2]

For the comparison of data sets by cryptographic hashes on a small and predictable domain, precautions should be taken to prevent dictionary attacks. [3]

References[edit]

  1. ^ Chen, Hao; Laine, Kim; Rindal, Peter (2018-05-16). Fast Private Set Intersection from Homomorphic Encryption. ISBN 9781450349468.
  2. ^ Pinkas, Benny. Private Set Intersection (PDF). open access
  3. ^ Ihle, Cornelius; Schubotz, Moritz; Meuschke, Norman; Gipp, Bela (2020-08-02). "A First Step Towards Content Protecting Plagiarism Detection". Proceedings of the ACM/IEEE Joint Conference on Digital Libraries in 2020. Virtual Event China: ACM: 341–344. arXiv:2005.11504. doi:10.1145/3383583.3398620. ISBN 978-1-4503-7585-6. open access