Fair and privacy-preserving multi-party protocols for reconciling ordered input sets

Georg Neugebauer; Ulrike Meyer; Susanne Wetzel

doi:10.1007/978-3-642-18178-8_12

Fair and privacy-preserving multi-party protocols for reconciling ordered input sets

Georg Neugebauer
, Ulrike Meyer
, Susanne Wetzel

Department of Computer Science

RWTH Aachen University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

Abstract

In this paper, we introduce the first protocols for multi-party, privacy-preserving, fair reconciliation of ordered sets. Our contributions are twofold. First, we show that it is possible to extend the round-based construction for fair, two-party privacy-preserving reconciliation of ordered sets to multiple parties using a multi-party privacy-preserving set intersection protocol. Second, we propose new constructions for fair, multi-party, privacy-preserving reconciliation of ordered sets based on multiset operations. We prove that all our protocols are privacy-preserving in the semi-honest model. We furthermore provide a detailed performance analysis of our new protocols and show that the constructions based on multisets generally outperform the round-based approach.

Original language	English
Title of host publication	Information Security - 13th International Conference, ISC 2010, Revised Selected Papers
Editors	Mike Burmester, Gene Tsudik, Spyros Magliveras, Ivana Ilic
Pages	136-151
Number of pages	16
DOIs	https://doi.org/10.1007/978-3-642-18178-8_12
State	Published - 2011
Event	13th International Conference on Information Security, ISC 2010 - Boca Raton, United States Duration: 25 Oct 2010 → 28 Oct 2010

Publication series

Name	Lecture Notes in Computer Science
Volume	6531 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	13th International Conference on Information Security, ISC 2010
Country/Territory	United States
City	Boca Raton
Period	25/10/10 → 28/10/10

Keywords

Cryptographic protocols
Multi-party protocols
Privacy
Private set intersection
Secure group computation

Access to Document

10.1007/978-3-642-18178-8_12

Cite this

Neugebauer, G., Meyer, U., & Wetzel, S. (2011). Fair and privacy-preserving multi-party protocols for reconciling ordered input sets. In M. Burmester, G. Tsudik, S. Magliveras, & I. Ilic (Eds.), Information Security - 13th International Conference, ISC 2010, Revised Selected Papers (pp. 136-151). (Lecture Notes in Computer Science; Vol. 6531 LNCS). https://doi.org/10.1007/978-3-642-18178-8_12

@inproceedings{d767e087a0b949869828f8f335ed548b,

title = "Fair and privacy-preserving multi-party protocols for reconciling ordered input sets",

abstract = "In this paper, we introduce the first protocols for multi-party, privacy-preserving, fair reconciliation of ordered sets. Our contributions are twofold. First, we show that it is possible to extend the round-based construction for fair, two-party privacy-preserving reconciliation of ordered sets to multiple parties using a multi-party privacy-preserving set intersection protocol. Second, we propose new constructions for fair, multi-party, privacy-preserving reconciliation of ordered sets based on multiset operations. We prove that all our protocols are privacy-preserving in the semi-honest model. We furthermore provide a detailed performance analysis of our new protocols and show that the constructions based on multisets generally outperform the round-based approach.",

keywords = "Cryptographic protocols, Multi-party protocols, Privacy, Private set intersection, Secure group computation",

author = "Georg Neugebauer and Ulrike Meyer and Susanne Wetzel",

note = "Publisher Copyright: {\textcopyright} 2011, Springer-Verlag Berlin Heidelberg.; 13th International Conference on Information Security, ISC 2010 ; Conference date: 25-10-2010 Through 28-10-2010",

year = "2011",

doi = "10.1007/978-3-642-18178-8\_12",

language = "English",

isbn = "9783642181771",

series = "Lecture Notes in Computer Science",

pages = "136--151",

editor = "Mike Burmester and Gene Tsudik and Spyros Magliveras and Ivana Ilic",

booktitle = "Information Security - 13th International Conference, ISC 2010, Revised Selected Papers",

}

Neugebauer, G, Meyer, U & Wetzel, S 2011, Fair and privacy-preserving multi-party protocols for reconciling ordered input sets. in M Burmester, G Tsudik, S Magliveras & I Ilic (eds), Information Security - 13th International Conference, ISC 2010, Revised Selected Papers. Lecture Notes in Computer Science, vol. 6531 LNCS, pp. 136-151, 13th International Conference on Information Security, ISC 2010, Boca Raton, United States, 25/10/10. https://doi.org/10.1007/978-3-642-18178-8_12

Fair and privacy-preserving multi-party protocols for reconciling ordered input sets. / Neugebauer, Georg; Meyer, Ulrike; Wetzel, Susanne.
Information Security - 13th International Conference, ISC 2010, Revised Selected Papers. ed. / Mike Burmester; Gene Tsudik; Spyros Magliveras; Ivana Ilic. 2011. p. 136-151 (Lecture Notes in Computer Science; Vol. 6531 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Fair and privacy-preserving multi-party protocols for reconciling ordered input sets

AU - Neugebauer, Georg

AU - Meyer, Ulrike

AU - Wetzel, Susanne

PY - 2011

Y1 - 2011

N2 - In this paper, we introduce the first protocols for multi-party, privacy-preserving, fair reconciliation of ordered sets. Our contributions are twofold. First, we show that it is possible to extend the round-based construction for fair, two-party privacy-preserving reconciliation of ordered sets to multiple parties using a multi-party privacy-preserving set intersection protocol. Second, we propose new constructions for fair, multi-party, privacy-preserving reconciliation of ordered sets based on multiset operations. We prove that all our protocols are privacy-preserving in the semi-honest model. We furthermore provide a detailed performance analysis of our new protocols and show that the constructions based on multisets generally outperform the round-based approach.

AB - In this paper, we introduce the first protocols for multi-party, privacy-preserving, fair reconciliation of ordered sets. Our contributions are twofold. First, we show that it is possible to extend the round-based construction for fair, two-party privacy-preserving reconciliation of ordered sets to multiple parties using a multi-party privacy-preserving set intersection protocol. Second, we propose new constructions for fair, multi-party, privacy-preserving reconciliation of ordered sets based on multiset operations. We prove that all our protocols are privacy-preserving in the semi-honest model. We furthermore provide a detailed performance analysis of our new protocols and show that the constructions based on multisets generally outperform the round-based approach.

KW - Cryptographic protocols

KW - Multi-party protocols

KW - Privacy

KW - Private set intersection

KW - Secure group computation

UR - https://www.scopus.com/pages/publications/85037131850

UR - https://www.scopus.com/pages/publications/85037131850#tab=citedBy

U2 - 10.1007/978-3-642-18178-8_12

DO - 10.1007/978-3-642-18178-8_12

M3 - Conference contribution

AN - SCOPUS:85037131850

SN - 9783642181771

T3 - Lecture Notes in Computer Science

SP - 136

EP - 151

BT - Information Security - 13th International Conference, ISC 2010, Revised Selected Papers

A2 - Burmester, Mike

A2 - Tsudik, Gene

A2 - Magliveras, Spyros

A2 - Ilic, Ivana

T2 - 13th International Conference on Information Security, ISC 2010

Y2 - 25 October 2010 through 28 October 2010

ER -

Fair and privacy-preserving multi-party protocols for reconciling ordered input sets

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this