research-article

Design and implementation of privacy-preserving reconciliation protocols

Authors:

Georg Neugebauer,

Lucas Brutschy,

Susanne WetzelAuthors Info & Claims

EDBT '13: Proceedings of the Joint EDBT/ICDT 2013 Workshops

Pages 121 - 130

https://doi.org/10.1145/2457317.2457339

Published: 18 March 2013 Publication History

Abstract

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.

References

[1]

Giuseppe Ateniese, Emiliano De Cristofaro, and Gene Tsudik. (if) size matters: size-hiding private set intersection. PKC'11, pages 156--173, Berlin, Heidelberg, 2011. Springer-Verlag.

Digital Library

[2]

Jung Hee Cheon, Stanislaw Jarecki, and Jae Hong Seo. Multi-party privacy-preserving set intersection with quasi-linear complexity. Cryptology ePrint Archive, Report 2010/512, 2010.

[3]

Pierre-Alain Fouque, Guillaume Poupard, and Jacques Stern. Sharing decryption in the context of voting or lotteries. In Proc. of the 4th Intern. Conference on Financial Cryptography, FC '00, pages 90--104, London, UK, 2001. Springer-Verlag.

Digital Library

[4]

M. J. Freedman, K. Nissim, and B. Pinkas. Efficient Private Matching and Set Intersection. In Proceedings of EUROCRYPT'04, 2004.

[5]

Keith Frikken. Privacy-preserving set union. In Proc. of the 5th Intern. Conf. on Applied Cryptography and Network Security, ACNS '07, pages 237--252. Springer-Verlag, 2007.

Digital Library

[6]

GNU Multiple Prec. Arithmetic Library. http://gmplib.org/.

[7]

O. Goldreich, S. Micali, and A. Wigderson. How to Play ANY Mental Game. In STOC '87: Proc. of the Nineteenth Annual ACM Conference on Theory of Computing. ACM, 1987.

Digital Library

[8]

Shafi Goldwasser and Silvio Micali. Probabilistic encryption & how to play mental poker keeping secret all partial information. In ACM Symposium on Theory of Computing - STOC 1982, pages 365--377. ACM, 1984.

Digital Library

[9]

Jeongdae Hong, Jung Woo Kim, Jihye Kim, Kunsoo Park, and Jung Hee Cheon. Constant-round privacy preserving multiset union. IACR Cryptology ePrint Archive, page 138, 2011.

[10]

JNI: Java Native Interface for integration of code written in other languages. http://java.sun.com/docs/books/jni/.

[11]

A. Karatsuba and Yu. Ofman. Multiplication of Many-Digital Numbers by Automatic Computers. In Proceedings of the USSR Academy of Sciences 145, 1962.

[12]

L. Kissner and D. X. Song. Privacy-Preserving Set Operations (Last modified June 2006). In CRYPTO, pages 241--257, 2005.

Digital Library

[13]

R. Li and C. Wu. An unconditionally secure protocol for multi-party set intersection. In ACNS '07, pages 226--236. Springer-Verlag, 2007.

Digital Library

[14]

D. Mayer, G. Neugebauer, U. Meyer, and S. Wetzel. Enabling fair and privacy-preserving applications using reconciliation protocols on ordered sets. In 34rd IEEE Sarnoff Symposium, Princeton, 2011.

[15]

