E-voting without 'cryptography'

Authors:
Dahlia Malkhi;Ofer Margo;Elan Pavlov
Affiliations:
School of Computer Science and Engineering, The Hebrew University of Jerusalem, Israel;School of Computer Science and Engineering, The Hebrew University of Jerusalem, Israel;School of Computer Science and Engineering, The Hebrew University of Jerusalem, Israel
Venue:
FC'02 Proceedings of the 6th international conference on Financial cryptography
Year:
2002

Citing 11
Cited 6

Security without identification: transaction systems to make big brother obsolete

Communications of the ACM
Distributing the power of a government to enhance the privacy of voters

PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Verifiable secret sharing and multiparty protocols with honest majority

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Untraceable electronic mail, return addresses, and digital pseudonyms

Communications of the ACM
Verifying and Recasting Secret Ballots in Computer Networks

New Results and New Trends in Computer Science
A Practical Secret Voting Scheme for Large Scale Elections

ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Anonymity without 'Cryptography'

FC '01 Proceedings of the 5th International Conference on Financial Cryptography
Cryptographic protocols

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Sensus: A Security-Conscious Electronic Polling System for the Internet

HICSS '97 Proceedings of the 30th Hawaii International Conference on System Sciences: Information System Track-Organizational Systems and Technology - Volume 3
Multi-authority secret-ballot elections with linear work

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
A secure and optimally efficient multi-authority election scheme

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques

A Light-Weight e-Voting System with Distributed Trust

Electronic Notes in Theoretical Computer Science (ENTCS)
E-Voting in an Ubicomp World

Social Science Computer Review
New voter verification scheme using pre-encrypted ballots

Computer Communications
Decentralized Polling with Respectable Participants

OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Decentralized polling with respectable participants

Journal of Parallel and Distributed Computing
Internet voting system with cast as intended verification

VoteID'11 Proceedings of the Third international conference on E-Voting and Identity

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new, distributed e-voting protocol, which does not require any 'conventional' cryptography, or other means of non-trivial math, and is information-theoretically secure. In our system, the voter receives a receipt confirming her vote, and does not need to trust any pollster to correctly encrypt her vote, or convey it to the talliers. The system can withstand corruption of almost half the number of authorities running the elections. To achieve these goals, we present enhanced check vectors, a new weak signature scheme as well as a new protocol for joint creation of weak signatures by multiple servers.