Skip to main content
Conference ProceedingsOPEN ACCESS

Universally verifiable mix-net with verification work independent of the number of mix-servers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1998) 1403 437-447
DOI: 10.1007/BFb0054144
129Citations
Citations of this article
65Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Abe, M. (1998). Universally verifiable mix-net with verification work independent of the number of mix-servers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1403, pp. 437–447). Springer Verlag. https://doi.org/10.1007/BFb0054144

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free