Paper 2007/353 Original: eprint.iacr.org/2007/353 ↗
Multiparty Computation to Generate Secret Permutations
Abstract
We make use of a universal re-encryption mixnet to efficiently perform a secure multiparty computation to generate a secret permutation. When complete, the permutation is shared among the players in such a way that each player knows his share of the permutation but no others. Such a permutation is useful in dining cryptographers networks (DC-nets) to determine in which slot each player should transmit. We also see this primitive as being useful in online gaming for either shuffling cards or ordering players without the need for a trusted dealer or other third party.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2007-09-13: last updated
- 2007-09-13: published
- Short URL
- https://ia.cr/2007/353
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2007/353,
author = {Chris Studholme and Ian Blake},
title = {Multiparty Computation to Generate Secret Permutations},
howpublished = {Cryptology {ePrint} Archive, Paper 2007/353},
year = {2007},
url = {https://eprint.iacr.org/2007/353}
}