You are looking at a specific version 20070913:193338 of this paper. See the latest version.

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 computationsecret permutationre-encryptionElGamal encryption
Contact author(s)
cvs @ cs utoronto ca
History
2007-09-13: received
Short URL
https://ia.cr/2007/353
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.