D. A. Mayer, D. Teubert, S. Wetzel, and U. Meyer. Implementation and Performance Evaluation of Privacy-Preserving Fair Reconciliation Protocols on Ordered Sets. In First ACM Conference on Data and Application Security and Privacy (CODASPY'11), 2011.

Digital Library

[16]

U. Meyer, S. Wetzel, and S. Ioannidis. Distributed privacy-preserving policy reconciliation. In ICC, pages 1342--1349, 2007.

[17]

U. Meyer, S. Wetzel, and S. Ioannidis. New advances on privacy-preserving policy reconciliation. In iacr eprint 2010/64, 2010. http://eprint.iacr.org/2010/064.

[18]

Peter Montgomery. Modular Multiplication Without Trial Division. In Math. Computation, vol. 44, 1985.

[19]

G. S. Narayanan, T. Aishwarya, A. Agrawal, A. Patra, A. Choudhary, and C. P. Rangan. Multi party distributed private matching, set disjointness and cardinality of set intersection with information theoretic security. In Cryptology and Network Security, pages 21--40. Springer-Verlag, 2009.

Digital Library

[20]

G. Neugebauer, U. Meyer, and S. Wetzel. Fair and Privacy-Preserving Multi-Party Protocols for Reconciling Ordered Input Sets. In Proc. of ISC 2010, LNCS.

Digital Library

[21]

G. Neugebauer, U. Meyer, and S. Wetzel. Fair and Privacy-Preserving Multi-Party Protocols for Reconciling Ordered Input Sets (Extended Version). Cryptology ePrint Archive, Report 2010/512, 2011.

[22]

P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology, pages 223--238. Springer-Verlag, 1999.

Digital Library

[23]

Arpita Patra, Ashish Choudhary, and C. Pandu Rangan. Selected areas in cryptography. chapter Information Theoretically Secure Multi Party Set Intersection Re-visited, pages 71--91. Springer-Verlag, Berlin, Heidelberg, 2009.

Digital Library

[24]

A. Yao. Protocols for Secure Computation. In Proc. of the IEEE (FOCS)'82, 1982.

Digital Library

Cited By

Kerschbaum FWainwright RCorchado JBechini AHong J(2015)Oblivious outsourcing of garbled circuit generationProceedings of the 30th Annual ACM Symposium on Applied Computing10.1145/2695664.2695665(2134-2140)Online publication date: 13-Apr-2015
https://dl.acm.org/doi/10.1145/2695664.2695665
Farr S ODomingo-Ferrer JBlanco-Justicia A(2013)Privacy-Preserving Trust Management Mechanisms from Private Matching SchemesRevised Selected Papers of the 8th International Workshop on Data Privacy Management and Autonomous Spontaneous Security - Volume 824710.1007/978-3-642-54568-9_26(390-398)Online publication date: 12-Sep-2013
https://dl.acm.org/doi/10.1007/978-3-642-54568-9_26
Neugebauer GBrutschy LMeyer UWetzel S(2013)Privacy-Preserving Multi-Party Reconciliation Secure in the Malicious ModelRevised Selected Papers of the 8th International Workshop on Data Privacy Management and Autonomous Spontaneous Security - Volume 824710.1007/978-3-642-54568-9_12(178-193)Online publication date: 12-Sep-2013
https://dl.acm.org/doi/10.1007/978-3-642-54568-9_12
Show More Cited By

Index Terms

Design and implementation of privacy-preserving reconciliation protocols
1. Security and privacy
  1. Cryptography
  2. Systems security
    1. Operating systems security

Recommendations

Privacy-Preserving Multi-Party Reconciliation Secure in the Malicious Model
Revised Selected Papers of the 8th International Workshop on Data Privacy Management and Autonomous Spontaneous Security - Volume 8247

The problem of fair and privacy-preserving ordered set reconciliation arises in a variety of applications like auctions, e-voting, and appointment reconciliation. While several multi-party protocols have been proposed that solve this problem in the semi-...
Implementation and performance evaluation of privacy-preserving fair reconciliation protocols on ordered sets
CODASPY '11: Proceedings of the first ACM conference on Data and application security and privacy

Recently, new protocols were proposed which allow two parties to reconcile their ordered input sets in a fair and privacy-preserving manner. In this paper we present the design and implementation of these protocols on different platforms and extensively ...
Privacy-preserving Protocols for Finding the Convex Hulls
ARES '08: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security

Secure Multi-party Computation (SMC) has been a research forcus in international cryptography community in recent years. SMC deals with the following situation: Two (or many) parties want to jointly perform a computation without disclosing their private ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

EDBT '13: Proceedings of the Joint EDBT/ICDT 2013 Workshops

March 2013

423 pages

ISBN:9781450315999

DOI:10.1145/2457317

General Chair:
Giovanna Guerrini
Università di Genova, Italy

Copyright © 2013 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 March 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

EDBT/ICDT '13

EDBT/ICDT '13: Joint 2013 EDBT/ICDT Conferences

March 18 - 22, 2013

Genoa, Italy

Acceptance Rates

EDBT '13 Paper Acceptance Rate 7 of 10 submissions, 70%;

Overall Acceptance Rate 7 of 10 submissions, 70%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
89
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)1

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Kerschbaum FWainwright RCorchado JBechini AHong J(2015)Oblivious outsourcing of garbled circuit generationProceedings of the 30th Annual ACM Symposium on Applied Computing10.1145/2695664.2695665(2134-2140)Online publication date: 13-Apr-2015
https://dl.acm.org/doi/10.1145/2695664.2695665
Farr S ODomingo-Ferrer JBlanco-Justicia A(2013)Privacy-Preserving Trust Management Mechanisms from Private Matching SchemesRevised Selected Papers of the 8th International Workshop on Data Privacy Management and Autonomous Spontaneous Security - Volume 824710.1007/978-3-642-54568-9_26(390-398)Online publication date: 12-Sep-2013
https://dl.acm.org/doi/10.1007/978-3-642-54568-9_26
Neugebauer GBrutschy LMeyer UWetzel S(2013)Privacy-Preserving Multi-Party Reconciliation Secure in the Malicious ModelRevised Selected Papers of the 8th International Workshop on Data Privacy Management and Autonomous Spontaneous Security - Volume 824710.1007/978-3-642-54568-9_12(178-193)Online publication date: 12-Sep-2013
https://dl.acm.org/doi/10.1007/978-3-642-54568-9_12
Meyer UWetzel S(2013)Privacy-Preserving Reconciliation Protocols: From Theory to Practice‘10.1007/978-3-642-42001-6_14(183-210)Online publication date: 2013
https://doi.org/10.1007/978-3-642-42001-6_14

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents