Fast Private Set Operations with SEPIA

Private set operations allow correlation of sensitive data from multiple data owners. Although intensely researched, current solutions still exhibit limited scalability in terms of the supported maximum set size and number of sets. To address these issues, we propose a new approach to private set operations based on a combination of efficient secure multiparty computation and bloom filters, a spaceefficient probabilistic data structure for set representation. We design, implement and evaluate protocols for counting and non-counting set intersection, set union, threshold set union, weighted set intersection, and set cardinality estimation. Evaluation in realistic settings shows that our protocols are between twenty times and several orders of magnitudes faster than the state-of-the-art.

[1]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[2]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[3]  Avi Wigderson,et al.  Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.

[4]  Tal Rabin,et al.  Simplified VSS and fast-track multiparty computations with applications to threshold cryptography , 1998, PODC '98.

[5]  Andrei Broder,et al.  Network Applications of Bloom Filters: A Survey , 2004, Internet Math..

[6]  Somesh Jha,et al.  Global Intrusion Detection in the DOMINO Overlay System , 2004, NDSS.

[7]  Benny Pinkas,et al.  Efficient Private Matching and Set Intersection , 2004, EUROCRYPT.

[8]  Dawn Xiaodong Song,et al.  Privacy-Preserving Set Operations , 2005, CRYPTO.

[9]  Balachander Krishnamurthy,et al.  Collaborating against common enemies , 2005, IMC '05.

[10]  Mark Crovella,et al.  Mining anomalies using traffic feature distributions , 2005, SIGCOMM '05.

[11]  David Mazières,et al.  RE: Reliable Email , 2006, NSDI.

[12]  Siu-Ming Yiu,et al.  An Efficient Bloom Filter Based Solution for Multiparty Private Matching , 2006, Security and Management.

[13]  Keith B. Frikken.  Privacy-Preserving Set Union , 2007, ACNS.

[14]  Chuankun Wu,et al.  An Unconditionally Secure Protocol for Multi-Party Set Intersection , 2007, ACNS.

[15]  Xenofontas A. Dimitropoulos,et al.  Probabilistic lossy counting: an efficient algorithm for finding heavy hitters , 2008, CCRV.

[16]  Xenofontas A. Dimitropoulos,et al.  Privacy-preserving distributed network troubleshooting—bridging the gap between theory and practice , 2008, TSEC.

[17]  Huaxiong Wang,et al.  Privacy-Preserving Distributed Set Intersection , 2008, 2008 Third International Conference on Availability, Reliability and Security.

[18]  Yehuda Lindell,et al.  Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries , 2008, Journal of Cryptology.

[19]  C. Pandu Rangan,et al.  Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security , 2009, CANS.

[20]  Jennifer Rexford,et al.  Privacy-preserving collaborative anomaly detection , 2009 .

[21]  C. Pandu Rangan,et al.  Information Theoretically Secure Multi Party Set Intersection Re-Visited , 2009, IACR Cryptol. ePrint Arch..

[22]  Jung Hee Cheon,et al.  Multi-Party Privacy-Preserving Set Intersection with Quasi-Linear Complexity , 2012, IACR Cryptol. ePrint Arch..

[23]  Nitesh V. Chawla,et al.  Privacy-Preserving Network Aggregation , 2010, PAKDD.

[24]  Wolfgang Nejdl,et al.  Cardinality estimation and dynamic length adaptation for Bloom filters , 2010, Distributed and Parallel Databases.

[25]  Xenofontas A. Dimitropoulos,et al.  SEPIA: Privacy-Preserving Aggregation of Multi-Domain Network Events and Statistics , 2010, USENIX Security Symposium.

[26]  Emiliano De Cristofaro,et al.  (If) Size Matters: Size-Hiding Private Set Intersection , 2011, IACR Cryptol. ePrint Arch..

[27]  Emiliano De Cristofaro,et al.  Practical Private Set Intersection Protocols with Linear Complexity , 2010, Financial Cryptography.

[28]  Emiliano De Cristofaro,et al.  Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model , 2010, ASIACRYPT.

[29]  Fabio Ricciato,et al.  Reduce to the Max: A Simple Approach for Massive-Scale Privacy-Preserving Collaborative Network Measurements (Short Paper) , 2011, TMA.

[30]  Jonathan Katz,et al.  Faster Secure Two-Party Computation Using Garbled Circuits , 2011, USENIX Security Symposium.

[31]  Carmit Hazay,et al.  Efficient Set Operations in the Presence of Malicious Adversaries , 2010, Journal of Cryptology.

[32]  Jung Hee Cheon,et al.  Constant-Round Privacy Preserving Multiset Union , 2013, IACR Cryptol. ePrint Arch..

[33]  Martin Burkhart.  Enabling collaborative network security with privacy-preserving data aggregation , 2011 .