• search hit 2 of 3
Back to Result List

Privacy-preserving multi-party reconciliation secure in the malicious model

  • 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-honest model, there are no multi-party protocols that are secure in the malicious model so far. In this paper, we close this gap. Our newly proposed protocols are shown to be secure in the malicious model based on a variety of novel non-interactive zero-knowledge-proofs. We describe the implementation of our protocols and evaluate their performance in comparison to protocols solving the problem in the semi-honest case.

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Author:Georg Neugebauer, Lucas Brutschy, Ulrike Meyer, Susanne Wetzel
ISBN:978-3-642-54567-2 (Print)
ISBN:978-3-642-54568-9 (Online)
Parent Title (English):DPM 2013, SETOP 2013: Data Privacy Management and Autonomous Spontaneous Security
Place of publication:Berlin
Editor:Joaquin Garcia-Alfaro, Georgios Lioudakis, Nora Cuppens-Boulahia, Simon Foley, William M. Fitzgerald
Document Type:Conference Proceeding
Year of Completion:2014
Date of the Publication (Server):2023/09/11
Tag:Cryptographic protocols; Malicious model; Privacy-enhancing technologies; Secure multi-party computation; Zero-knowledge proofs
First Page:178
Last Page:193
8th International Workshop, DPM 2013, and 6th International Workshop, SETOP 2013, Egham, UK, September 12-13, 2013.

Part of the Lecture Notes in Computer Science book series (LNSC,volume 8247)
Institutes:FH Aachen / Fachbereich Elektrotechnik und Informationstechnik
collections:Verlag / Springer