Knowledge-based modelling of voting protocols

We contend that reasoning about knowledge is both natural and pragmatic for verification of electronic voting protocols. We present a model in which desirable properties of elections are naturally expressed using standard knowledge operators, and show that the associated logic is decidable (under reasonable assumptions of bounded agents and nonces).

[1]  John C. Mitchell,et al.  A meta-notation for protocol analysis , 1999, Proceedings of the 12th IEEE Computer Security Foundations Workshop.

[2]  David Chaum,et al.  Security without identification: transaction systems to make big brother obsolete , 1985, CACM.

[3]  Joseph Y. Halpern,et al.  Modeling Adversaries in a Logic for Security Protocol Analysis , 2006, FASec.

[4]  Joseph Y. Halpern,et al.  Anonymity and information hiding in multiagent systems , 2003, 16th IEEE Computer Security Foundations Workshop, 2003. Proceedings..

[5]  Atsushi Fujioka,et al.  A Practical Secret Voting Scheme for Large Scale Elections , 1992, AUSCRYPT.

[6]  Mark Ryan,et al.  Coercion-resistance and receipt-freeness in electronic voting , 2006, 19th IEEE Computer Security Foundations Workshop (CSFW'06).

[7]  John C. Mitchell,et al.  Relating strands and multiset rewriting for security protocol analysis , 2000, Proceedings 13th IEEE Computer Security Foundations Workshop. CSFW-13.

[8]  Ramaswamy Ramanujam,et al.  Decidability of context-explicit security protocols , 2005, J. Comput. Secur..

[9]  Paul Syverson,et al.  Dolev-Yao is no better than Machiavelli , 2000 .

[10]  Ramaswamy Ramanujam,et al.  A (restricted) quantifier elimination for security protocols , 2006, Theor. Comput. Sci..

[11]  Josh Benaloh,et al.  Receipt-free secret-ballot elections (extended abstract) , 1994, STOC '94.

[12]  Kazue Sako.  Electronic Voting Schemes , 2005, Encyclopedia of Cryptography and Security.

[13]  Sergei N. Artëmov,et al.  TR-2005004: Basic Systems of Epistemic Logic with Justification , 2005 .

[14]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[15]  Mark Ryan,et al.  Analysis of an Electronic Voting Protocol in the Applied Pi Calculus , 2005, ESOP.

[16]  Sergei N. Artëmov,et al.  On epistemic logic with justification , 2005, TARK.

[17]  Wolter Pieters,et al.  Receipt-freeness as a special case of anonymity in epistemic logic , 2006 .

[18]  David Chaum,et al.  Blind Signatures for Untraceable Payments , 1982, CRYPTO.

[19]  Erik P. de Vink,et al.  Formalising Receipt-Freeness , 2006, ISC.

[20]  Martín Abadi,et al.  Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)* , 2001, Journal of Cryptology.

[21]  Ramaswamy Ramanujam,et al.  Distributed Processes and the Logic of Knowledge , 1985, Logic of Programs.

[22]  Danny Dolev,et al.  On the security of public key protocols , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).