Elections with unconditionally-secret ballots and disruption equivalent to breaking RSA
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Receipt-free secret-ballot elections (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
A calculus for cryptographic protocols
Information and Computation
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Constraint solving for bounded-process cryptographic protocol analysis
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
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
Receipt-Free Electronic Voting Schemes for Large Scale Elections
Proceedings of the 5th International Workshop on Security Protocols
Probabilistic Analysis of Anonymity
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Incoercible multiparty computation
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Anonymous Connections and Onion Routing
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Verifiable secret-ballot elections
Verifiable secret-ballot elections
Deciding security of protocols against off-line guessing attacks
Proceedings of the 12th ACM conference on Computer and communications security
Coercion-resistant electronic elections
Proceedings of the 2005 ACM workshop on Privacy in the electronic society
Anonymity and information hiding in multiagent systems
Journal of Computer Security
Coercion-Resistance and Receipt-Freeness in Electronic Voting
CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
Just fast keying in the pi calculus
ACM Transactions on Information and System Security (TISSEC)
Knowledge-based modelling of voting protocols
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Automated Verification of Remote Electronic Voting Protocols in the Applied Pi-Calculus
CSF '08 Proceedings of the 2008 21st IEEE Computer Security Foundations Symposium
Secret-Ballot Receipts: True Voter-Verifiable Elections
IEEE Security and Privacy
Efficient receipt-free voting based on homomorphic encryption
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Towards an information theoretic metric for anonymity
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
Hiding names: private authentication in the applied pi calculus
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
Anonymity protocols as noisy channels
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Symbolic bisimulation for the applied Pi calculus
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
ISC'06 Proceedings of the 9th international conference on Information Security
A dolev-yao-based definition of abuse-free protocols
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Analysis of an electronic voting protocol in the applied pi calculus
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
A practical voter-verifiable election scheme
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
FAST'05 Proceedings of the Third international conference on Formal Aspects in Security and Trust
A formal framework for quantifying voter-controlled privacy
Journal of Algorithms
Epistemic Logic for the Applied Pi Calculus
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
YAPA: A Generic Tool for Computing Intruder Knowledge
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Computing Knowledge in Security Protocols under Convergent Equational Theories
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
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
Universally composable incoercibility
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
A DEXPTIME-complete Dolev-Yao theory with distributive encryption
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Formal analysis of privacy for vehicular mix-zones
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
Towards automatic analysis of election verifiability properties
ARSPA-WITS'10 Proceedings of the 2010 joint conference on Automated reasoning for security protocol analysis and issues in the theory of security
Analysis of a receipt-free auction protocol in the applied pi calculus
FAST'10 Proceedings of the 7th International conference on Formal aspects of security and trust
Procedural security analysis: A methodological approach
Journal of Systems and Software
Formal analysis of an electronic voting system: An experience report
Journal of Systems and Software
Anonymity, Privacy, Onymity, and Identity: A Modal Logic Approach
Transactions on Data Privacy
Trace equivalence decision: negative tests and non-determinism
Proceedings of the 18th ACM conference on Computer and communications security
Computing Knowledge in Security Protocols Under Convergent Equational Theories
Journal of Automated Reasoning
SeVe: automatic tool for verification of security protocols
Frontiers of Computer Science in China
ASIAN'09 Proceedings of the 13th Asian conference on Advances in Computer Science: information Security and Privacy
A dolev-yao model for zero knowledge
ASIAN'09 Proceedings of the 13th Asian conference on Advances in Computer Science: information Security and Privacy
Automating security analysis: symbolic equivalence of constraint systems
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
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
Formal verification of authentication-type properties of an electronic voting protocol using mCRL2
VECoS'10 Proceedings of the Fourth international conference on Verification and Evaluation of Computer and Communication Systems
Automated verification of equivalence properties of cryptographic protocols
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Security protocol verification: symbolic and computational models
POST'12 Proceedings of the First international conference on Principles of Security and Trust
Privacy supporting cloud computing: confichair, a case study
POST'12 Proceedings of the First international conference on Principles of Security and Trust
A formal analysis of the norwegian e-voting protocol
POST'12 Proceedings of the First international conference on Principles of Security and Trust
POST'12 Proceedings of the First international conference on Principles of Security and Trust
Automatic verification of epistemic specifications under convergent equational theories
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Security protocols, constraint systems, and group theories
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Challenges in ehealth: from enabling to enforcing privacy
FHIES'11 Proceedings of the First international conference on Foundations of Health Informatics Engineering and Systems
Measuring vote privacy, revisited
Proceedings of the 2012 ACM conference on Computer and communications security
Linear logical voting protocols
VoteID'11 Proceedings of the Third international conference on E-Voting and Identity
YAPA: A Generic Tool for Computing Intruder Knowledge
ACM Transactions on Computational Logic (TOCL)
Towards verifying voter privacy through unlinkability
ESSoS'13 Proceedings of the 5th international conference on Engineering Secure Software and Systems
Formal analysis of privacy for routing protocols in mobile ad hoc networks
POST'13 Proceedings of the Second international conference on Principles of Security and Trust
POST'13 Proceedings of the Second international conference on Principles of Security and Trust
Formal verification of e-auction protocols
POST'13 Proceedings of the Second international conference on Principles of Security and Trust
Using mobile device communication to strengthen e-Voting protocols
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
Vote-ID'13 Proceedings of the 4th international conference on E-Voting and Identity
Analysis of an electronic boardroom voting system
Vote-ID'13 Proceedings of the 4th international conference on E-Voting and Identity
Privacy-supporting cloud computing by in-browser key translation
Journal of Computer Security - Security and Trust Principles
Journal of Computer Security - Foundational Aspects of Security
Attacking and fixing Helios: An analysis of ballot secrecy
Journal of Computer Security
| Hi-index | 0.00 |
Electronic voting promises the possibility of a convenient, efficient and secure facility for recording and tallying votes in an election. Recently highlighted inadequacies of implemented systems have demonstrated the importance of formally verifying the underlying voting protocols. We study three privacy-type properties of electronic voting protocols: in increasing order of strength, they are vote-privacy, receipt-freeness and coercion-resistance. We use the applied pi calculus, a formalism well adapted to modelling such protocols, which has the advantages of being based on well-understood concepts. The privacy-type properties are expressed using observational equivalence and we show in accordance with intuition that coercion-resistance implies receipt-freeness, which implies vote-privacy. We illustrate our definitions on three electronic voting protocols from the literature. Ideally, these three properties should hold even if the election officials are corrupt. However, protocols that were designed to satisfy receipt-freeness or coercion-resistance may not do so in the presence of corrupt officials. Our model and definitions allow us to specify and easily change which authorities are supposed to be trustworthy.