Keywords

Computer scienceScheme (mathematics)BallotVotingRobustness (evolution)EncryptionComputer securityComputational complexity theoryCommunication complexityTheoretical computer scienceAlgorithmMathematicsLawPolitical science

Affiliated Institutions

Related Publications

Verifiable secret-ballot elections

Privacy in secret-ballot elections has traditionally been attained by using a ballot box or voting booth to disassociate voters from ballots. Although such a system might achiev...

1987 385 citations

Publication Info

Year
1997
Type
book-chapter
Pages
103-118
Citations
345
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

345
OpenAlex

Cite This

Ronald Cramer, Rosario Gennaro, Berry Schoenmakers (1997). A Secure and Optimally Efficient Multi-Authority Election Scheme. Lecture notes in computer science , 103-118. https://doi.org/10.1007/3-540-69053-0_9

Identifiers

DOI
10.1007/3-540-69053-0_9