Change search
ReferencesLink to record
Permanent link

Direct link
An Efficient Mix-Net
Number of Authors: 1
2002 (English)Report (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
Swedish Institute of Computer Science , 2002, 1. , 16 p.
SICS Technical Report, ISSN 1100-3154 ; 2002:21
Keyword [en]
mix-net, anonymous channel, electronic voting
National Category
Computer and Information Science
URN: urn:nbn:se:ri:diva-21997OAI: diva2:1041539
Available from: 2016-10-31 Created: 2016-10-31

Open Access in DiVA

fulltext(222 kB)4 downloads
File information
File name FULLTEXT01.pdfFile size 222 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 4 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 2 hits
ReferencesLink to record
Permanent link

Direct link