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

  • 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.

Export metadata

Additional Services

Share in X Search Google Scholar
Metadaten
Author:Georg Neugebauer, Ulrike Meyer, Susanne Wetzel
DOI:https://doi.org/10.1007/978-3-642-18178-8_12
ISBN:978-3-642-18177-1
ISSN:0302-9743
Parent Title (English):Information Security 13th International Conference, ISC 2010, Revised Selected Papers
Publisher:Springer
Place of publication:Berlin , Heidelberg
Editor:Mike Burmester, Gene Tsudik, Spyros Magliveras, Ivana Ilić
Document Type:Conference Proceeding
Language:English
Year of Completion:2011
Tag:cryptographic protocols; multi-party protocols; privacy; private set intersection; secure group computation
First Page:136
Last Page:151
Note:
Information Security. 13th International Conference, ISC 2010, Boca Raton, FL, USA, October 25-28, 2010

Part of the Lecture Notes in Computer Science book series (LNSC, volume 6531)
Link:https://doi.org/10.1007/978-3-642-18178-8_12
Zugriffsart:bezahl
Institutes:FH Aachen / Fachbereich Elektrotechnik und Informationstechnik
collections:Verlag / Springer
Licence (German): Urheberrechtlich geschützt