RKA Security of Identity-Based Homomorphic Signature Scheme

被引:17
作者
Chang, Jinyong [1 ,2 ]
Ma, Hui [3 ]
Zhang, Anling [2 ]
Xu, Maozhi [4 ]
Xue, Rui [3 ]
机构
[1] Xian Univ Architecture & Technol, Sch Informat & Control Engn, Xian 710055, Shaanxi, Peoples R China
[2] Changzhi Univ, Dept Math, Changzhi 046011, Peoples R China
[3] Chinese Acad Sci, Inst Informat Engn, State Key Lab Informat Secur, Beijing 100093, Peoples R China
[4] Peking Univ, Sch Math Sci, Beijing 100871, Peoples R China
基金
中国国家自然科学基金;
关键词
Homomorphic signature; IB-signature scheme; RKA security; NETWORK; ATTACKS;
D O I
10.1109/ACCESS.2019.2908244
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Recently, Lin et al. proposed a new primitive identity-based (IB) homomorphic signature scheme and presented an ingenious implement by using any IB-signature scheme as a building block. In this paper, we consider a new type of attack on their scheme: Related-key attack (RKA) is introduced by Bellare and Kohno in 2003 and widely considered for kinds of cryptographic primitives. Specifically, for the first time, we define the RKA security of IB-homomorphic signature scheme. By modifying the signing secret key as its linear form, we prove that Lin et al.'s IB-homomorphic signature scheme is not RKA secure. But a slight modification of it yields an RKA secure one under the original assumptions. We also present security proof in detail. However, we remark that the reason why RKA on Lin et al.'s scheme can be successful lies in that RKA is outside of its security model. Finally, the numerical analysis and experimental results demonstrate that our modified scheme does not distinctly decrease the computational efficiency of Lin et al.'s scheme.
引用
收藏
页码:50858 / 50868
页数:11
相关论文
共 23 条
  • [1] Charm: a framework for rapidly prototyping cryptosystems
    Akinyele, Joseph A.
    Garman, Christina
    Miers, Ian
    Pagano, Matthew W.
    Rushanan, Michael
    Green, Matthew
    Rubin, Aviel D.
    [J]. JOURNAL OF CRYPTOGRAPHIC ENGINEERING, 2013, 3 (02) : 111 - 128
  • [2] [Anonymous], 20024 IACR CRYPT EPR
  • [3] [Anonymous], STANDARD PAIRING BAS
  • [4] Attrapadung N, 2011, LECT NOTES COMPUT SC, V6571, P17, DOI 10.1007/978-3-642-19379-8_2
  • [5] Bellare M, 2003, LECT NOTES COMPUT SC, V2656, P491
  • [6] Bellare M, 2011, LECT NOTES COMPUT SC, V7073, P486, DOI 10.1007/978-3-642-25385-0_26
  • [7] Boneh D, 2011, LECT NOTES COMPUT SC, V6571, P1, DOI 10.1007/978-3-642-19379-8_1
  • [8] Boneh D, 2009, LECT NOTES COMPUT SC, V5443, P68
  • [9] Catalano Dario, 2014, Security and Cryptography for Networks. 9th International Conference (SCN 2014). Proceedings: LNCS 8642, P514, DOI 10.1007/978-3-319-10879-7_29
  • [10] Cha JC, 2003, LECT NOTES COMPUT SC, V2567, P18