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

摘要

This paper presents a universally verifiable Mix-net where theamount of work done by a verifier is inde- pendent of the number ofmix-servers. Furthermore, the compu- tational task of each mix-serveris constant with regard to the number of mix-servers except for somenegligible tasks like com- putting hash function when no disruptionoccurs. The scheme also provides robustness.