CryptoDB
Multiparty Computation to Generate Secret Permutations
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2007-13633, title={Multiparty Computation to Generate Secret Permutations}, booktitle={IACR Eprint archive}, keywords={cryptographic protocols / secure multiparty computation, secret permutation, re-encryption, ElGamal encryption}, url={http://eprint.iacr.org/2007/353}, note={ cvs@cs.utoronto.ca 13762 received 6 Sep 2007}, author={Chris Studholme and Ian Blake}, year=2007 }