Private Intersection of Certified Sets

  • Jan Camenisch
  • Gregory M. Zaverucha
Conference paper

DOI: 10.1007/978-3-642-03549-4_7

Volume 5628 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Camenisch J., Zaverucha G.M. (2009) Private Intersection of Certified Sets. In: Dingledine R., Golle P. (eds) Financial Cryptography and Data Security. FC 2009. Lecture Notes in Computer Science, vol 5628. Springer, Berlin, Heidelberg

Abstract

This paper introduces certified sets to the private set intersection problem. A private set intersection protocol allows Alice and Bob to jointly compute the set intersection function without revealing their input sets. Since the inputs are private, malicious participants may choose their sets arbitrarily and may use this flexibility to affect the result or learn more about the input of an honest participant. With certified sets, a trusted party ensures the inputs are valid and binds them to each participant. The strength of the malicious model with certified inputs increases the applicability of private set intersection to real world problems. With respect to efficiency the new certified set intersection protocol improves existing malicious model private set intersection protocols by a constant factor.

Keywords

private set intersection secure two-party computation certified sets 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Jan Camenisch
    • 1
  • Gregory M. Zaverucha
    • 2
  1. 1.Zürich Research LaboratoryIBM ResearchRüschlikon
  2. 2.Cheriton School of Computer ScienceUniversity of WaterlooWaterlooCanada