Journal of University of Chinese Academy of Sciences >
On the Improvement of BAN Logic Analysis
Received date: 2002-06-06
Online published: 2002-05-18
To solve the problems that BAN logic analysis tends to neglect the potential defect of "send again attack" for cryptographic protocols,is made some improvement to the new message judgement of logic postulate of BAN logic analysis, aiming at reducing the misleading probability of BAN logic
Key words： cryptographic protocol; logic analysis; send again attack
MENG Jiang-Tao , FENG Deng-Guo , HU Zheng-Yu . On the Improvement of BAN Logic Analysis[J]. Journal of University of Chinese Academy of Sciences, 2002 , 19(3) : 295 -305 . DOI: 10.7523/j.issn.2095-6134.2002.3.012
1. J Cohen, M Fischer. A Robust and Verifiable Cryptographically Secure Election Scheme. In: Proceedings of the 26th IEEE Symposi- um of Computer Science. 1985
2. S Chien, C Shan. Hierarchical Distributed Election Protocols; www. digitas. harcard. edu/ kem/cs262/
3. Davenport B, Newberger A, Woodard J. Creating a Secure Digital Voting Protocol for Campus Elections. Unpublished paper. 1995;Available online from http: //www. Princeton. edu/^-bpd/voting/
4. Benaloh J, Tuinstra D. Receipt=Free Secret-ballot Elections. In: Proceedings of the Twenty-sixth Annual ACM Symposium on the Theory of Computing. 1994
5. Valtteri Niemi, Ari Renvall. How to Prevent Buying of Votes in Computer Elections. Advances in Cryptology-ASIACRYPT’94
6. CybcrVote. Report on Review of Cryptographic Protocols and Security techniyues for Electronic Voting, 2002
7. VoteHere Inc. Network Voting System Standards.2002
8. Salomaa A. Verifying and Recasting Secret Baitots in Computer Networks. In: New Results and New Trends in Computer Science.Berlin: Springer-Verlag, 1991
9. Chaum D. Blind Signatures for Untraceable Payments. In: Proceedings of Crypto 82, New York:Plenum Press. 1983
10. Cranor I. F, Cytron R K. Design and Implementation of a Security-Conscious Electronic Polling System. Washington University Computer Science Technical Report WUCS-96-02. 1996
11. Bruce 5chneier，Applied Cryptography. Second Edition: Protocols, Algorthms, and Source Code in C, 1996
12. Nurmi, Salomaa, Santean. Secret Ballot Elections in Networks, Computers and Security, 1991
13. J Stern. A New and Efficient All-or-Nothing Disclosure of Secrets Protocol; http: //www. dice. u61. be/crypto/seminars/Stern98. ht-mld, 1998
14. R J F Cramer, M Franklin, I. A M Schoenmakers, M Yung. Multi-authoruty Secret-ballot Elections; http://www. cwi. nl/ftp/ber-ry/CS-89571.ps. Z
15. Farrcl Lifson. The Security of Electronic Online Voting, 2000
16. 1' Southwell. Survey of Vote-by-Mail Senate Election; http: //darkwing. uoregon. edu/ osrl/vbm八bm/vbm. html, 1996
17. Fujioka A, Okamoto T, Ohta K. A Practical Secret Voting Scheme for Large Scale Elections. In: Advances in Cryptology一A US-CRYPT'92, Berlin:Springer-Verlag.l993
18. K Ohta. An Electrical Voting Scheme Using a Single Administrator. IEICE Spring National Convention. 1988
19. Lorrie Faith Cranor. Electronic Voting Computerized Polls may Save Money, protect privacy. 1996
20. A Salomaa. Public-Key Cryptography, Springer-Verlag, 1990
21. Kazue Sako, Joe Killian. Secure Voting Using Partially Compatible Homomorphisms. In: Yvo G Desmedt, editor. Advances in Cryptology-CRYPTO'94, 839. Lecture Notes in Computer Science, Springer-Verlag. 1994
22. Kazuc Sako, Joe Killian. Receipt-free Mix-type Voting Scheme: A Practical Solution to the Implementation of a Voting Booth. In:Louis C Guillou, Jean-Jacques Quisyuater, editors. Advances in Cryptology—EURO(:RYPT’95. 921. Lecture Notes in Computer Science, Springer-Verlag.1995
23. Choonsik Park, Kazutomo Itoh, Kaoru Kurosawa. Efficient Anonymous Channel and All/Nothing Election Scheme. In:or Helles-eth, editor, Advances in Cryptology-EUROCRYPT' 93. 765. Lecture Notes in Computer Science Springer-Verlag, 1993. 248一259
/
| 〈 |
|
〉 |