Analysis of an Electronic Voting Protocol in the Applied Pi Calculus
作者： Steve Kremer , Mark Ryan
DOI: 10.1007/978-3-540-31987-0_14
关键词: Electronic voting 、 Voting 、 Private life 、 Computer science 、 Equivalence (measure theory) 、 Theoretical computer science 、 Observational equivalence 、 Blind signature 、 Artificial intelligence 、 Formalism (philosophy of mathematics) 、 Pi calculus
摘要: … us to verify properties by using automatic tools, and to rely on … that all channels are anonymous in the applied pi calculus. … version of ProVerif does not succeed in proving observational …
springer.com
core.ac.uk
ens-cachan.fr
springerlink.com参考文章(30)
Wen-Shenq Juang, Chin-Laung Lei, A Secure and Practical Electronic Voting Scheme for Real World Environments (Special Section on Cryptography and Information Security) IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. ,vol. 80, pp. 64- 71 ,(1997)
Atsushi Fujioka, Tatsuaki Okamoto, Kazuo Ohta, A Practical Secret Voting Scheme for Large Scale Elections theory and application of cryptographic techniques. pp. 244- 251 ,(1992) , 10.1007/3-540-57220-1_66
Wen-Shenq Juang, Chin-Laung Lei, A Secure and Practical Electronic Voting Scheme for Real World Environments IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. pp. 64- 71 ,(1997)
Kazue Sako, Electronic Voting Schemes. Encyclopedia of Cryptography and Security (2nd Ed.). pp. 391- 393 ,(2005)
Matthew Hennessy, Robin Milner, On Observing Nondeterminism and Concurrency international colloquium on automata, languages and programming. pp. 299- 309 ,(1980) , 10.1007/3-540-10003-2_79
David Chaum, Blind Signatures for Untraceable Payments international cryptology conference. pp. 199- 203 ,(1983) , 10.1007/978-1-4757-0602-4_18
Martin Hirt, Kazue Sako, Efficient receipt-free voting based on homomorphic encryption theory and application of cryptographic techniques. pp. 539- 556 ,(2000) , 10.1007/3-540-45539-6_38
Gavin Lowe, Analysing protocols subject to guessing attacks Journal of Computer Security. ,vol. 12, pp. 83- 97 ,(2004) , 10.3233/JCS-2004-12104
S. Delaune, F. Jacquemard, A theory of dictionary attacks and its complexity ieee computer security foundations symposium. pp. 2- 15 ,(2004) , 10.1109/CSFW.2004.3
Martín Abadi, Cédric Fournet, Mobile values, new names, and secure communication Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '01. ,vol. 36, pp. 104- 115 ,(2001) , 10.1145/360204.360213