Formalizing deniability

Information Technology Journal

Volumn 8, Issue 5, 2009, Pages 625-642

  Meng, Bo ^a  

^a SOUTH CENTRAL UNIVERSITY FOR NATIONALITIES   (China)

Author keywords

Deniable authentication protocol; Formal method; Strong deniability; Weak deniability

Indexed keywords

DENIABLE AUTHENTICATION; DENIABLE AUTHENTICATION PROTOCOL; FORMAL FRAMEWORK; NON-INTERACTIVE; STRONG DENIABILITY; WEAK DENIABILITY;

AUTHENTICATION;

FORMAL METHODS;

EID: 67651065167     PISSN: 18125638     EISSN: 18125646     Source Type: Journal    
DOI: 10.3923/itj.2009.625.642     Document Type: Article

References (30)

1. Abadi, M. and A. D. Gordon, 1997. A calculus for cryptographic protocols: The spi calculus. Proceedings of the 4th ACM Conference on Computer and Communications Security, Zurich, Apr. 1-4, Switzerland, New York, pp:36-47.
2. Abadi, M. and C. Fournet, 2001. Mobile values, new names and secure communication. Proceedings of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, London, UK., March 2001, ACM New York, USA., pp:104-115.
3. Aumann, Y. and M. Rabin, 1998. Efficient deniable authentication of long messages. Proceedings of the International Conference on Theoretical Computer Science in Honor of Professor Manuel Blum's 60th Birthday, 1998. http://www.cs.cityu.edu.hk/dept /video.html.
4. Boyd, C. and W. Mao, 1994. On a limitation of BAN logic. Proceedings of Advances in Cryptology-EUROCRYPT'93, May 23-27, Lofthus, Norway, pp:240-247.
5. Burrows, M., M. Abadi and R. Needham, 1989. A logic of authentication. SIGOPS Operat. Syst. Rev., 23:1-13.
6. Delaune, S., S. Kremer and M. D. Ryan, 2006. Coercionresistance and receipt-freeness in electronic voting protocol. Proceedings of 19th IEEE Computer Security Foundations Workshop, July 5-7, Venice, Italy, pp:28-42.
7. Deng, X., C. H. Lee and H. Zhu, 2001. Deniable authentication protocols. IEE Proc. Comput. Digital Techniques, 148:101-104.
8. Dwork, C, M. Naor and A. Sahai, 1998. Concurrent zeroknowledge. Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, USA., pp:409-418.
9. Fan, L., C. X. Xu and J. H. Li, 2002. Deniable authentication protocol based on Diffie-Hellman algorithm. Elect. Lett, 38:705-706.
10. Feng, T. and J. F. Ma, 2007. Universally composable security concurrent deniable authentication based on witness indistinguishable. J. Software, 18:2871-2881.
11. Han, S., W. Q. Liu and E. Chang, 2005. Deniable authentication protocol resisting man-in-the-middle attack. Proceedings of world Academy of Science, Engineering and Technology, Jan. 2005, PWASET, pp:1-4.
12. Hoare, C. A., 1985. Communicating Sequential Processes. Prentice-Hall, Inc., USA.
13. Jonker Hugo, L., V. de and P. Erik, 2006. Formalising Receipt-freeness. Proceedings of the 9th International Conference on Information Security, Aug. 30-Sept. 2, Samos Island, Greece, pp:476-488.
14. Kailar, R., 1996. Accountability in electronic commerce protocols. IEEE Trans. Software Eng., 22:313-328.
15. Kessler, V. and H. Neumann, 1998. A sound logic for analyzing electronic commerce protocols. Proceedings of the 5th European Symposium on Research in Computer Security, Sept. 16-18, London, pp:345-360.
16. Kremer, S. and M. D. Ryan, 2005. Analysis of an electronic voting protocol in the applied Pi calculus. Lect. Notes Comput. Sci., 3444:186-200.
17. Lee, W. B., C. C. Wu and W. J. Tsaur, 2007. A novel deniable authentication protocol using generalized El Gamal signature scheme. Inform. Sci., 177:1376-1381.
18. Lu, R. and Z. Cao, 2005a. A new deniable authentication protocol from bilinear pairings. Applied Math. Comput, 168:954-961.
19. Lu, R. and Z. Cao, 2005b. Non-interactive deniable authentication protocol based on factoring. Comput. Standards Interfaces, 27:401-405.
20. Meng, B., H. Zhang and Q. Xiong, 2005. The practical detailed requirements of accountability and its application in the electronic payment protocols. Proceedings of the 2005 IEEE international Conference on E-Technology, E-Commerce and E-Service, Mar. 29-Apr. 1, Acadmic Press, pp:556-561.
21. Meng, B., 2007. Analysis of internet voting protocols with jonker-vink receipt freeness formal model. Proceedings of the 2007 international Conference on Convergence information Technology, Nov. 21-23, ICCIT., IEEE Computer Society, Washington, DC, pp:663-669.
22. Meng, B., 2008. Formal analysis of key properties in the internet voting protocol using applied pi calculus. Inform. Technol. J., 7:1133-1140.
23. Meng, B., 2009a. A formal logic framework for receipt-freeness in internet voting protocol. J. Comput, 4:184-192.
24. Meng, B., 2009b. A secure non-interactive deniable authentication protocol with strong deniability based on discrete logarithm problem and its application on Internet voting protocol. Inform. Technol. J., 8:302-309.
25. Mitchell, J. C., M. Mitchell and U. Stern, 1997. Automated analysis of cryptographic protocols using Mur. Proceedings of the 1997 IEEE Symposium on Security and Privacy, May 04-07, Digital Library, pp. 141-141.
26. Qian, H. F., Z. F. Cao, L. C. Wang and Q. S. Xue, 2005. Efficient non-interactive deniable authentication protocols. Proceedings of the 5th International Conference on Computer and Information Technology, Sept. 21-23, IEEE Computer Society Washington, DC. USA., pp:673-679.
27. Raimondo, M. D. and R. Gennaro, 2005. New approaches for deniable authentication. Proceedings of the 12th ACM Conference on Computer and Communications Security, Nov. 7-11, ACM Press, New York, pp:112-121.
28. Shao, Z., 2004. Efficient deniable authentication protocol based on generalized ElGamal signature scheme. Comput. Standards Interfaces, 26:449-454.
29. Shi, Y. and J. Li, 2005. Identity-based deniable authentication protocol. Elect. Lett., 41:241-242.
30. Thayer, F., J. C. Herzog and J. D. Guttman, 1998. Strand space: Why is a security protocol correct? Proceedings of the 1998 IEEE Symposium on Security and Privacy, 1998, ACM, USA., pp:160-171.