Revocable ID-based signature with short size over lattices

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

In the past, many ID-based signature (IBS) schemes based on the integer factorization or discrete logarithm problems were proposed.With the progress on the development of quantumtechnology, IBS schemesmentioned above would become vulnerable. Recently, several IBS schemes over lattices were proposed to be secure against attacks in the quantum era. As conventional publickey settings, ID-based public-key settings have to offer a revocationmechanism to revoke misbehaving ormalicious users.However, in the past, little work focuses on the revocation problem in the IBS schemes over lattices. In this article, we propose a new revocable IBS (RIBS) scheme with short size over lattices. Based on the short integer solution (SIS) assumption, we prove that the proposed RIBS scheme provides existential unforgeability against adaptive chosen-message attacks. As compared to the existing IBS schemes over lattices, our RIBS scheme has better performance in terms of signature size, signing key size, and the revocation mechanism with public channels.

Original languageEnglish
Article number7571201
JournalSecurity and Communication Networks
Volume2017
DOIs
Publication statusPublished - 2017 Jan 1

Fingerprint

Factorization

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Networks and Communications

Cite this

@article{f1d118ce64da464fa29e40cb3999c7d0,
title = "Revocable ID-based signature with short size over lattices",
abstract = "In the past, many ID-based signature (IBS) schemes based on the integer factorization or discrete logarithm problems were proposed.With the progress on the development of quantumtechnology, IBS schemesmentioned above would become vulnerable. Recently, several IBS schemes over lattices were proposed to be secure against attacks in the quantum era. As conventional publickey settings, ID-based public-key settings have to offer a revocationmechanism to revoke misbehaving ormalicious users.However, in the past, little work focuses on the revocation problem in the IBS schemes over lattices. In this article, we propose a new revocable IBS (RIBS) scheme with short size over lattices. Based on the short integer solution (SIS) assumption, we prove that the proposed RIBS scheme provides existential unforgeability against adaptive chosen-message attacks. As compared to the existing IBS schemes over lattices, our RIBS scheme has better performance in terms of signature size, signing key size, and the revocation mechanism with public channels.",
author = "Hung, {Ying Hao} and Yuh-Min Tseng and Sen-Shan Huang",
year = "2017",
month = "1",
day = "1",
doi = "10.1155/2017/7571201",
language = "English",
volume = "2017",
journal = "Security and Communication Networks",
issn = "1939-0114",
publisher = "John Wiley and Sons Inc.",

}

Revocable ID-based signature with short size over lattices. / Hung, Ying Hao; Tseng, Yuh-Min; Huang, Sen-Shan.

In: Security and Communication Networks, Vol. 2017, 7571201, 01.01.2017.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Revocable ID-based signature with short size over lattices

AU - Hung, Ying Hao

AU - Tseng, Yuh-Min

AU - Huang, Sen-Shan

PY - 2017/1/1

Y1 - 2017/1/1

N2 - In the past, many ID-based signature (IBS) schemes based on the integer factorization or discrete logarithm problems were proposed.With the progress on the development of quantumtechnology, IBS schemesmentioned above would become vulnerable. Recently, several IBS schemes over lattices were proposed to be secure against attacks in the quantum era. As conventional publickey settings, ID-based public-key settings have to offer a revocationmechanism to revoke misbehaving ormalicious users.However, in the past, little work focuses on the revocation problem in the IBS schemes over lattices. In this article, we propose a new revocable IBS (RIBS) scheme with short size over lattices. Based on the short integer solution (SIS) assumption, we prove that the proposed RIBS scheme provides existential unforgeability against adaptive chosen-message attacks. As compared to the existing IBS schemes over lattices, our RIBS scheme has better performance in terms of signature size, signing key size, and the revocation mechanism with public channels.

AB - In the past, many ID-based signature (IBS) schemes based on the integer factorization or discrete logarithm problems were proposed.With the progress on the development of quantumtechnology, IBS schemesmentioned above would become vulnerable. Recently, several IBS schemes over lattices were proposed to be secure against attacks in the quantum era. As conventional publickey settings, ID-based public-key settings have to offer a revocationmechanism to revoke misbehaving ormalicious users.However, in the past, little work focuses on the revocation problem in the IBS schemes over lattices. In this article, we propose a new revocable IBS (RIBS) scheme with short size over lattices. Based on the short integer solution (SIS) assumption, we prove that the proposed RIBS scheme provides existential unforgeability against adaptive chosen-message attacks. As compared to the existing IBS schemes over lattices, our RIBS scheme has better performance in terms of signature size, signing key size, and the revocation mechanism with public channels.

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

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

U2 - 10.1155/2017/7571201

DO - 10.1155/2017/7571201

M3 - Article

AN - SCOPUS:85018678435

VL - 2017

JO - Security and Communication Networks

JF - Security and Communication Networks

SN - 1939-0114

M1 - 7571201

ER -