Certificateless aggregate signature scheme secure against fully chosen-key attacks

被引:33
|
作者
Wu, Ge [1 ,3 ,4 ]
Zhang, Futai [2 ]
Shen, Limin [2 ]
Guo, Fuchun [3 ]
Susilo, Willy [3 ]
机构
[1] Southeast Univ, Sch Cyber Sci & Engn, Nanjing, Peoples R China
[2] Nanjing Normal Univ, Sch Comp Sci & Technol, Nanjing, Peoples R China
[3] Univ Wollongong, Sch Comp & Informat Technol, Inst Cybersecur & Cryptol, Wollongong, NSW, Australia
[4] Purple Mt Labs, Nanjing, Peoples R China
基金
中国国家自然科学基金;
关键词
Certificateless aggregate signature; Security model; Fully chosen-key attacks; Malicious KGC attacks; CRYPTANALYSIS; INSECURITY; IMPROVEMENT;
D O I
10.1016/j.ins.2019.11.037
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Certificateless aggregate signature (CLAS) schemes enjoy the benefits of both certificate less cryptography and aggregate signature features. Specifically, it not only simplifies the certificate management without introducing the key escrow problem but also transforms many signatures into one aggregate signature to save communication and computation cost. CLAS is a powerful cryptographic tool, yet its security should be thoroughly analyzed before being implemented. In this paper, we give a new insight into the security of CLAS schemes. We introduce a potential and realistic attack called fully chosen-key attacks that has not been considered in the traditional security models and define the security model against fully chosen-key attacks. In contrast to the traditional models, the adversary is allowed to hold all the signers' private keys and its goal is not to forge an aggregate signature but to output invalid single signatures that can be aggregated into a valid aggregate signature. We find there is no CLAS scheme secure in traditional security models that is secure against fully chosen-key attacks and then demonstrate how to reinforce the security of, an existing scheme to withstand such an attack. (C) 2019 Elsevier Inc. All rights reserved.
引用
收藏
页码:288 / 301
页数:14
相关论文
共 50 条
  • [1] A secure Certificateless Aggregate Signature Scheme
    Kang, Baoyuan
    Xu, Danhui
    INTERNATIONAL JOURNAL OF SECURITY AND ITS APPLICATIONS, 2016, 10 (03): : 55 - 67
  • [2] Secure certificateless aggregate signature scheme
    School of Computer Science and Technology, Huaibei Normal University, Huaibei
    235000, China
    Ruan Jian Xue Bao, 5 (1173-1180):
  • [3] A Secure and Efficient Certificateless Aggregate Signature Scheme
    Liu, He
    Liang, Mangui
    Sun, Haoliang
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2014, E97A (04) : 991 - 995
  • [4] Improved Certificateless Aggregate Signature Scheme Against Collusion Attacks for VANETs
    Xiong, Wanjun
    Wang, Ruomei
    Wang, Yujue
    Wei, Yongzhuang
    Zhou, Fan
    Luo, Xiaonan
    IEEE SYSTEMS JOURNAL, 2023, 17 (01): : 1098 - 1109
  • [5] An efficient and secure certificateless aggregate signature scheme
    Xu, Ran
    Zhou, Yanwei
    Yang, Qiliang
    Yang, Kunwei
    Han, Yu
    Yang, Bo
    Xia, Zhe
    JOURNAL OF SYSTEMS ARCHITECTURE, 2024, 147
  • [6] Study on a Provably Secure Certificateless Aggregate Signature Scheme
    Liu, Yan
    Hu, XiaoMing
    Tan, Wenan
    2016 IEEE 13TH INTERNATIONAL CONFERENCE ON NETWORKING, SENSING, AND CONTROL (ICNSC), 2016,
  • [7] Study on a Provably Secure Certificateless Aggregate Signature Scheme
    Liu, Yan
    Hu, Xiaoming
    Tan, Wenan
    2016 IEEE 13TH INTERNATIONAL CONFERENCE ON NETWORKING, SENSING, AND CONTROL (ICNSC), 2016,
  • [8] Fully Secure Lightweight Certificateless Signature Scheme for IIoT
    Rezaeibagha, Fatemeh
    Mu, Yi
    Huang, Xinyi
    Yang, Wenjie
    Huang, Ke
    IEEE ACCESS, 2019, 7 : 144433 - 144443
  • [9] A short certificateless aggregate signature against coalition attacks
    Yang, Xiaodong
    Wang, Jinli
    Ma, Tingchun
    Li, Yutong
    Wang, Caifen
    PLOS ONE, 2018, 13 (12):
  • [10] A DIGITAL SIGNATURE SCHEME SECURE AGAINST ADAPTIVE CHOSEN-MESSAGE ATTACKS
    GOLDWASSER, S
    MICALI, S
    RIVEST, RL
    SIAM JOURNAL ON COMPUTING, 1988, 17 (02) : 281 - 308