Secure One-to-Group Communications Escrow-Free ID-Based Asymmetric Group Key Agreement

被引:5
|
作者
Zhang, Lei [1 ]
Wu, Qianhong [2 ]
Domingo-Ferrer, Josep
Qin, Bo [3 ,4 ]
Chow, Sherman S. M. [5 ]
Shi, Wenchang [4 ]
机构
[1] East China Normal Univ, Inst Software Engn, Shanghai Key Lab Trustworthy Comp, Shanghai 200062, Peoples R China
[2] Beihang Univ, Sch Elect & Informat Engn, Beijing, Peoples R China
[3] Univ Rovira, Dept Comp Engn, UNESCO, Rovira, Spain
[4] Renmin Univ China, Sch Informat, Beijing, Peoples R China
[5] Chinese Univ Hong Kong, Dept Informat Engn, Hong Kong, Hong Kong, Peoples R China
基金
北京市自然科学基金;
关键词
Communication security; Keymanagement; Identity-based cryptography; Asymmetric group key agreement; IDENTITY-BASED ENCRYPTION; BROADCAST ENCRYPTION; PROTOCOLS;
D O I
10.1007/978-3-319-12087-4_15
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Group key agreement (GKA) is widely employed for secure group communications. Yet there is an increasing demand for secure one-to-group communications in distributed computing applications. Asymmetric group key agreement (AGKA) is a handy tool to answer this need. In AGKA, a group of members can establish a group public key while each member has a different secret key. Any sender can encrypt under this group key such that any of the members who hold the secret key can decrypt. This paper proposes an identity-based AGKA protocol which is secure against active attackers, with an emphasis on optimal round efficiency, sender dynamics, and escrow freeness. The last feature offers security of the previously established ciphertexts even when either all the involved participants or the key generation center of the identity-based cryptosystem are compromised. The proposed protocol is shown to be secure under the k-Bilinear Diffie-Hellman exponent assumption in the random oracle model. Regarding performance, our protocol is comparable to the state-of-the-art AGKA protocols.
引用
收藏
页码:239 / 254
页数:16
相关论文
共 50 条
  • [1] Two provable secure ID-based group Key agreement protocols
    Miao, Fang
    Liang, Jun
    Yoo, Hyeong Seon
    Wei, Wei
    Journal of Computational Information Systems, 2007, 3 (05): : 1887 - 1892
  • [2] Forward Secure ID-based Group Key Agreement Protocol with Anonymity
    Park, Hyewon
    Kim, Zeen
    Kim, Kwangjo
    2009 THIRD INTERNATIONAL CONFERENCE ON EMERGING SECURITY INFORMATION, SYSTEMS, AND TECHNOLOGIES, 2009, : 274 - 279
  • [3] A Secure ID-Based Explicit Authenticated Key Agreement Protocol without Key Escrow
    Hou, Mengbo
    Xu, Qiuliang
    FIFTH INTERNATIONAL CONFERENCE ON INFORMATION ASSURANCE AND SECURITY, VOL 1, PROCEEDINGS, 2009, : 487 - 490
  • [4] ID-based authenticated group key agreement secure against insider attacks
    Choi, Kyu Young
    Hwang, Jung Yeon
    Lee, Dong Hoon
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2008, E91A (07) : 1828 - 1830
  • [5] An Improved ID-Based Group Key Agreement Protocol
    Kangwen Hu
    Jingfeng Xue
    Changzhen Hu
    Rui Ma
    Zhiqiang Li
    Tsinghua Science and Technology, 2014, 19 (05) : 421 - 428
  • [6] An Improved ID-Based Group Key Agreement Protocol
    Hu, Kangwen
    Xue, Jingfeng
    Hu, Changzhen
    Ma, Rui
    Li, Zhiqiang
    TSINGHUA SCIENCE AND TECHNOLOGY, 2014, 19 (05) : 421 - 428
  • [7] ID-Based Authenticated Dynamic Group Key Agreement
    王莺洁
    潘军
    诸鸿文
    JournalofShanghaiJiaotongUniversity, 2005, (03) : 236 - 241
  • [8] An ID-based conference key agreement protocol for secure network communications
    Chang, CC
    Lin, IC
    PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON INFORMATION AND MANAGEMENT SCIENCES, 2002, 2 : 252 - 256
  • [9] Efficient ID-Based One Round Authenticated Group Key Agreement Protocol
    Shi, Yijuan
    Chen, Gongliang
    Li, Jianhua
    JOURNAL OF INFORMATION ASSURANCE AND SECURITY, 2006, 1 (03): : 167 - 170
  • [10] Secure and efficient ID-based group key agreement fitted for Pay-TV
    Kim, H
    Nam, J
    Kim, S
    Won, D
    ADVANCES IN MULTIMEDIA INFORMATION PROCESSING - PCM 2005, PT 2, 2005, 3768 : 117 - 128