New Construction of Efficient Certificateless Aggregate Signatures
This paper proposes a novel construction of efficient certificateless aggregate signature (CLAS) scheme.On basis of the computational Diffie-Hellman (CDH) assumption,the proposed scheme can be proven existentially unforgeable against adaptive chosen-message attacks.The new scheme also requires small constant pairing computations for aggregate verification,which is independent of the number of signers.Most importantly,a certain synchronization for aggregating randomness can be avoided by the proposed scheme.All the signers don”t need to share the same synchronized clock to generate the aggregate signature,which greatly decreases the implementation complexity in many application scenarios.
provably secure aggregate signature certificateless cryptography authentication
He Liu Sijia Wang Mangui Liang Yongqian Chen
Institute of Information Science, Beijing Jiaotong University Beijing, 100044, P. R. China Beijing Huada Infosec Technology Co.,Ltd Beijing, 100044, P. R. China
国内会议
中国电机工程学会电力通信专业委员会业务网及应用系统学组学术会议
深圳
英文
6-17
2015-09-21(万方平台首次上网日期,不代表论文的发表时间)