How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Divertible zero knowledge interactive proofs and commutative random self-reducibility
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Wallet Databases with Observers
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Mix-Networks on Permutation Networks
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Mix and Match: Secure Function Evaluation via Ciphertexts
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Millimix: Mixing in Small Batches
Millimix: Mixing in Small Batches
Coercion-resistant electronic elections
Proceedings of the 2005 ACM workshop on Privacy in the electronic society
On Coercion-Resistant Electronic Elections with Linear Work
ARES '07 Proceedings of the The Second International Conference on Availability, Reliability and Security
Denial of service via algorithmic complexity attacks
SSYM'03 Proceedings of the 12th conference on USENIX Security Symposium - Volume 12
A Coercion-Resistant Internet Voting Protocol
ICSNC '07 Proceedings of the Second International Conference on Systems and Networks Communications
Bare-handed electronic voting with pre-processing
EVT'07 Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology
Civitas: Toward a Secure Voting System
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
Panic passwords: authenticating under duress
HOTSEC'08 Proceedings of the 3rd conference on Hot topics in security
Helios: web-based open-audit voting
SS'08 Proceedings of the 17th conference on Security symposium
An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols
SP '09 Proceedings of the 2009 30th IEEE Symposium on Security and Privacy
Masked Ballot Voting for Receipt-Free Online Elections
VOTE-ID '09 Proceedings of the 2nd International Conference on E-Voting and Identity
Designated verifier proofs and their applications
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 threshold cryptosystem without a trusted party
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Secure distributed key generation for discrete-log based cryptosystems
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Public key encryption that allows PIR queries
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Verifiable internet voting solving secure platform problem
IWSEC'07 Proceedings of the Security 2nd international conference on Advances in information and computer security
CodeVoting protection against automatic vote manipulation in an uncontrolled environment
VOTE-ID'07 Proceedings of the 1st international conference on E-voting and identity
A Game-Based Definition of Coercion-Resistance and Its Applications
CSF '10 Proceedings of the 2010 23rd IEEE Computer Security Foundations Symposium
Electing a university president using open-audit voting: analysis of real-world use of Helios
EVT/WOTE'09 Proceedings of the 2009 conference on Electronic voting technology/workshop on trustworthy elections
On e-vote integrity in the case of malicious voter computers
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
Election verifiability in electronic voting protocols
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
Running mixnet-based elections with Helios
EVT/WOTE'11 Proceedings of the 2011 conference on Electronic voting technology/workshop on trustworthy elections
Practical remote end-to-end voting scheme
EGOVIS'11 Proceedings of the Second international conference on Electronic government and the information systems perspective
Evaluating 2-DNF formulas on ciphertexts
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Converting pairing-based cryptosystems from composite-order groups to prime-order groups
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Receipt-free K-out-of-L voting based on elgamal encryption
Towards Trustworthy Elections
Selections: internet voting with over-the-shoulder coercion-resistance
FC'11 Proceedings of the 15th international conference on Financial Cryptography and Data Security
A new approach towards coercion-resistant remote e-voting in linear time
FC'11 Proceedings of the 15th international conference on Financial Cryptography and Data Security
A practical coercion resistant voting scheme revisited
Vote-ID'13 Proceedings of the 4th international conference on E-Voting and Identity
Hi-index | 0.00 |
We propose and study the notion of concurrent ballot authorization for coercion-resistant, end-to-end verifiable (E2E) internet voting. A central part of providing coercion resistance is the ability for an election authority to filter out fake ballots from legitimate ones in a way that is both private and universally verifiable. This ballot authorization process, however, can potentially come at a heavy computational cost. In previous proposals, the bulk of this computation cannot be performed until the last ballot has been cast. By contrast, concurrent ballot authorization allows ballots to be authorized as they are submitted, allowing the tally to be declared immediately after polls close. An efficient tally is especially important in the coercion-resistant internet voting setting, as it is particularly vulnerable to denial of service attacks caused by floods of fake ballots. We present a proof-of-concept voting system, Cobra, the first coercion-resistant system to offer concurrent ballot authorization. Although Cobra offers the fastest tallying relative to the related work, it has a registration process that we consider to be too slow to be viable; one that is quadratic in the number of eligible voters. We present Cobra as a first-step toward what we hope will become a standard feature of coercion-resistant internet voting schemes: concurrent ballot authorization.