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

Georg Neugebauer; Lucas Brutschy; Ulrike Meyer; Susanne Wetzel

doi:10.1007/978-3-642-54568-9_12

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

Georg Neugebauer, Lucas Brutschy, Ulrike Meyer, Susanne Wetzel

Department of Computer Science

RWTH Aachen University

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

3 Scopus citations

Abstract

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.

Original language	English
Title of host publication	Data Privacy Management and Autonomous Spontaneous Security - 8th International Workshop, DPM 2013, and 6th International Workshop, SETOP 2013, Revised Selected Papers
Pages	178-193
Number of pages	16
DOIs	https://doi.org/10.1007/978-3-642-54568-9_12
State	Published - 2014
Event	8th International Workshop on Data Privacy Management, DPM 2013 and 6th International Workshop on Autonomous and Spontaneous Security, SETOP 2013 - Egham, United Kingdom Duration: 12 Sep 2013 → 13 Sep 2013

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8247 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	8th International Workshop on Data Privacy Management, DPM 2013 and 6th International Workshop on Autonomous and Spontaneous Security, SETOP 2013
Country/Territory	United Kingdom
City	Egham
Period	12/09/13 → 13/09/13

Keywords

Cryptographic protocols
Malicious model
Privacy-enhancing technologies
Secure multi-party computation
Zero-knowledge proofs

Access to Document

10.1007/978-3-642-54568-9_12

Cite this

Neugebauer, G., Brutschy, L., Meyer, U., & Wetzel, S. (2014). Privacy-preserving multi-party reconciliation secure in the malicious model. In Data Privacy Management and Autonomous Spontaneous Security - 8th International Workshop, DPM 2013, and 6th International Workshop, SETOP 2013, Revised Selected Papers (pp. 178-193). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8247 LNCS). https://doi.org/10.1007/978-3-642-54568-9_12

Neugebauer, Georg ; Brutschy, Lucas ; Meyer, Ulrike et al. / Privacy-preserving multi-party reconciliation secure in the malicious model. Data Privacy Management and Autonomous Spontaneous Security - 8th International Workshop, DPM 2013, and 6th International Workshop, SETOP 2013, Revised Selected Papers. 2014. pp. 178-193 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{3a45e40fc27240678278995b109850ad,

title = "Privacy-preserving multi-party reconciliation secure in the malicious model",

abstract = "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.",

keywords = "Cryptographic protocols, Malicious model, Privacy-enhancing technologies, Secure multi-party computation, Zero-knowledge proofs",

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

year = "2014",

doi = "10.1007/978-3-642-54568-9_12",

language = "English",

isbn = "9783642545672",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "178--193",

booktitle = "Data Privacy Management and Autonomous Spontaneous Security - 8th International Workshop, DPM 2013, and 6th International Workshop, SETOP 2013, Revised Selected Papers",

note = "8th International Workshop on Data Privacy Management, DPM 2013 and 6th International Workshop on Autonomous and Spontaneous Security, SETOP 2013 ; Conference date: 12-09-2013 Through 13-09-2013",

}

Neugebauer, G, Brutschy, L, Meyer, U & Wetzel, S 2014, Privacy-preserving multi-party reconciliation secure in the malicious model. in Data Privacy Management and Autonomous Spontaneous Security - 8th International Workshop, DPM 2013, and 6th International Workshop, SETOP 2013, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8247 LNCS, pp. 178-193, 8th International Workshop on Data Privacy Management, DPM 2013 and 6th International Workshop on Autonomous and Spontaneous Security, SETOP 2013, Egham, United Kingdom, 12/09/13. https://doi.org/10.1007/978-3-642-54568-9_12

Privacy-preserving multi-party reconciliation secure in the malicious model. / Neugebauer, Georg; Brutschy, Lucas; Meyer, Ulrike et al.
Data Privacy Management and Autonomous Spontaneous Security - 8th International Workshop, DPM 2013, and 6th International Workshop, SETOP 2013, Revised Selected Papers. 2014. p. 178-193 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8247 LNCS).

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

TY - GEN

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

AU - Neugebauer, Georg

AU - Brutschy, Lucas

AU - Meyer, Ulrike

AU - Wetzel, Susanne

PY - 2014

Y1 - 2014

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.

AB - 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 - Cryptographic protocols

KW - Malicious model

KW - Privacy-enhancing technologies

KW - Secure multi-party computation

KW - Zero-knowledge proofs

UR - http://www.scopus.com/inward/record.url?scp=84958546896&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84958546896&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-54568-9_12

DO - 10.1007/978-3-642-54568-9_12

M3 - Conference contribution

AN - SCOPUS:84958546896

SN - 9783642545672

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 178

EP - 193

BT - Data Privacy Management and Autonomous Spontaneous Security - 8th International Workshop, DPM 2013, and 6th International Workshop, SETOP 2013, Revised Selected Papers

T2 - 8th International Workshop on Data Privacy Management, DPM 2013 and 6th International Workshop on Autonomous and Spontaneous Security, SETOP 2013

Y2 - 12 September 2013 through 13 September 2013

ER -

Neugebauer G, Brutschy L, Meyer U, Wetzel S. Privacy-preserving multi-party reconciliation secure in the malicious model. In Data Privacy Management and Autonomous Spontaneous Security - 8th International Workshop, DPM 2013, and 6th International Workshop, SETOP 2013, Revised Selected Papers. 2014. p. 178-193. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-54568-9_12

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

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this