期刊文献+

Formal Verification in 3oux Tripartite Diffie-Hellman Protocol

Formal Verification in 3oux Tripartite Diffie-Hellman Protocol
下载PDF
导出
摘要 Security analysis of cryptographic protocols has been widely studied for many years.As far as we know,we have not found any methods to effectively analyze group key exchange protocols for the three parties yet,which did not sacrifice the soundness of cryptography.Recently,Canetti and Herzog have proposed Universally Composable Symbolic Analysis(UCSA) of two-party mutual authentication and key exchange protocol which is based on the symmetric encryption schemes.This scheme can analyze the protocols automatically and guarantee the soundness of cryptography.Therefore,we discuss group key exchange protocol which is based on Joux Tripartite Diffie-Hellman(JTDH) using UCSA.Our contribution is analyzing group key exchange protocol effectively without damaging the soundness of cryptography. Security analysis of cryptographic proto- cols has been widely studied for many years. As far as we know, we have not found any methods to ef- fectively analyze group key exchange protocols for the three parties yet, which did not sacrifice the soundness of cryptography. Recently, Canetti and Herzog have proposed Universally Composable Symbolic Analysis (UCSA) of two-party mutual au- thentication and key exchange protocol which is based on the symmetric encryption schemes. This scheme can analyze the protocols automatically and guarantee the soundness of cryptography. Therefore, we discuss group key exchange protocol which is based on Joux Tripartite Diffie-Hellman (JTDH) u- sing UCSA. Our contribution is analyzing group key exchange protocol effectively without damaging the soundness of cryptography.
出处 《China Communications》 SCIE CSCD 2012年第3期153-163,共11页 中国通信(英文版)
基金 supported by the National Natural Science Foundation of China under Grants No.61003262,No.60873237,No.61100205,No.60873001 the Fundamental Research Funds for the Central Universities under Grant No.2009RC0212
关键词 UCSA computationally sound JTDH group key exchange protocol Diffie-Hellman协议 形式化验证 密钥交换协议 加密协议 赫尔佐格 加密方案 自动分析 稳健
  • 相关文献

参考文献13

  • 1DOLEV D, YAO A C. On the Security Of Public Key Proto- cols[C]// Proceedings of the IEEE 22rid Annual Symposium on Foundations of Computer Science: Nashville, TN. IEEE Press, 1981 : 350-357.
  • 2顾纯祥,光焱,祝跃飞.Game-Based Automated Security Proofs for Cryptographic Protocols[J].China Communications,2011,8(4):50-57. 被引量:1
  • 3CLARKE E, GRUMBERG O, PELED D. Model checking [M]. MIT Press, 1999.
  • 4BLANCHET B. Automatic Verification of Correspondences For Security Protocols [J]. Journal of Computer Security, 2009, 17(4): 363-434.
  • 5谭作文.A Provably Secure Identity-based Authentication Multiple Key Agreement Protocol[J].China Communications,2011,8(2):26-33. 被引量:2
  • 6ABADI M, ROGAWAY P. Reconciling Two Views of Cryp- tography[J]. Journal of Cryptology, 2002, 15(2): 103-127.
  • 7ZHANG Zijian, ZHU Liehuang, LIAO Lejian. Universall5 Composable Symbolic Analysis of Group Key Exchange Protocol[J]. China Communications, 2011, 8(3): 59--65.
  • 8CANETTI R. Universally Composable Symbolic Security A- nalysis [J ]. Journal of Cryptology, 2011,24: 83-147.
  • 9JOUX A. A One Round Protocol For Tripartite Diffiehellman [C]// Proceedings of the 4th Algorithmic Number Theory Symposium(ANTS). Berlin: Springer-Verkag, 2000: 385-394.
  • 10KATZ J, SHIN J S. Modeling Key Exchange Protocols [ C ]// insider Attacks On Group Proceedings of the 12thACM Conference on Computer and Communications Secu- rity. New York: ACM Press, 2005: 180-189.

二级参考文献31

  • 1王圣宝,曹珍富,董晓蕾.标准模型下可证安全的身份基认证密钥协商协议[J].计算机学报,2007,30(10):1842-1852. 被引量:42
  • 2JACQUEMARD F,RUSINOWITCH M,VIGNERON L.Compiling and Verifying Security Protocols. Pro- ceedings of the 7th International Conference on Logic for Programming and Automated Reasoning . 2000
  • 3SHOUP V.Sequences of Games: a Tool for Taming Com- plexity in Security Proofs[R/OL]. http: / /eprint.iacr.org/2004 /332 . 2004
  • 4BELLARE M,ROGAWAY P.Code-Based Game-Playing Proofs and the Security of Triple Encryption. Pro- ceedings of the 25th International Cryptology Conference- EuroCrypt 2006 . 2006
  • 5The LogiCal Project,INRIA.The Coq proof Assistant. http: / /coq.inria.fr . 2004
  • 6BARTHE G,HEDIN D,ZANELLA S,et al.A Machine- Checked Formalization of Sigma-Protocols. Proceed- ings of the 23rd IEEE Computer Security Foundations Sym- posium . 2010
  • 7CORTIER V,DELAUNE S,LAFOURCADE P.A Sur- vey of Algebraic Properties Used in Cryptographic Proto- cols. Journal of Computer Security . 2006
  • 8LOWE G.Casper: A Compiler for the Analysis of Secur- ity Protocols. Proceedings of the 10th Computer Se- curity Foundations Workshop . 1997
  • 9Bruno Blanchet,Avik Chaudhuri.Automated formal analysis of aprotocol for secure file sharing on untrusted storage. IEEE Symposium on Security and Privacy . 2008
  • 10Bellare M,Rogaway P.Random oracles are practical: a paradigm for designing efficient protocols. Proceedings of first ACM conference on Computer and Communications Security . 1993

共引文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部