Receipt-free secret-ballot elections (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
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
Incoercible multiparty computation
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
A variant of the Chaum voter-verifiable scheme
WITS '05 Proceedings of the 2005 workshop on Issues in the theory of security
Coercion-resistant electronic elections
Proceedings of the 2005 ACM workshop on Privacy in the electronic society
Cryptographic voting protocols: a systems perspective
SSYM'05 Proceedings of the 14th conference on USENIX Security Symposium - Volume 14
A robust and verifiable cryptographically secure election scheme
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Secret-Ballot Receipts: True Voter-Verifiable Elections
IEEE Security and Privacy
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
Receipt-free mix-type voting scheme: a practical solution to the implementation of a voting booth
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Efficient receipt-free voting based on homomorphic encryption
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Everlasting security in the bounded storage model
IEEE Transactions on Information Theory
Split-ballot voting: everlasting privacy with distributed trust
Proceedings of the 14th ACM conference on Computer and communications security
Bare-handed electronic voting with pre-processing
EVT'07 Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology
A Tamper-Evident Voting Machine Resistant to Covert Channels
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
The case for networked remote voting precincts
EVT'08 Proceedings of the conference on Electronic voting technology
Analysis, improvement and simplification of Prêt à voter with Paillier encryption
EVT'08 Proceedings of the conference on Electronic voting technology
Coercion-resistant tallying for STV voting
EVT'08 Proceedings of the conference on Electronic voting technology
Masked Ballot Voting for Receipt-Free Online Elections
VOTE-ID '09 Proceedings of the 2nd International Conference on E-Voting and Identity
Split-ballot voting: Everlasting privacy with distributed trust
ACM Transactions on Information and System Security (TISSEC)
Voting with unconditional privacy by merging Prêt à voter and PunchScan
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
Shuffle-sum: coercion-resistant verifiable tallying for STV voting
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
Enhancing electronic voting machines on the example of Bingo voting
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
Verifiable internet voting solving secure platform problem
IWSEC'07 Proceedings of the Security 2nd international conference on Advances in information and computer security
Browser based agile e-voting system
ASIAN'07 Proceedings of the 12th Asian computing science conference on Advances in computer science: computer and network security
Bingo voting: secure and coercion-free voting using a trusted random number generator
VOTE-ID'07 Proceedings of the 1st international conference on E-voting and identity
Simulation-based analysis of E2E voting systems
VOTE-ID'07 Proceedings of the 1st international conference on E-voting and identity
Towards a Framework on the Security Requirements for Electronic Voting Protocols
RE-VOTE '09 Proceedings of the 2009 First International Workshop on Requirements Engineering for e-Voting Systems
EVT/WOTE'09 Proceedings of the 2009 conference on Electronic voting technology/workshop on trustworthy elections
Efficient receipt-free ballot casting resistant to covert channels
EVT/WOTE'09 Proceedings of the 2009 conference on Electronic voting technology/workshop on trustworthy elections
Ballot permutations in prêt à voter
EVT/WOTE'09 Proceedings of the 2009 conference on Electronic voting technology/workshop on trustworthy elections
Universally composable incoercibility
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Pretty good democracy for more expressive voting schemes
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
A hybrid method to detect deflation fraud in cost-per-action online advertising
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Proving coercion-resistance of scantegrity II
ICICS'10 Proceedings of the 12th international conference on Information and communications security
Adapting helios for provable ballot privacy
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
A simulation-based treatment of authenticated message exchange
ASIAN'09 Proceedings of the 13th Asian conference on Advances in Computer Science: information Security and Privacy
Coercion-resistant electronic elections
Towards Trustworthy Elections
Unconditionally secure electronic voting
Towards Trustworthy Elections
Towards Trustworthy Elections
Scratch, click & vote: e2e voting over the internet
Towards Trustworthy Elections
Vote-independence: a powerful privacy notion for voting protocols
FPS'11 Proceedings of the 4th Canada-France MITACS conference on Foundations and Practice of Security
NordSec'11 Proceedings of the 16th Nordic conference on Information Security Technology for Applications
Coercion-resistant electronic elections with write-in candidates
EVT/WOTE'12 Proceedings of the 2012 international conference on Electronic Voting Technology/Workshop on Trustworthy Elections
Improving Helios with everlasting privacy towards the public
EVT/WOTE'12 Proceedings of the 2012 international conference on Electronic Voting Technology/Workshop on Trustworthy Elections
Measuring vote privacy, revisited
Proceedings of the 2012 ACM conference on Computer and communications security
An efficient and highly sound voter verification technique and its implementation
VoteID'11 Proceedings of the Third international conference on E-Voting and Identity
VoteID'11 Proceedings of the Third international conference on E-Voting and Identity
Practical Internet voting system
Journal of Network and Computer Applications
An improved electronic voting scheme without a trusted random number generator
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
POST'13 Proceedings of the Second international conference on Principles of Security and Trust
Distributed ElGamal à la Pedersen: Application to Helios
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
Prêt à voter providing everlasting privacy
Vote-ID'13 Proceedings of the 4th international conference on E-Voting and Identity
A game-based definition of coercion resistance and its applications
Journal of Computer Security - CSF 2010
Hi-index | 0.00 |
We present the first universally verifiable voting scheme that can be based on a general assumption (existence of a non-interactive commitment scheme). Our scheme is also the first receipt-free scheme to give “everlasting privacy” for votes: even a computationally unbounded party does not gain any information about individual votes (other than what can be inferred from the final tally). Our voting protocols are designed to be used in a “traditional” setting, in which voters cast their ballots in a private polling booth (which we model as an untappable channel between the voter and the tallying authority). Following in the footsteps of Chaum and Neff [7,16], our protocol ensures that the integrity of an election cannot be compromised even if the computers running it are all corrupt (although ballot secrecy may be violated in this case). We give a generic voting protocol which we prove to be secure in the Universal Composability model, given that the underlying commitment is universally composable. We also propose a concrete implementation, based on the hardness of discrete log, that is slightly more efficient (and can be used in practice).