[Resource Topic] 2013/655: Privacy-Preserving Multi-Party Reconciliation Secure in the Malicious Model (Extended version)

Welcome to the resource topic for 2013/655

Title:
Privacy-Preserving Multi-Party Reconciliation Secure in the Malicious Model (Extended version)

Authors: Georg Neugebauer, Lucas Brutschy, Ulrike Meyer, Susanne Wetzel

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.

ePrint: https://eprint.iacr.org/2013/655

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .