TY  - CHAP
A1  - Neugebauer, Georg
A1  - Brutschy, Lucas
A1  - Meyer, Ulrike
A1  - Wetzel, Susanne
ED  - Garcia-Alfaro, Joaquin
ED  - Lioudakis, Georgios
ED  - Cuppens-Boulahia, Nora
ED  - Foley, Simon
ED  - Fitzgerald, William M.
T1  - Privacy-preserving multi-party reconciliation secure in the malicious model
T2  - DPM 2013, SETOP 2013: Data Privacy Management and Autonomous Spontaneous Security
N2  - 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.
KW  - Privacy-enhancing technologies
KW  - Secure multi-party computation
KW  - Cryptographic protocols
KW  - Zero-knowledge proofs
KW  - Malicious model
Y1  - 2014
SN  - 978-3-642-54567-2 (Print)
SN  - 978-3-642-54568-9 (Online)
U6  - http://dx.doi.org/10.1007/978-3-642-54568-9_12
N1  - 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)
SP  - 178
EP  - 193
PB  - Springer
CY  - Berlin
ER  -