A new provably secure certificateless short signature scheme

Kyu Young Choi, Jong Hwan Park, Dong Hoon Lee

Research output: Contribution to journalArticle

72 Citations (Scopus)

Abstract

Certificateless public key cryptography simplifies the complex certificate management in the traditional public key cryptography and resolves the key escrow problem in identity-based cryptography. In 2007, Huang et al. revisited the security models of certificateless signature scheme. They classified adversaries according to their attack power into normal, strong, and super adversaries (ordered by their attack power). Recently, Du and Wen proposed a short certificateless signature scheme and presented that their scheme is secure against the strong adversary in the random oracle model. In this paper, we show that their short signature scheme is insecure against the strong adversary. We then propose a new short certificateless signature scheme which is secure against the super adversary. Our scheme is the first certificateless signature scheme which satisfies both the strongest security level and the shortest signature length.

Original languageEnglish
Pages (from-to)1760-1768
Number of pages9
JournalComputers and Mathematics with Applications
Volume61
Issue number7
DOIs
Publication statusPublished - 2011 Apr 1

Fingerprint

Short Signature
Public key cryptography
Signature Scheme
Public Key Cryptography
Cryptography
Attack
Identity-based Cryptography
Security Model
Random Oracle Model
Certificate
Resolve
Simplify

Keywords

  • Bilinear maps
  • Certificateless signature
  • Short signature

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Modelling and Simulation
  • Computational Mathematics

Cite this

A new provably secure certificateless short signature scheme. / Choi, Kyu Young; Park, Jong Hwan; Lee, Dong Hoon.

In: Computers and Mathematics with Applications, Vol. 61, No. 7, 01.04.2011, p. 1760-1768.

Research output: Contribution to journalArticle

Choi, Kyu Young ; Park, Jong Hwan ; Lee, Dong Hoon. / A new provably secure certificateless short signature scheme. In: Computers and Mathematics with Applications. 2011 ; Vol. 61, No. 7. pp. 1760-1768.
@article{a2b7c4166c6047bc831ccd7bbd1a618a,
title = "A new provably secure certificateless short signature scheme",
abstract = "Certificateless public key cryptography simplifies the complex certificate management in the traditional public key cryptography and resolves the key escrow problem in identity-based cryptography. In 2007, Huang et al. revisited the security models of certificateless signature scheme. They classified adversaries according to their attack power into normal, strong, and super adversaries (ordered by their attack power). Recently, Du and Wen proposed a short certificateless signature scheme and presented that their scheme is secure against the strong adversary in the random oracle model. In this paper, we show that their short signature scheme is insecure against the strong adversary. We then propose a new short certificateless signature scheme which is secure against the super adversary. Our scheme is the first certificateless signature scheme which satisfies both the strongest security level and the shortest signature length.",
keywords = "Bilinear maps, Certificateless signature, Short signature",
author = "Choi, {Kyu Young} and Park, {Jong Hwan} and Lee, {Dong Hoon}",
year = "2011",
month = "4",
day = "1",
doi = "10.1016/j.camwa.2011.02.003",
language = "English",
volume = "61",
pages = "1760--1768",
journal = "Computers and Mathematics with Applications",
issn = "0898-1221",
publisher = "Elsevier Limited",
number = "7",

}

TY - JOUR

T1 - A new provably secure certificateless short signature scheme

AU - Choi, Kyu Young

AU - Park, Jong Hwan

AU - Lee, Dong Hoon

PY - 2011/4/1

Y1 - 2011/4/1

N2 - Certificateless public key cryptography simplifies the complex certificate management in the traditional public key cryptography and resolves the key escrow problem in identity-based cryptography. In 2007, Huang et al. revisited the security models of certificateless signature scheme. They classified adversaries according to their attack power into normal, strong, and super adversaries (ordered by their attack power). Recently, Du and Wen proposed a short certificateless signature scheme and presented that their scheme is secure against the strong adversary in the random oracle model. In this paper, we show that their short signature scheme is insecure against the strong adversary. We then propose a new short certificateless signature scheme which is secure against the super adversary. Our scheme is the first certificateless signature scheme which satisfies both the strongest security level and the shortest signature length.

AB - Certificateless public key cryptography simplifies the complex certificate management in the traditional public key cryptography and resolves the key escrow problem in identity-based cryptography. In 2007, Huang et al. revisited the security models of certificateless signature scheme. They classified adversaries according to their attack power into normal, strong, and super adversaries (ordered by their attack power). Recently, Du and Wen proposed a short certificateless signature scheme and presented that their scheme is secure against the strong adversary in the random oracle model. In this paper, we show that their short signature scheme is insecure against the strong adversary. We then propose a new short certificateless signature scheme which is secure against the super adversary. Our scheme is the first certificateless signature scheme which satisfies both the strongest security level and the shortest signature length.

KW - Bilinear maps

KW - Certificateless signature

KW - Short signature

UR - http://www.scopus.com/inward/record.url?scp=79952987257&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79952987257&partnerID=8YFLogxK

U2 - 10.1016/j.camwa.2011.02.003

DO - 10.1016/j.camwa.2011.02.003

M3 - Article

VL - 61

SP - 1760

EP - 1768

JO - Computers and Mathematics with Applications

JF - Computers and Mathematics with Applications

SN - 0898-1221

IS - 7

ER -