Skip to main content
Conference ProceedingsOPEN ACCESS

Elections with unconditionally-secret ballots and disruption equivalent to breaking RSA

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1988) 330 LNCS 177-182
DOI: 10.1007/3-540-45961-8_15
152Citations
Citations of this article
73Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Election protocols embodying robustness, verifiability of returns by voters, and unconditional security for voters’ privacy have been presented. The techniques also allow untraceable payments and credentials.

Cite

CITATION STYLE

APA

Chaum, D. (1988). Elections with unconditionally-secret ballots and disruption equivalent to breaking RSA. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 330 LNCS, pp. 177–182). Springer Verlag. https://doi.org/10.1007/3-540-45961-8_15

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