Skip to main content
placeholder image

Certificateless signatures: New schemes and security models

Journal Article


Abstract


  • We present a study of security in certificateless signatures. We divide potential adversaries according to their attack power, and for the first time, three new kinds of adversaries are introduced into certificateless signatures. They are Normal Adversary, Strong Adversary and Super Adversary (ordered by their attack power). Combined with the known Type I Adversary and Type II Adversary in certificateless cryptography, we then define the security of certificateless signatures in different attack scenarios. Our new security models, together with others in the literature, provide a clear definition of the security in certificateless signatures. Two concrete schemes with different security levels are also proposed in this paper. The first scheme, which is proven secure (in the random oracle model) against Normal Type I and Super Type II adversaries, has the shortest signature length among all known certificateless signature schemes. The second scheme is secure (in the random oracle model) against Super Type I and Type II adversaries. Compared with another scheme that has a similar security level, our second scheme requires less operational cost but a little longer signature length. Two server-aided verification protocols are also proposed to reduce the verification cost on the verifier.

UOW Authors


  •   Huang, Xinyi (external author)
  •   Mu, Yi (external author)
  •   Susilo, Willy
  •   Wong, Duncan S. (external author)
  •   Wu, Wei (external author)

Publication Date


  • 2012

Citation


  • Huang, X., Mu, Y., Susilo, W., Wong, D. S. & Wu, W. (2012). Certificateless signatures: New schemes and security models. The Computer Journal, 55 (4), 457-474.

Scopus Eid


  • 2-s2.0-84859346464

Ro Metadata Url


  • http://ro.uow.edu.au/infopapers/1773

Number Of Pages


  • 17

Start Page


  • 457

End Page


  • 474

Volume


  • 55

Issue


  • 4

Abstract


  • We present a study of security in certificateless signatures. We divide potential adversaries according to their attack power, and for the first time, three new kinds of adversaries are introduced into certificateless signatures. They are Normal Adversary, Strong Adversary and Super Adversary (ordered by their attack power). Combined with the known Type I Adversary and Type II Adversary in certificateless cryptography, we then define the security of certificateless signatures in different attack scenarios. Our new security models, together with others in the literature, provide a clear definition of the security in certificateless signatures. Two concrete schemes with different security levels are also proposed in this paper. The first scheme, which is proven secure (in the random oracle model) against Normal Type I and Super Type II adversaries, has the shortest signature length among all known certificateless signature schemes. The second scheme is secure (in the random oracle model) against Super Type I and Type II adversaries. Compared with another scheme that has a similar security level, our second scheme requires less operational cost but a little longer signature length. Two server-aided verification protocols are also proposed to reduce the verification cost on the verifier.

UOW Authors


  •   Huang, Xinyi (external author)
  •   Mu, Yi (external author)
  •   Susilo, Willy
  •   Wong, Duncan S. (external author)
  •   Wu, Wei (external author)

Publication Date


  • 2012

Citation


  • Huang, X., Mu, Y., Susilo, W., Wong, D. S. & Wu, W. (2012). Certificateless signatures: New schemes and security models. The Computer Journal, 55 (4), 457-474.

Scopus Eid


  • 2-s2.0-84859346464

Ro Metadata Url


  • http://ro.uow.edu.au/infopapers/1773

Number Of Pages


  • 17

Start Page


  • 457

End Page


  • 474

Volume


  • 55

Issue


  • 4