作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2022, Vol. 48 ›› Issue (10): 146-157. doi: 10.19678/j.issn.1000-3428.0063876

• 网络空间安全 • 上一篇    下一篇

可公开验证的高效无证书聚合签密方案

陈虹1, 侯宇婷1, 郭鹏飞2, 周沫1, 赵菊芳1, 肖成龙3   

  1. 1. 辽宁工程技术大学 软件学院, 辽宁 葫芦岛 125105;
    2. 汕头职业技术学院 计算机系, 广东 汕头 515078;
    3. 汕头大学 工学院, 广东 汕头 515063
  • 收稿日期:2022-01-30 修回日期:2022-03-05 发布日期:2022-10-09
  • 作者简介:陈虹(1967—),女,副教授、硕士,主研方向为信息安全、网络安全;侯宇婷,硕士研究生;郭鹏飞,副教授、博士;周沫、赵菊芳,硕士研究生;肖成龙,教授、博士。
  • 基金资助:
    国家自然科学基金(61404069);辽宁省教育厅科学技术研究项目(LJ2017QL032)。

Efficient Certificateless Aggregate Signcryption Scheme with Public Verifiability

CHEN Hong1, HOU Yuting1, GUO Pengfei2, ZHOU Mo1, ZHAO Jufang1, XIAO Chenglong3   

  1. 1. College of Software, Liaoning Technical University, Huludao, Liaoning 125105, China;
    2. Department of Computer, Shantou Polytechnic, Shantou, Guangdong 515078, China;
    3. College of Engineering, Shantou University, Shantou, Guangdong 515063, China
  • Received:2022-01-30 Revised:2022-03-05 Published:2022-10-09

摘要: 签密技术是构建网络信任体系的基础,能够保证数据的机密性、完整性和可验证性,但是当大量用户同时进行签密时,验证耗时较长。聚合签密技术将大量用户的签名进行聚合,并提供批量验证以提高验证效率。针对现有基于双线性映射的聚合签密方案存在聚合验证效率低、不满足可公开验证性的问题,基于计算双线性Diffie-Hellman和计算性Diffie-Hellman困难问题假设,提出可公开验证的无证书聚合签密方案。采用双线性映射运算将发送方与接收方的身份信息分别添加到签名和密文中,以隐藏用户身份信息。在随机预言模型下验证该方案的机密性和不可伪造性,并且在对数据的真实性产生质疑时,通过任何可信第三方对验证等式进行计算,无需用户私有信息,具有可公开验证性。分析结果表明,该方案具有较少的运算开销,在聚合验证阶段,仅使用2次固定的双线性映射运算,能够有效提高运算效率。

关键词: 随机预言模型, 双线性映射, 可公开验证, 聚合签密, 无证书

Abstract: Signcryption technology is the foundation of building a network trust system, which can ensure the confidentiality, integrity and verifiability of data.However, when a large number of users perform signcryption at the same time, the verification takes a long time.Aggregate signcryption can aggregate the signatures of a large number of users and provide batch verification to improve verification efficiency.For the exciting aggregate signcryption scheme based on bilinear mapping, there are problems that the aggregated verification efficiency is low and does not meet public verifiability.Bilinear Diffie-Hellman and Diffie-Hellman computational-based puzzles, this study proposes certificateless aggregate signcryption scheme with public verifiability.The scheme adds a sender and recipient identity information to the signature and ciphertext respectively using bilinear mapping operation, which can hide the user's identity information, Under the Random Oracle Model (ROM), it is verified that the scheme satisfies confidentiality and forgeability simultaneously, and when the authenticity of the data is questioned, the verification equation can be calculated by any trusted third party, without the user's private information, and is public verifiability.The analysis results show that the proposed scheme has less computational overhead.In the aggregate verification stage, only two fixed bilinear mapping operations are used regardless of the number of senders, which effectively improves the operation efficiency.

Key words: Random Oracle Model(ROM), bilinear mapping, public verifiability, aggregate signcryption, certificateless

中图分类号: