Computationally sound mechanized proofs for deniable authentication protocols with a probabilistic polynomial calculus in computational model

Information Technology Journal

Volumn 10, Issue 3, 2011, Pages 611-625

  Meng, Bo ^a   Shao, Fei ^a  

^a SOUTH CENTRAL UNIVERSITY FOR NATIONALITIES   (China)

Author keywords

Automatic framework; Computational model; Deniable authentication protocol; Strong deniability; Weak deniability

Indexed keywords

AUTOMATIC FRAMEWORK; COMPUTATIONAL MODEL; DENIABLE AUTHENTICATION PROTOCOL; STRONG DENIABILITY; WEAK DENIABILITY;

AUTHENTICATION; CALCULATIONS; NETWORK SECURITY;

NETWORK PROTOCOLS;

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

References (32)

1. 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.es.cityu.edu.hk/dept/video.html.
2. Bellare, M., R. Canetti and H. Krawczyk, 1998. A modular approach to the design and analysis of authentication and key exchange protocols. Proceedings of the 30th Annual Symposium on the Theory of Computing, (ASTC'98), Dallas, Texas, United States, pp: 419-428.
3. Bhargavan, K., R. Corin and C. Fournet, 2007. Crypto-verifying protocol implementations in ML. Proceedings of the Workshop on Formal and Computational Cryptography-FCC 2007.
4. Bhargavan, K., R. Corin, C. Fournet and E. Zalinescu, 2008. Cryptographically verified implementations for TLS. Proceedings of the 15th ACM Conference on Computer and Communications Security, Oct. 27-31, Alexandria, Virginia, USA., pp: 459-468.
5. Blanchet, B. and D. Pointcheval, 2006. Automated security proofs with sequences of games. Proceedings of the 27th IEEE Symposium on Security, Aug. 06, LNCS, Santa Barbara, CA, Springer Verlag, pp: 537-554.
6. Blanchet, B., 2001. An efficient cryptographic protocol verifier based on prolog rules. Proceedings of the 14th IEEE Workshop on Computer Security Foundations, June 11-13, IEEE Computer Society, Washington, DC, pp: 82-96.
7. Blanchet, B., 2005. A computationally sound mechanized prover for security protocols. Cryptology ePrintArchive, Report 2005/401, Nov. 2005. http://eprint.iacr.org/2005/401.
8. Blanchet, B., 2006. A computationally sound mechanized prover for security protocols. Proceedings of IEEE Symposium on Security and Privacy, May 21-24, Oakland, California, pp: 150-154.
9. Blanchet, B., 2007a. A computationally sound mechanized prover for security protocols. IEEE Trans. Dependable Secure Comput., 5: 193-207.
10. Blanchet, B., 2007b. Computationally sound mechanized proofs of correspondence assertions. Proceedings of 20th IEEE Computer Security Foundations Symposium, July 6-8, Venice, Italy, pp: 97-111.
11. Blanchet B., A.D. Jaggard, A. Scedrov and J. Tsay, 2008. Computationally sound mechanized proofs for basic and public-key kerberos. Proceedings of the ACM Symposium on Information, Computer and Communications Security, March 2008, Tokyo, Japan, pp: 87-99.
12. Canetti, R. and H. Krawczyk, 2001. Analysis of key-exchange protocols and their use for building secure channels. Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology, May 06, Springer-Verlag, London, UK., pp: 453-474.
13. Canetti, R. and H. Krawczyk, 2002. Universally composable notions of key exchange and secure channels. Adv. Cryptol., 2332: 337-351.
14. Deng, X., C.H. Lee and H. Zhu, 2001. Deniable authentication protocols. IEE Proc. Comput. Digital Techniques, 148: 101-104.
15. Dwork, C, M. Naor and A. Sahai, 1998. Concurrent zero-knowledge. Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, USA., pp: 409-418.
16. Fan, L., C.X. Xu and J.H. Li, 2002. Deniable authentication protocol based on Diffie-Hellman algorithm. Elect. Lett., 38: 705-706.
17. Feng, T. and J.F. Ma, 2007. Universally composable security concurrent deniable authentication based on witness indistinguishable. J. Software, 18: 2871-2881.
18. Han, S., W.Q. Liu and E. Chang, 2005. Deniable Authentication protocol resisting man-in-the-middle attack. Proc. World Acad. Sci. Eng. Technol., 3: 161-164.
19. Jaggard, A.D., A. Scedrov and J. Tsay, 2007. Computationally sound mechanized proof of PKINIT for kerberos. Proceedings of the Workshop on Formal and Computational Cryptography - FCC 2007. http://dimacs.rutgers.edu/∼adj/ Research/papers/jst07fcc.pdf
20. Laud, P., 2005. Secrecy types for a simulatable cryptographic library. Proceedings of the 12th ACM Conference on Computer and Communications Security, Nov. 07-11, ACM, New York, pp: 26-35.
21. Lee, W.B., C.C. Wu and W.J. Tsaur, 2007. A novel deniable authentication protocol using generalized ElGamal signature scheme. Inform. Sci., 177: 1376-1381.
22. Lincoln, P., J. Mitchell, M. Mitchell and A. Scedrov, 1998. A probabilistic poly-time framework for protocol analysis. Proceedings of the 5th ACM Conference on Computer and Communications Security, Nov. 02-05, San Francisco, California, United States, pp: 112-121.
23. Lincoln, P., J.C. Mitchell, M. Mitchell and A. Scedrov, 1999. Probabilistic polynomial-time equivalence and security analysis. Proc. World Cong. Formal Meth. Dev. Comput. Syst., 1: 776-793.
24. Lu, R. and Z. Cao, 2005a. A new deniable authentication protocol from bilinear pairings. Applied Math. Comput., 168: 954-961. (Pubitemid 41405653)
25. Lu, R. and Z. Cao, 2005b. Non-interactive deniable authentication protocol based on factoring. Comput. Standards Interfaces, 27: 401-405. (Pubitemid 40339687)
26. Meng, B., 2009a. 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.
27. Meng, B., 2009b. Formalizing deniability. Inform. Technol. J., 8: 625-642.
28. Micciancio, D. and B. Warinschi, 2004. Soundness of formal encryption in the presence of active adversaries. Theory Cryptography (LNCS), 2951: 133-151.
29. 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.
30. 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.
31. Shao, Z., 2004. Efficient deniable authentication protocol based on generalized ElGamal signature scheme. Comput. Standards Interfaces, 26: 449-454.
32. Shi, Y. and J. Li, 2005. Identity-based deniable authentication protocol. Elect. Lett., 41: 241-242.