Earticle

초록

영어

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.

목차

Abstract
 1. Introduction
 2. Preliminaries
  2.1. Bilinear Maps
  2.2. Outline of CLAS Schemes
  2.3. Complexity Assumption
  2.4. Security Model of CLAS schemes
 3. The Proposed CLAS Scheme
 4. Security Analysis
  4.1. Correctness
  4.2. Security Proof
 5. Comparison
 6. Conclusions
 Acknowledgements
 References

키워드

저자

• He Liu [ Institute of Information Science, Beijing Jiaotong University Beijing, 100044, P. R. China ]
• Sijia Wang [ Beijing Huada Infosec Technology Co.,Ltd Beijing, 100044, P. R. China ]
• Mangui Liang [ Institute of Information Science, Beijing Jiaotong University Beijing, 100044, P. R. China ]
• Yongqian Chen [ Institute of Information Science, Beijing Jiaotong University Beijing, 100044, P. R. China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Security and Its Applications

• 간기

  격월간

• pISSN

  1738-9976

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605