摘要
现有的无证书聚合签密方案大多需要进行复杂的双线性对运算,因而运算速率不理想。文章提出一种基于离散对数的无证书聚合签密方案,该方案无需双线性对参与,计算速率极大提高。与目前运行速率最快的聚合签密方案相比,该方案运算效率提高了 5倍。经证明,该方案满足机密性和不可伪造性。同时,当双方对数据的真实性产生质疑时,任意可信第三方均可验证该数据的真实性。该方案同时满足安全性和高效性,可应用于物联网、车联网等网络环境中。
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.
作者
胡荣磊
李文敬
蒋华
张昕然
HU Ronglei;LI Wenjing;JIANG Hua;ZHANG Xinran(Department of Communication Engineering,Beijing Electronic Science&Technology Institute,Beijing 100070,China)
出处
《信息网络安全》
CSCD
北大核心
2019年第7期42-49,共8页
Netinfo Security
基金
国家自然科学基金面上项目[61772047]
中央高校基本科研业务费[2017LG-01]
关键词
无证书聚合签密
离散对数
随机预言模型
机密性
不可伪造性
certificateless aggregation signcryption
discrete logarithm
random oracle model
confidentiality
unforgeability
