Earticle

초록

영어

Aggregate signatures allow n signatures on n distinct messages from n distinct signers to be aggregated into a single signature that convinces any verifier that n signers do indeed sign the n messages, respectively. The major advantage of utilizing aggregate signatures is to address the security of data and save bandwidth and computations in sensor networks. Recently, people discuss aggregate signature in certificateless public key setting. But some existing certificateless aggregate signature schemes are not secure. In this paper, we analyze the security of Zhang et al.’s certificateless aggregate signature schemes, and propose a new ew ew certificateless aggregate signature schemes, and prove the new scheme is existentially unforgeable under adaptive chosen-message attacks under the assumption that computational Diffie–Hellman problem is hard. Furthermore, in signing equation of the proposed scheme user’s partial private key and secret value are directly combined with the signed message. So, the scheme is also secure against some inside forgery attack.

목차

Abstract
 1. Introduction
 2. Preliminaries
  2.1 Bilinear Maps and Complexity Assumption
  2.2 Definition of Certificateless Aggregate Signature Schemes
  2.3 Security Model of Certificateless Aggregate Signature Schemes
 3. The Security of Zhang et al. Certificateless Aggregate SignatureScheme
  3.1 Brief review of Zhang et al.’s Scheme
  3.2 Attack on Zhang et al.’s Scheme
 4. A New Certificateless Aggregate Signature Scheme
 5. Security Proof
 6. Conclusion
 Acknowledgements
 References

키워드

저자

• Baoyuan Kang [ School of Computer science and software Tianjin polytechnic university, Tianjin, 300387, China ]
• Danhui Xu [ School of Computer science and software Tianjin polytechnic university, Tianjin, 300387, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Security and Its Applications

• 간기

  격월간

• pISSN

  1738-9976

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605