Certificateless Aggregation Signcryption Scheme Based on Discrete Logarithm

doi:10.3969/j.issn.1671-1122.2019.07.005

Abstract

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

CLC Number:

TP309

Ronglei HU, Wenjing LI, Hua JIANG, Xinran ZHANG. Certificateless Aggregation Signcryption Scheme Based on Discrete Logarithm[J]. Netinfo Security, 2019, 19(7): 42-49.

Figures/Tables 2

References 17

[1]	ZHENG Yuliang.Digital Signcryption or How to Achieve Cost(Signature & Encryption) << Cost(Signature) + Cost(Encryption)[C]//Springer. 17th Annual International Cryptology Conference on Advances in Cryptology, August 17-21, 1997, Santa Barbara, CA, USA. Heidelberg: Springer, 1997: 165-179.
[2]	CHEN Liqun, MALONE-LEE J.Improved Identity-based Signcryption[C]//Springer. 8th International Conference on Theory and Practice in Public Key Cryptography, January 23-26, 2005, Les Diablerets, Switzerland. Heidelberg: Springer, 2005: 362-379.
[3]	HWANG Y H, LIU J K, CHOW S S M. Certificateless Public Key Encryption Secure against Malicious KGC Attacks in the Standard Model[J]. Journal of Universal Computer Science, 2008, 3(3): 463-480.
[4]	XIANG Shunbo.Provably Secure ID-based Generalized Signcryption Scheme[J]. Netinfo Security, 2013, 13(1): 58-60.
	项顺伯. 可证安全的基于身份的广义签密方案[J]. 信息网络安全,2013,13(1):58-60.
[5]	DU Qingling.Identity Based Dynamic Group Communication Signcryption Scheme[J]. Netinfo Security, 2017, 17(9): 42-44.
	杜庆灵. 基于身份的动态群通信签密方案[J]. 信息网络安全,2017,17(9):42-44.
[6]	LU Haijun, XIE Qi.An Efficient Certificateless Aggregate Signcryption Scheme from Pairings[C]//IEEE. 2011 International Conference on Electronics, Communications and Control, September 9-11, 2011, Ningbo, China. New Jersey: IEEE, 2011: 132-135.
[7]	HAN Yiliang, LU Wanyi, YANG X.IBASC: Identity Based Aggregate Signcryption Scheme with Public Verifiability[J]. ICIC Express Letters, 2013, 7(7): 2075-2080
[8]	ZHAO Na, LONG Hui, SU Jinshu.A Scheme for Anonymous Authentication and Privacy Protection in the Internet of Things Environment[J]. Netinfo Security, 2018, 18(11): 1-7.
	赵娜,龙慧,苏金树. 一种适用于物联网环境的匿名认证与隐私保护方案[J]. 信息网络安全,2018,18(11):1-7.
[9]	SAKUMOTO K, SHIRAI T, HIWATARI H.On Provable Security of UOV and HFE Signature Schemes against Chosen-message Attack[C]//Springer. 4th International Workshop on Post-quantum Cryptography, November 29-December 2, 2011, Taipei, Taiwan, China. Heidelberg: Springer, 2011: 68-82.
[10]	NIU Shufen, LI Zhenbin, WANG Caifen.Privacy-preserving Multi-party Aggregate Signcryption for Heterogeneous Systems[C]//Springer. 2017 International Conference on Cloud Computing and Security, June 16-18, 2017, Nanjing, China. Heidelberg: Springer, 2017: 216-229.
[11]	KAR J.Provably Secure Identity-based Aggregate Signcryption Scheme in Random Oracles[J]. International Journal of Network Security, 2015, 17(5): 580-587.
[12]	CAO Suzhen, LANG Xiaoli, LIU Xiangzhen, et al.New Heterogeneous Signcryption Scheme under 5G Network[J]. Netinfo Security, 2018, 18(11): 33-39.
	曹素珍,郎晓丽,刘祥震,等. 5G网络下新的异构签密方案[J]. 信息网络安全,2018,18(11):33-39.
[13]	NIU Shufen, NIU Ling, WANG Caifen, et al.A Provable Aggregate Signcryption for Heterogeneous Systems[J]. Journal of Electronics & Information Technology, 2017, 39(5): 1213-1218.
	牛淑芬,牛灵,王彩芬,等. 一种可证安全的异构聚合签密方案[J].电子与信息学报,2017,39(5):1213-1218.
[14]	AMADORI A, PINTORE F, SALA M. On the Discrete Logarithm Problem for Prime-field Elliptic Curves[EB/OL]. , 2018-11-11.
[15]	CHEN Hong, ZHAO Yue, XIAO Chenglong, et al. Certificateless Signcryption Scheme of Verifiable Security without Pairing[EB/OL]. .
	陈虹,赵悦,肖成龙,等.可证安全的无对运算的无证书签密方案[EB/OL].
[16]	POINTCHEVAL D, STERN J.Security Arguments for Digital Signatures and Blind Signatures[J]. Journal of Cryptology, 2000, 13(3): 361-396.
[17]	DENG Lunzhi, ZENG Jiwen, QU Yunyun.Certificateless Proxy Signature from RSA[J]. Mathematical Problems in Engineering, 2014(9): 1-10.

方案	签密	解签密	运算总量
文献[10]	ne+np+4ns	ne+(n+1)p+ns	2ne+(2n+1)p+5ns
文献[11]	np+2ns	np+ns	2np+3ns
文献[13]	ne+4ns	(n+2)p+ns	ne+(n+2)p+5ns
本文方案	3(n+1)s	4ns	(7n+1)s

方案	非聚合密文长度	聚合密文长度
文献[10]	n(\|m\|+2\|G₁\|+G)	n(\|m\|+2\|G₁\|+G)
文献[11]	n(\|m\|+\|Z^_q*\|+2\|G₁\|)	n(\|m\|+\|Z^_q*\|+\|G₁\|)+\|G₁\|
文献[13]	n(\|m\|+2\|G₁\|)	n(\|m\|+\|G\|+G)
本文方案	n(\|m\|+\|G\|)	n(\|m\|+\|G\|)