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
来源
INFORMATION SECURITY AND CRYPTOLOGY, INSCRYPT 2013 | 2014年 / 8567卷
基金
北京市自然科学基金;
关键词
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
相关论文
共 27 条
  • [1] Bellare M., 1994, CRYPTO, P232
  • [2] Bellare Mihir., 1998, STOC, P419
  • [3] Hierarchical identity based encryption with constant size ciphertext
    Boneh, D
    Boyen, X
    Goh, EJ
    [J]. ADVANCES IN CRYPTOLOGY - EUROCRYPT 2005,PROCEEDINGS, 2005, 3494 : 440 - 456
  • [4] Boneh D., 2003, Contemporary Mathematics, P71, DOI DOI 10.1090/CONM/324/05731
  • [5] Burmester M., 1995, Advances in Cryptology - EUROCRYPT '94. Workshop on the Theory and Application of Cryptographic Techniques. Proceedings, P275, DOI 10.1007/BFb0053443
  • [6] Identity-based key agreement protocols from pairings
    Chen, L.
    Cheng, Z.
    Smart, N. P.
    [J]. INTERNATIONAL JOURNAL OF INFORMATION SECURITY, 2007, 6 (04) : 213 - 241
  • [7] Identity based authenticated key agreement protocols from pairings
    Chen, LQ
    Kudla, C
    [J]. 16TH IEEE COMPUTER SECURITY FOUNDATIONS WORKSHOP, PROCEEDINGS, 2003, : 219 - 233
  • [8] Choi KY, 2004, LECT NOTES COMPUT SC, V2947, P130
  • [9] Chow SSM, 2007, LECT NOTES COMPUT SC, V4779, P203
  • [10] Chow SSM, 2009, LECT NOTES COMPUT SC, V5443, P256