Universally Verifiable Mix-Net with Verification Work Independent of the Number of Mix-Servers

Masayuki ABE  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E83-A   No.7   pp.1431-1440
Publication Date: 2000/07/25
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Information Security
mix-net,  electronic voting,  universal verifiability,  

Full Text: PDF>>
Buy this Article

This paper presents a universally verifiable Mix-net where the amount of work done by a verifier is independent of the number of mix-servers. Furthermore, the computational task of each mix-server is constant with regard to the number of mix-servers except for some negligible tasks like computing hash function when no disruption occurs. The scheme also provides robustness.