Universally Verifiable mix-net With Verification Work Independent of The Number of mix Servers. Abe, M. 1998.
Universally Verifiable mix-net With Verification Work Independent of The Number of mix Servers [link]Paper  doi  abstract   bibtex   
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.
@conference {abe,
	title = {Universally Verifiable mix-net With Verification Work Independent of The Number of mix Servers},
	booktitle = {Proceedings of EUROCRYPT 1998},
	year = {1998},
	publisher = {Springer-Verlag, LNCS 1403},
	organization = {Springer-Verlag, LNCS 1403},
	abstract = {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.},
	keywords = {electronic voting, mix, universal verifiability},
	isbn = {978-3-540-64518-4},
	doi = {10.1007/BFb0054144},
	url = {http://www.springerlink.com/content/hl8838u4l9354544/},
	author = {Masayuki Abe}
}

Downloads: 0