Universally Verifiable Mix-Net with Verification Work Independent of the Number of Mix-Servers
Masahide Abe · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2000
In this paper we construct 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 against the number of mix-servers except for some negligible tasks like addition. The scheme is robust, too.