Cryptology ePrint Archive: Report 2007/353
Multiparty Computation to Generate Secret Permutations
Chris Studholme and Ian Blake
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.
Category / Keywords: cryptographic protocols / secure multiparty computation, secret permutation, re-encryption, ElGamal encryption
Date: received 6 Sep 2007
Contact author: cvs at cs utoronto ca
Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation
Version: 20070913:193338 (All versions of this report)
Short URL: ia.cr/2007/353
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]