Multiparty Computation to Generate Secret Permutations

Chris Studholme; Ian Blake

Paper 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.

Metadata

Available format(s): PDF PS
Category: Cryptographic protocols
Publication info: Published elsewhere. Unknown where it was published
Keywords: secure multiparty computation secret permutation re-encryption ElGamal encryption
Contact author(s): cvs @ cs utoronto ca
History: 2007-09-13: received
Short URL: https://ia.cr/2007/353
License: CC BY

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}
}