Design and implementation of privacy-preserving reconciliation protocols

Privacy-preserving reconciliation protocols on ordered sets are protocols that solve a particular subproblem of secure multiparty computation. Here, each party holds a private input set of equal size in which the elements are ordered according to the party's preferences. The goal of a reconciliation protocol on these ordered sets is then to find all common elements in the parties' input sets that maximize the joint preferences of the parties. In this paper, we present two main contributions that improve on the current state of the art. First, we propose two new protocols for privacy-preserving reconciliation and prove their correctness and security properties. We implement and evaluate our protocols as well as two previously published multi-party reconciliation protocols. Our implementation is the first practical solution to reconciliation problems in the multi-party setting. Our comparison shows that our new protocols outperform the original protocols. The basic optimization idea is to reduce the highest degree polynomial in the protocol design. Second, we generalize privacy-preserving reconciliation protocols, i. e., relaxing the input constraint from totally ordered input sets of equal size to pre-ordered input sets of arbitrary size.

[1]  Ulrike Meyer,et al.  Implementation and performance evaluation of privacy-preserving fair reconciliation protocols on ordered sets , 2011, CODASPY '11.

[2]  Andrew Chi-Chih Yao,et al.  Protocols for secure computations , 1982, FOCS 1982.

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

[4]  Pascal Paillier,et al.  Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.

[5]  Silvio Micali,et al.  Probabilistic encryption & how to play mental poker keeping secret all partial information , 1982, STOC '82.

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

[7]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

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

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

[10]  Ulrike Meyer,et al.  Enabling fair and privacy-preserving applications using reconciliation protocols on ordered sets , 2011, 34th IEEE Sarnoff Symposium.

[11]  Aggelos Kiayias,et al.  Polynomial Reconstruction Based Cryptography , 2001, Selected Areas in Cryptography.

[12]  Ulrike Meyer,et al.  New Advances on Privacy-Preserving Policy Reconciliation , 2010, IACR Cryptol. ePrint Arch..

[13]  Ulrike Meyer,et al.  Distributed Privacy-Preserving Policy Reconciliation , 2007, 2007 IEEE International Conference on Communications.

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

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

[16]  Jacques Stern,et al.  Sharing Decryption in the Context of Voting or Lotteries , 2000, Financial Cryptography.

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

[18]  P. L. Montgomery.  Modular multiplication without trial division , 1985 .

[19]  Ulrike Meyer,et al.  Fair and Privacy-Preserving Multi-party Protocols for Reconciling Ordered Input Sets , 2010, ISC.

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

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