International Association for Cryptologic Research

International Association
for Cryptologic Research


Paper: Multiparty Computation to Generate Secret Permutations

Chris Studholme
Ian Blake
Search ePrint
Search Google
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.
  title={Multiparty Computation to Generate Secret Permutations},
  booktitle={IACR Eprint archive},
  keywords={cryptographic protocols / secure multiparty computation, secret permutation, re-encryption, ElGamal encryption},
  note={ 13762 received 6 Sep 2007},
  author={Chris Studholme and Ian Blake},