首页|Attack on an Efficient Certificateless Aggregate Signature without Pairing
Attack on an Efficient Certificateless Aggregate Signature without Pairing
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
万方数据
维普
A Certificateless Aggregate Signature (CLAS) scheme was proposed by Qu and Mu recently,which was published in "Int.J.Electronic Security and Digital Forensics,2018,10 (2)".They used discrete logarithm to ensure the scheme's security.However,we show by formulating an attack that their CLAS scheme cannot defend against Type I adversary.Furthermore,we point out an error that exists in the signature simulation of their security proof.After that we give a correct signature simulation for the security proof.Finally,to resist the Type Ⅰ attack,we present two methods for improving Qu et al's CLAS scheme.Moreover,the second improving method can elevate the trust level of Qu et al's CLAS scheme to the highest trust level:Level 3.
certificatelessaggregate signatureattacksecurityrandom oracle modeldiscrete logarithm problem
LI Huimin、LIANG Hongmei、WANG Haimin、ZHANG Jinhui
展开 >
School of Mathematics and Finance, Putian University ,Putian 351100, Fujian, China
Key Laboratory of Applied Mathematics, Fujian Province University(Putian University), Putian 351100, Fujian, China
School of Mathematics and Statistics, Minnan Normal University, Zhangzhou 363000, Fujian, China
Supported by the National Natural Science Foundation of China (61373140,61170246),the Program for Innovative Research Team in Sc
NETL
NSTL
万方数据
维普
