Knowledge-based modelling of voting protocols

Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge, TARK 2007

Volumn , Issue , 2007, Pages 62-71

  Baskar, A ^a   Ramanujam, R ^b   Suresh, S P ^a  

^a CHENNAI MATHEMATICAL INSTITUTE   (India)

^b INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRONIC VOTING PROTOCOLS; REASONING ABOUT KNOWLEDGE; VOTING PROTOCOLS;

KNOWLEDGE BASED SYSTEMS;

COMPUTABILITY AND DECIDABILITY;

EID: 58449096556     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1324249.1324261     Document Type: Conference Paper

References (21)

1. S. Artemov and E. Nogina. On epistemic logic with justification. In Proceedings of TARK X, pages 279-294, Singapore, July 2005.
2. Martin Abadi and Phillip Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption). In Proceedings of the IFIP International Conference on TCS (IFIP TCS2000), volume 1872 of Lecture Notes in Computer Science, pages 3-22, 2000.
3. Josh Cohen Benaloh and Dwight Tuinstra. Receiptfree secret-ballot elections(extended abstract). In Proceedings of 26th Symposium on Theory of Computing, pages 544-553, 1994.
4. Iliano Cervesato, Nancy A. Durgin, Patrick D. Lincoln, John C. Mitchell, and Andre Scedrov. A Metanotation for Protocol Analysis. In P. Syverson, editor, Proceedings of the 12th IEEE Computer Security Foundations Workshop, pages 35-51. IEEE Computer Society Press, 1999.
5. D. Chaum. Blind signatures for untraceable payments. In Advances in Cryptology - Crypto '82, pages 199-203. Springer-Verlag, 1983.
6. D. Chaum. Security without identification: transaction systems to make big brother obsolete. Communications of the ACM, 28(10):1030-1044, 1985. (Pubitemid 15587967)
7. Benoit Chevallier-Mames, Pierre-Alain Fouque, David Pointcheval, Julien Stern, and Jacques Traore. On Some Incompatible properties of Voting Schemes. In Proceedings of the IAVoSS Workshop on Trustworthy Elections, 2006.
8. Iliano Cervesato, Catherine A. Meadows, and Paul F. Syverson. Dolev-Yao is no better than Machiavelli. In P. Degano, editor, Proceedings of WITS'00, pages 87-92, July 2000.
9. Stephanie Delaune, Steve Kremer, and Mark Ryan. Coercion-Resistance and Receipt-Freeness in Electronic Voting. In 19th Computer Security Foundations Workshop, pages 28-42. IEEE Computer Society, 2006.
10. Danny Dolev and Andrew Yao. On the Security of public-key protocols. IEEE Transactions on Information Theory, 29:198-208, 1983.
11. Ronald Fagin, Joseph Y. Halpern, Yoram Moses, and Moshe Y. Vardi. Reasoning about Knowledge. M.I.T. Press, 1995.
12. Atsushi Fujioka, Tatsuaki Okamoto, and Kaazuo Ohta. A practical secret voting scheme for large scale elections. In ASIACRYPT, pages 244-251, 1992.
13. Joseph Y. Halpern and Kevin R. O'Neil. Anonymity and Information Hiding in Multiagent Systems. Journal of Computer Security, 13(3):483-512, 2005.
14. Joseph Y. Halpern and Riccardo Pucella. Modeling adversaries in a logic for security protocol analysis. In Formal Aspects of Security, First International Conference, FASec 2002, volume 2629 of Lecture Notes in Computer Science, pages 115-132, 2003.
15. Hugo Jonker and E.P. de Vink. Formalising Receipt-Freeness. In Information Security Conference, volume 4176 of Lecture Notes in Computer Science, pages 476-488. Springer, 2006.
16. Hugo Jonker and Wolter Pieters. Receipt-freeness as a special case of anonymity in epistemic logic. In Proceedings of the IAVoSS Workshop on Trustworthy Elections, 2006.
17. Steve Kremer and Mark Ryan. Analysis of an Electronic Voting Protocol in the Applied Pi Calculus. In Proceedings of the European Symposium on Programming, volume 3444 of Lecture Notes in Computer Science, pages 186-200. Springer, 2005.
18. Rohit Parikh and R. Ramanujam. Distributed Processes and the Logic of Knowledge. In Logic of Programs, pages 256-268, 1985.
19. Zuzana Rjaskova. Electronic voting schemes. Master's thesis, Comenius University, 2002.
20. R. Ramanujam and S. P. Suresh. Decidability of context-explicit security protocols. Journal of Computer Security, 13(1):135-165, 2005. (Pubitemid 40099762)
21. R. Ramanujam and S. P. Suresh. A (restricted) quantifier elimination for security protocols. Theoretical Computer Science, 367:228-256, 2006. (Pubitemid 44755017)