A revocable certificateless short signature scheme and its authentication application

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

Certificateless short signature (CLSS) possesses the advantages of both certificateless signature and short signature. CLSS eliminates the certificate management in conventional signatures and solves the key escrow problem in ID-based signatures. In the meantime, due to its short signature length, CLSS reduces the bandwidth for communication so that it is suitable for some specific authentication applications requiring bandwidth-constrained communication environments. However, up to now, there is no work on studying the revocation problem in existing CLSS schemes. In this article, we address the revocation problem and propose the first revocable certificateless short signature (RCLSS) scheme. Based on the computational Diffie-Hellman (CDH) assumption, we demonstrate that our RCLSS scheme possesses strong unforgeability against adaptive chosen-message attacks under an accredited security model. It turns out that our scheme has the shortest signature length while retaining computational efficiency. Thus, the proposed RCLSS scheme is well suited for low-bandwidth communication environments. Finally, we combine the proposed RCLSS scheme with cloud revocation authority (CRA) to present a CRA-aided authentication scheme with period-limited privileges for mobile multi-server environment.

Original languageEnglish
Pages (from-to)549-572
Number of pages24
JournalInformatica (Netherlands)
Volume27
Issue number3
DOIs
Publication statusPublished - 2016 Jan 1

Fingerprint

Short Signature
Signature Scheme
Authentication
Bandwidth
Communication
Revocation
Computational efficiency
Servers
Signature
Multi-server
Security Model
Identity-based
Diffie-Hellman
Certificate
Computational Efficiency
Eliminate

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Applied Mathematics

Cite this

@article{771ebfd96e454c7998924099ec7bfcd4,
title = "A revocable certificateless short signature scheme and its authentication application",
abstract = "Certificateless short signature (CLSS) possesses the advantages of both certificateless signature and short signature. CLSS eliminates the certificate management in conventional signatures and solves the key escrow problem in ID-based signatures. In the meantime, due to its short signature length, CLSS reduces the bandwidth for communication so that it is suitable for some specific authentication applications requiring bandwidth-constrained communication environments. However, up to now, there is no work on studying the revocation problem in existing CLSS schemes. In this article, we address the revocation problem and propose the first revocable certificateless short signature (RCLSS) scheme. Based on the computational Diffie-Hellman (CDH) assumption, we demonstrate that our RCLSS scheme possesses strong unforgeability against adaptive chosen-message attacks under an accredited security model. It turns out that our scheme has the shortest signature length while retaining computational efficiency. Thus, the proposed RCLSS scheme is well suited for low-bandwidth communication environments. Finally, we combine the proposed RCLSS scheme with cloud revocation authority (CRA) to present a CRA-aided authentication scheme with period-limited privileges for mobile multi-server environment.",
author = "Hung, {Ying Hao} and Yuh-Min Tseng and Sen-Shan Huang",
year = "2016",
month = "1",
day = "1",
doi = "10.15388/Informatica.2016.99",
language = "English",
volume = "27",
pages = "549--572",
journal = "Informatica",
issn = "0868-4952",
publisher = "IOS Press",
number = "3",

}

A revocable certificateless short signature scheme and its authentication application. / Hung, Ying Hao; Tseng, Yuh-Min; Huang, Sen-Shan.

In: Informatica (Netherlands), Vol. 27, No. 3, 01.01.2016, p. 549-572.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A revocable certificateless short signature scheme and its authentication application

AU - Hung, Ying Hao

AU - Tseng, Yuh-Min

AU - Huang, Sen-Shan

PY - 2016/1/1

Y1 - 2016/1/1

N2 - Certificateless short signature (CLSS) possesses the advantages of both certificateless signature and short signature. CLSS eliminates the certificate management in conventional signatures and solves the key escrow problem in ID-based signatures. In the meantime, due to its short signature length, CLSS reduces the bandwidth for communication so that it is suitable for some specific authentication applications requiring bandwidth-constrained communication environments. However, up to now, there is no work on studying the revocation problem in existing CLSS schemes. In this article, we address the revocation problem and propose the first revocable certificateless short signature (RCLSS) scheme. Based on the computational Diffie-Hellman (CDH) assumption, we demonstrate that our RCLSS scheme possesses strong unforgeability against adaptive chosen-message attacks under an accredited security model. It turns out that our scheme has the shortest signature length while retaining computational efficiency. Thus, the proposed RCLSS scheme is well suited for low-bandwidth communication environments. Finally, we combine the proposed RCLSS scheme with cloud revocation authority (CRA) to present a CRA-aided authentication scheme with period-limited privileges for mobile multi-server environment.

AB - Certificateless short signature (CLSS) possesses the advantages of both certificateless signature and short signature. CLSS eliminates the certificate management in conventional signatures and solves the key escrow problem in ID-based signatures. In the meantime, due to its short signature length, CLSS reduces the bandwidth for communication so that it is suitable for some specific authentication applications requiring bandwidth-constrained communication environments. However, up to now, there is no work on studying the revocation problem in existing CLSS schemes. In this article, we address the revocation problem and propose the first revocable certificateless short signature (RCLSS) scheme. Based on the computational Diffie-Hellman (CDH) assumption, we demonstrate that our RCLSS scheme possesses strong unforgeability against adaptive chosen-message attacks under an accredited security model. It turns out that our scheme has the shortest signature length while retaining computational efficiency. Thus, the proposed RCLSS scheme is well suited for low-bandwidth communication environments. Finally, we combine the proposed RCLSS scheme with cloud revocation authority (CRA) to present a CRA-aided authentication scheme with period-limited privileges for mobile multi-server environment.

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

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

U2 - 10.15388/Informatica.2016.99

DO - 10.15388/Informatica.2016.99

M3 - Article

VL - 27

SP - 549

EP - 572

JO - Informatica

JF - Informatica

SN - 0868-4952

IS - 3

ER -