Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model

  • Emiliano De Cristofaro
  • Jihye Kim
  • Gene Tsudik
Conference paper

DOI: 10.1007/978-3-642-17373-8_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6477)
Cite this paper as:
De Cristofaro E., Kim J., Tsudik G. (2010) Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model. In: Abe M. (eds) Advances in Cryptology - ASIACRYPT 2010. ASIACRYPT 2010. Lecture Notes in Computer Science, vol 6477. Springer, Berlin, Heidelberg

Abstract

Private Set Intersection (PSI) protocols allow one party (“client”) to compute an intersection of its input set with that of another party (“server”), such that the client learns nothing other than the set intersection and the server learns nothing beyond client input size. Prior work yielded a range of PSI protocols secure under different cryptographic assumptions. Protocols operating in the semi-honest model offer better (linear) complexity while those in the malicious model are often significantly more costly. In this paper, we construct PSI and Authorized PSI (APSI) protocols secure in the malicious model under standard cryptographic assumptions, with both linear communication and computational complexities. To the best of our knowledge, our APSI is the first solution to do so. Finally, we show that our linear PSI is appreciably more efficient than the state-of-the-art.

Download to read the full conference paper text

Copyright information

© International Association for Cryptologic Research 2010

Authors and Affiliations

  • Emiliano De Cristofaro
    • 1
  • Jihye Kim
    • 2
  • Gene Tsudik
    • 1
  1. 1.Computer Science DepartmentUniversity of CaliforniaIrvine
  2. 2.Department of Mathematical SciencesSeoul National University 

Personalised recommendations