Journal of Computer Applications ›› 2018, Vol. 38 ›› Issue (2): 374-378.DOI: 10.11772/j.issn.1001-9081.2017081984

Previous Articles     Next Articles

Efficient certificateless aggregate signcryption scheme without bilinear pairings

SU Jingfeng1, LIU Juxia2   

  1. 1. School of Computer and Data Science, Henan University of Urban Construction, Pingdingshan Henan 467036, China;
    2. Academy of Information Technology, Luoyang Normal University, Luoyang Henan 471934, China
  • Received:2017-08-16 Revised:2017-10-17 Online:2018-02-10 Published:2018-02-10
  • Supported by:
    This work is partially supported by the National Natural Science Foundation of China (61602232), the Natural Science Foundation of Henan Province (112300410192), the Scientific Research Ability Promotion Program of Henan University of Urban Construction (2016YY21).


苏靖枫1, 柳菊霞2   

  1. 1. 河南城建学院 计算机与数据科学学院, 河南 平顶山 467036;
    2. 洛阳师范学院 信息技术学院, 河南 洛阳 471934
  • 通讯作者: 苏靖枫
  • 作者简介:苏靖枫(1978-),男,河南永城人,讲师,硕士,主要研究方向:密码学、信息安全;柳菊霞(1980-),女,河南驻马店人,讲师,硕士,主要研究方向:密码学、信息安全。
  • 基金资助:

Abstract: Most of the current aggregate signcryption schemes based on bilinear pairings have low computational efficiency, thus they are not suitable for the application environment with limited computing resources and communication bandwidth. In order to improve the efficiency of aggregate signcryption, a new certificateless aggregate signcryption scheme without bilinear pairings was proposed. Based on Diffie-Hellman problem and Discrete Logarithm Problem (DLP), it was proven to be existentially unforgeable and confidential under the random oracle model. Compared with the current typical aggregation signcryption schemes, the proposed scheme has not bilinear pairings and exponential computation, and only needs two point multiplications in the single signcryption. Therefore, it has higher efficiency and shorter length of ciphertext. In the aggregate signcryption verification phase, there is no need to provide any user's secret information, so the proposed scheme has the public verifiability property. In addition, the proposed scheme does not need a secure channel in the partial private key generation phase, which reduces communication complexity.

Key words: signcryption, aggregate signcryption, certificateless, public verifiability, random oracle model

摘要: 现有的聚合签密方案主要是基于复杂的双线性对构造,计算效率较低,不能很好地适用于计算资源和通信带宽受限的应用环境。为了提高聚合签密的效率,提出一种不含双线性对映射的无证书聚合签密方案。基于计算Diffie-Hellman问题(CDHP)和离散对数问题(DLP)的困难性,在随机预言模型下证明了方案满足机密性和不可伪造性。该方案不含双线性对运算和指数运算,在单签密阶段仅需要2个点乘运算,与已有的典型聚合签密方案相比具有更高的计算效率且密文长度更短;而且方案的聚合签密验证阶段无需任何用户的秘密信息,方案具有可公开验证性;此外,方案在部分私钥生成阶段不需要安全信道,降低了通信复杂度。

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

CLC Number: