Universally Composable Symbolic Analysis of Group Key Exchange Protocol

被引：0
|
作者：
Zhang Zijian [1 ]
Zhu Liehuang [1 ]
Liao Lejian [1 ]
机构：
[1] Beijing Inst Technol, Sch Comp Sci & Technol, Beijing 100081, Peoples R China
来源：
CHINA COMMUNICATIONS | 2011年 / 8卷 / 02期
基金：
中国国家自然科学基金;
关键词：
universally composable symbolic analysis; universally composable; mapping algorithm; burmester-desmedt protocol; group key exchange protocol;
D O I：
暂无
中图分类号：
TN [电子技术、通信技术];
学科分类号：
0809 ;
摘要：
Canetti and Herzog have already proposed universally composable symbolic analysis (UCSA) to analyze mutual authentication and key exchange protocols. However, they do not analyze group key exchange protocol. Therefore, this paper explores an approach to analyze group key exchange protocols, which realize;automation and guarantee the soundness of cryptography. Considered that there exist many kinds of group key exchange protocols and the participants' number of each protocol is arbitrary. So this paper takes the case of Burmester-Desmedt (BD) protocol with three participants against passive adversary (3-BD-Passive). In a nutshell, our works lay the root for analyzing group key exchange protocols automatically without sacrificing soundness of cryptography.
引用
收藏
页码：59 / 65
页数：7
相关论文
共 50 条
  • [1] Universally composable group key exchange protocol
    Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
    不详
    不详
    Dianzi Yu Xinxi Xuebao, 2009, 7 (1571-1575):
  • [2] A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort
    Furukawa, Jun
    Armknecht, Frederik
    Kurosawa, Kaoru
    SECURITY AND CRYPTOGRAPHY FOR NETWORKS, PROCEEDINGS, 2008, 5229 : 392 - +
  • [3] Universally composable security authenticated key exchange protocol
    Zhang, Zinan, 1600, Science Press (41):
  • [4] Universally composable symbolic analysis of mutual authentication and key-exchange protocols
    Canetti, Ran
    Heizog, Jonathan
    THEORY OF CRYPTOGRAPHY, PROCEEDINGS, 2006, 3876 : 380 - 403
  • [5] Universally Composable Asymmetric Group Key Agreement Protocol
    Chen, Yong
    He, Mingxing
    Zeng, Shengke
    Li, Xiao
    2015 10TH INTERNATIONAL CONFERENCE ON INFORMATION, COMMUNICATIONS AND SIGNAL PROCESSING (ICICS), 2015,
  • [6] Anonymous authentication key exchange protocol with universally composable security
    Cai, Qing-Ling
    Zhan, Yi-Ju
    Liu, Yang
    Tang, Zhuo-Yi
    Shenzhen Daxue Xuebao (Ligong Ban)/Journal of Shenzhen University Science and Engineering, 2010, 27 (04): : 402 - 407
  • [7] Universally Composable Attribute-based Group Key Exchange
    Zhao, Zenghui
    Hao, Yunfang
    PROCEEDINGS OF THE 2018 6TH INTERNATIONAL CONFERENCE ON MACHINERY, MATERIALS AND COMPUTING TECHNOLOGY (ICMMCT 2018), 2018, 152 : 343 - 346
  • [8] Universally Composable Attribute-based Group Key Exchange
    Xie, Hui
    Yan, Yongjie
    Shu, Sihui
    INTERNATIONAL JOURNAL OF SECURITY AND ITS APPLICATIONS, 2015, 9 (01): : 179 - 190
  • [9] Universally Composable Symbolic Security Analysis
    Canetti, Ran
    Herzog, Jonathan
    JOURNAL OF CRYPTOLOGY, 2011, 24 (01) : 83 - 147
  • [10] Universally Composable Symbolic Security Analysis
    Ran Canetti
    Jonathan Herzog
    Journal of Cryptology, 2011, 24 : 83 - 147
12345