Certificateless Signature with Strong Unforgeability in the Standard Model

Ying Hao Hung, Sen-Shan Huang, Yuh-Min Tseng, Tung Tso Tsai

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

Certificateless public-key systems (CL-PKS) were introduced to simultaneously solve two critical problems in public-key systems. One is the key escrow problem in ID-based public-key systems and the other is to eliminate the presence of certificates in conventional public-key systems. In the last decade, several certificateless signature (CLS) schemes have been proposed in the random oracle model. These CLS schemes possess existential unforgeability against adaptive chosen-message attacks, and only few of them possess strong unforgeability. A CLS scheme with strong unforgeability plays an important role in the construction of certificateless cryptographic schemes. Unfortunately, all the existing CLS schemes in the standard model (without random oracles) have been shown insecure to provide existential unforgeability under a generally adopted security model. In the article, we propose a strongly secure CLS scheme in the standard model under the generally adopted security model. Our scheme possesses not only existential unforgeability but also strong unforgeability, and turns out to be the first strongly secure CLS scheme in the standard model. Under the collision resistant hash (CRH) and computational Diffie-Hellman (CDH) assumptions, we prove that our CLS scheme possesses strong unforgeability against both Type I (outsiders) and Type II (key generation center) adversaries.

Original languageEnglish
Pages (from-to)663-684
Number of pages22
JournalInformatica (Netherlands)
Volume26
Issue number4
DOIs
Publication statusPublished - 2015 Mar 3

Fingerprint

Signature Scheme
Standard Model
Signature
Public key
Security Model
Random Oracle
Identity-based
Random Oracle Model
Diffie-Hellman
Certificate
Eliminate
Collision
Attack

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Applied Mathematics

Cite this

@article{a5682a8264d5403d82541f7c00239ebc,
title = "Certificateless Signature with Strong Unforgeability in the Standard Model",
abstract = "Certificateless public-key systems (CL-PKS) were introduced to simultaneously solve two critical problems in public-key systems. One is the key escrow problem in ID-based public-key systems and the other is to eliminate the presence of certificates in conventional public-key systems. In the last decade, several certificateless signature (CLS) schemes have been proposed in the random oracle model. These CLS schemes possess existential unforgeability against adaptive chosen-message attacks, and only few of them possess strong unforgeability. A CLS scheme with strong unforgeability plays an important role in the construction of certificateless cryptographic schemes. Unfortunately, all the existing CLS schemes in the standard model (without random oracles) have been shown insecure to provide existential unforgeability under a generally adopted security model. In the article, we propose a strongly secure CLS scheme in the standard model under the generally adopted security model. Our scheme possesses not only existential unforgeability but also strong unforgeability, and turns out to be the first strongly secure CLS scheme in the standard model. Under the collision resistant hash (CRH) and computational Diffie-Hellman (CDH) assumptions, we prove that our CLS scheme possesses strong unforgeability against both Type I (outsiders) and Type II (key generation center) adversaries.",
author = "Hung, {Ying Hao} and Sen-Shan Huang and Yuh-Min Tseng and Tsai, {Tung Tso}",
year = "2015",
month = "3",
day = "3",
doi = "10.15388/Informatica.2015.70",
language = "English",
volume = "26",
pages = "663--684",
journal = "Informatica",
issn = "0868-4952",
publisher = "IOS Press",
number = "4",

}

Certificateless Signature with Strong Unforgeability in the Standard Model. / Hung, Ying Hao; Huang, Sen-Shan; Tseng, Yuh-Min; Tsai, Tung Tso.

In: Informatica (Netherlands), Vol. 26, No. 4, 03.03.2015, p. 663-684.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Certificateless Signature with Strong Unforgeability in the Standard Model

AU - Hung, Ying Hao

AU - Huang, Sen-Shan

AU - Tseng, Yuh-Min

AU - Tsai, Tung Tso

PY - 2015/3/3

Y1 - 2015/3/3

N2 - Certificateless public-key systems (CL-PKS) were introduced to simultaneously solve two critical problems in public-key systems. One is the key escrow problem in ID-based public-key systems and the other is to eliminate the presence of certificates in conventional public-key systems. In the last decade, several certificateless signature (CLS) schemes have been proposed in the random oracle model. These CLS schemes possess existential unforgeability against adaptive chosen-message attacks, and only few of them possess strong unforgeability. A CLS scheme with strong unforgeability plays an important role in the construction of certificateless cryptographic schemes. Unfortunately, all the existing CLS schemes in the standard model (without random oracles) have been shown insecure to provide existential unforgeability under a generally adopted security model. In the article, we propose a strongly secure CLS scheme in the standard model under the generally adopted security model. Our scheme possesses not only existential unforgeability but also strong unforgeability, and turns out to be the first strongly secure CLS scheme in the standard model. Under the collision resistant hash (CRH) and computational Diffie-Hellman (CDH) assumptions, we prove that our CLS scheme possesses strong unforgeability against both Type I (outsiders) and Type II (key generation center) adversaries.

AB - Certificateless public-key systems (CL-PKS) were introduced to simultaneously solve two critical problems in public-key systems. One is the key escrow problem in ID-based public-key systems and the other is to eliminate the presence of certificates in conventional public-key systems. In the last decade, several certificateless signature (CLS) schemes have been proposed in the random oracle model. These CLS schemes possess existential unforgeability against adaptive chosen-message attacks, and only few of them possess strong unforgeability. A CLS scheme with strong unforgeability plays an important role in the construction of certificateless cryptographic schemes. Unfortunately, all the existing CLS schemes in the standard model (without random oracles) have been shown insecure to provide existential unforgeability under a generally adopted security model. In the article, we propose a strongly secure CLS scheme in the standard model under the generally adopted security model. Our scheme possesses not only existential unforgeability but also strong unforgeability, and turns out to be the first strongly secure CLS scheme in the standard model. Under the collision resistant hash (CRH) and computational Diffie-Hellman (CDH) assumptions, we prove that our CLS scheme possesses strong unforgeability against both Type I (outsiders) and Type II (key generation center) adversaries.

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

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

U2 - 10.15388/Informatica.2015.70

DO - 10.15388/Informatica.2015.70

M3 - Article

AN - SCOPUS:84960922831

VL - 26

SP - 663

EP - 684

JO - Informatica

JF - Informatica

SN - 0868-4952

IS - 4

ER -