CAJ | 학술논문

聚合签名通过聚合n个签名(n个不同签名者对n个不同消息生成)为一个签名，节省带宽和提高签名验证效率。无证书公钥密码体制解决了传统公钥密码体制中的证书管理问题以及基于身份密码体制中的密钥托管问题。该文基于双线性对提出一个新的高效的无证书聚合签名方案。分析表明，在随机预言机模型中计算性Diffie-Hellman假设下，所提方案能够抵抗适应性选择消息攻击下的存在性伪造攻击，同时所提方案签名长度独立于签名者的数量仅为2个群元素，签名验证中仅需要4个对和n个标量乘运算，因此该方案更加适合资源受限网络环境中的应用。
취합첨명통과취합n개첨명(n개불동첨명자대n개불동소식생성)위일개첨명，절성대관화제고첨명험증효솔。무증서공약밀마체제해결료전통공약밀마체제중적증서관리문제이급기우신빈밀마체제중적밀약탁관문제。해문기우쌍선성대제출일개신적고효적무증서취합첨명방안。분석표명，재수궤예언궤모형중계산성Diffie-Hellman가설하，소제방안능구저항괄응성선택소식공격하적존재성위조공격，동시소제방안첨명장도독립우첨명자적수량부위2개군원소，첨명험증중부수요4개대화n개표량승운산，인차해방안경가괄합자원수한망락배경중적응용。
Aggregate signatures allow an efficient algorithm to aggregate n signatures of n distinct messages from n different signers into one single signature. Aggregate signature is useful to save bandwidth and improve the efficiency in verification phase. Certificateless public key cryptography overcomes the complicated certificate management in traditional public key cryptography and key escrow problem in identity based cryptography. In this paper, we present a new efficient certificateless aggregate signature scheme based on the bilinear pairing. The analysis shows that the proposed scheme is proven existentially unforgeable against adaptive chosen message attacks under the computational Diffie-Hellman assumption in the random oracle model. The signature length is only two group elements, which is independent of the number of signers, and the signature needs only four pairings and n scalar multiplications computations in verification phase. Thus, the proposed scheme is more suitable for the applications, in resource-constrained environment.