Wikström, Douglas (2002) An Efficient Mix-Net. [SICS Report]
We describe an efficient mix-net. Its efficiency is based on a novel method, double encryption. We use a variant of "repetitive robustness", introduced by Jakobsson, to achieve robustness. The notion of double encryption enables us to avoid the large number of proofs of knowledge required in most mix-net constructions. For a large number n of senders each mix-center in our mix-net computes approximately 25n exponentiations in real time, which also gives the approximate execution time of the mix-net. Thus, our mix-net is faster than any known mix-net and the first mix-net in which the number of exponentiations computed by a mix-center is essentially independent of the number of mix-centers. Currently there exist no security proofs of our construction, but we describe the underlying ideas of the design.
|Item Type:||SICS Report|
|Uncontrolled Keywords:||mix-net, anonymous channel, electronic voting|
|Deposited By:||Vicki Carleson|
|Deposited On:||29 Oct 2007|
|Last Modified:||18 Nov 2009 16:04|
Repository Staff Only: item control page