Lattice-based revocable certificateless signature

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Certificateless signatures (CLS) are noticeable because they may resolve the key escrow problem in ID-based signatures and break away the management problem regarding certificate in conventional signatures. However, the security of the mostly previous CLS schemes relies on the difficulty of solving discrete logarithm or large integer factorization problems. These two problems would be solved by quantum computers in the future so that the signature schemes based on them will also become insecure. For post-quantum cryptography, lattice-based cryptography is significant due to its efficiency and security. However, no study on addressing the revocation problem in the existing lattice-based CLS schemes is presented. In this paper, we focus on the revocation issue and present the first revocable CLS (RCLS) scheme over lattices. Based on the short integer solution (SIS) assumption over lattices, the proposed lattice-based RCLS scheme is shown to be existential unforgeability against adaptive chosen message attacks. By performance analysis and comparisons, the proposed lattice-based RCLS scheme is better than the previously proposed lattice-based CLS scheme, in terms of private key size, signature length and the revocation mechanism.

Original languageEnglish
Article number242
JournalSymmetry
Volume9
Issue number10
DOIs
Publication statusPublished - 2017 Jan 1

Fingerprint

Quantum cryptography
Quantum computers
Factorization
Cryptography
Signature
Signature Scheme
signatures
Revocation
Integer Factorization
integers
Quantum Cryptography
Discrete Logarithm
Quantum Computer
Identity-based
Performance Comparison
Certificate
cryptography
boundary layer separation
quantum cryptography
quantum computers

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)
  • Chemistry (miscellaneous)
  • Mathematics(all)
  • Physics and Astronomy (miscellaneous)

Cite this

@article{7fb01814dcf94f6699fa276bffc345b2,
title = "Lattice-based revocable certificateless signature",
abstract = "Certificateless signatures (CLS) are noticeable because they may resolve the key escrow problem in ID-based signatures and break away the management problem regarding certificate in conventional signatures. However, the security of the mostly previous CLS schemes relies on the difficulty of solving discrete logarithm or large integer factorization problems. These two problems would be solved by quantum computers in the future so that the signature schemes based on them will also become insecure. For post-quantum cryptography, lattice-based cryptography is significant due to its efficiency and security. However, no study on addressing the revocation problem in the existing lattice-based CLS schemes is presented. In this paper, we focus on the revocation issue and present the first revocable CLS (RCLS) scheme over lattices. Based on the short integer solution (SIS) assumption over lattices, the proposed lattice-based RCLS scheme is shown to be existential unforgeability against adaptive chosen message attacks. By performance analysis and comparisons, the proposed lattice-based RCLS scheme is better than the previously proposed lattice-based CLS scheme, in terms of private key size, signature length and the revocation mechanism.",
author = "Hung, {Ying Hao} and Yuh-Min Tseng and Sen-Shan Huang",
year = "2017",
month = "1",
day = "1",
doi = "10.3390/sym9100242",
language = "English",
volume = "9",
journal = "Symmetry",
issn = "2073-8994",
publisher = "Multidisciplinary Digital Publishing Institute (MDPI)",
number = "10",

}

Lattice-based revocable certificateless signature. / Hung, Ying Hao; Tseng, Yuh-Min; Huang, Sen-Shan.

In: Symmetry, Vol. 9, No. 10, 242, 01.01.2017.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Lattice-based revocable certificateless signature

AU - Hung, Ying Hao

AU - Tseng, Yuh-Min

AU - Huang, Sen-Shan

PY - 2017/1/1

Y1 - 2017/1/1

N2 - Certificateless signatures (CLS) are noticeable because they may resolve the key escrow problem in ID-based signatures and break away the management problem regarding certificate in conventional signatures. However, the security of the mostly previous CLS schemes relies on the difficulty of solving discrete logarithm or large integer factorization problems. These two problems would be solved by quantum computers in the future so that the signature schemes based on them will also become insecure. For post-quantum cryptography, lattice-based cryptography is significant due to its efficiency and security. However, no study on addressing the revocation problem in the existing lattice-based CLS schemes is presented. In this paper, we focus on the revocation issue and present the first revocable CLS (RCLS) scheme over lattices. Based on the short integer solution (SIS) assumption over lattices, the proposed lattice-based RCLS scheme is shown to be existential unforgeability against adaptive chosen message attacks. By performance analysis and comparisons, the proposed lattice-based RCLS scheme is better than the previously proposed lattice-based CLS scheme, in terms of private key size, signature length and the revocation mechanism.

AB - Certificateless signatures (CLS) are noticeable because they may resolve the key escrow problem in ID-based signatures and break away the management problem regarding certificate in conventional signatures. However, the security of the mostly previous CLS schemes relies on the difficulty of solving discrete logarithm or large integer factorization problems. These two problems would be solved by quantum computers in the future so that the signature schemes based on them will also become insecure. For post-quantum cryptography, lattice-based cryptography is significant due to its efficiency and security. However, no study on addressing the revocation problem in the existing lattice-based CLS schemes is presented. In this paper, we focus on the revocation issue and present the first revocable CLS (RCLS) scheme over lattices. Based on the short integer solution (SIS) assumption over lattices, the proposed lattice-based RCLS scheme is shown to be existential unforgeability against adaptive chosen message attacks. By performance analysis and comparisons, the proposed lattice-based RCLS scheme is better than the previously proposed lattice-based CLS scheme, in terms of private key size, signature length and the revocation mechanism.

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

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

U2 - 10.3390/sym9100242

DO - 10.3390/sym9100242

M3 - Article

AN - SCOPUS:85058392653

VL - 9

JO - Symmetry

JF - Symmetry

SN - 2073-8994

IS - 10

M1 - 242

ER -