信息网络安全 ›› 2019, Vol. 19 ›› Issue (7): 42-49.doi: 10.3969/j.issn.1671-1122.2019.07.005

• • 上一篇    下一篇

基于离散对数的无证书聚合签密方案

胡荣磊, 李文敬(), 蒋华, 张昕然   

  1. 北京电子科技学院通信工程系,北京 100070
  • 收稿日期:2019-03-08 出版日期:2019-07-19 发布日期:2020-05-11
  • 作者简介:

    作者简介:胡荣磊(1977—),男,河北,副教授,博士,主要研究方向为通信与信息系统、信息安全;李文敬(1992—),女,山东,硕士研究生,主要研究方向为信息安全;蒋华(1962—),男,山西,教授,博士,主要研究方向为通信与信息安全;张昕然(1987—),男,黑龙江,讲师,博士,主要研究方向为无线信号处理、机器学习。

  • 基金资助:
    国家自然科学基金面上项目[61772047];中央高校基本科研业务费[2017LG-01]

Certificateless Aggregation Signcryption Scheme Based on Discrete Logarithm

Ronglei HU, Wenjing LI(), Hua JIANG, Xinran ZHANG   

  1. Department of Communication Engineering, Beijing Electronic Science & Technology Institute,Beijing 100070, China
  • Received:2019-03-08 Online:2019-07-19 Published:2020-05-11

摘要:

现有的无证书聚合签密方案大多需要进行复杂的双线性对运算,因而运算速率不理想。文章提出一种基于离散对数的无证书聚合签密方案,该方案无需双线性对参与,计算速率极大提高。与目前运行速率最快的聚合签密方案相比,该方案运算效率提高了5倍。经证明,该方案满足机密性和不可伪造性。同时,当双方对数据的真实性产生质疑时,任意可信第三方均可验证该数据的真实性。该方案同时满足安全性和高效性,可应用于物联网、车联网等网络环境中。

关键词: 无证书聚合签密, 离散对数, 随机预言模型, 机密性, 不可伪造性

Abstract:

Most of the existing certificateless aggregate signcryption schemes require complex bilinear pairing operations, so the operation rate is not ideal. In this paper, a certificateless aggregate signcryption scheme based on discrete logarithm is proposed. Because bilinear pairings are not needed, the computing speed is greatly improved. Compared with the fastest aggregate signcryption scheme at present, the operation efficiency of this scheme is improved by five times. It has been proved that the scheme satisfies confidentiality and unforgeability. At the same time, when both sides question the authenticity of the data, any trusted third party can verify the authenticity of the data. Because the scheme meets both security and efficiency, it can be applied to the internet of things, vehicle network and other network environments.

Key words: certificateless aggregation signcryption, discrete logarithm, random oracle model, confidentiality, unforgeability

中图分类号: