Paper 2011/200 Original: eprint.iacr.org/2011/200 ↗
Fair and Privacy-Preserving Multi-Party Protocols for Reconciling Ordered Input Sets (Extended version)
Abstract
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.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2011-04-25: last updated
- 2011-04-25: published
- Short URL
- https://ia.cr/2011/200
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2011/200,
author = {Georg Neugebauer and Ulrike Meyer and Susanne Wetzel},
title = {Fair and Privacy-Preserving Multi-Party Protocols for Reconciling Ordered Input Sets (Extended version)},
howpublished = {Cryptology {ePrint} Archive, Paper 2011/200},
year = {2011},
url = {https://eprint.iacr.org/2011/200}
}