Identity-based proxy signature from lattices

Kee Sung Kim, Dowon Hong, ik rae Jeong

Research output: Contribution to journalArticle

23 Citations (Scopus)

Abstract

Most of the provably-secure proxy signature schemes rely on the average-case hardness problems such as the integer factorization problems and the discrete logarithm problems. Therefore, those schemes are insecure to quantum analysis algorithms, since there exist quantum algorithms efficiently solving the factorization and logarithm problems. To make secure proxy signature schemes against quantum analysis, some lattice-based proxy signature schemes are suggested. However, none of the suggested latticebased proxy signature schemes is proxy-protected in the adaptive security model. In the paper, we propose a provably-secure IDbased proxy signature scheme based on the lattice problems. Our scheme is proxy-protected in the adaptive security model.

Original languageEnglish
Pages (from-to)1-7
Number of pages7
JournalJournal of Communications and Networks
Volume15
Issue number1
DOIs
Publication statusPublished - 2013 Feb 1

Fingerprint

Factorization
Hardness

Keywords

  • Delegation-by-warrant
  • ID-based
  • Lattice-based
  • Proxy-protected

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

Identity-based proxy signature from lattices. / Kim, Kee Sung; Hong, Dowon; Jeong, ik rae.

In: Journal of Communications and Networks, Vol. 15, No. 1, 01.02.2013, p. 1-7.

Research output: Contribution to journalArticle

Kim, Kee Sung ; Hong, Dowon ; Jeong, ik rae. / Identity-based proxy signature from lattices. In: Journal of Communications and Networks. 2013 ; Vol. 15, No. 1. pp. 1-7.
@article{0fa77dd70aac4a31af0c63222faf7d5e,
title = "Identity-based proxy signature from lattices",
abstract = "Most of the provably-secure proxy signature schemes rely on the average-case hardness problems such as the integer factorization problems and the discrete logarithm problems. Therefore, those schemes are insecure to quantum analysis algorithms, since there exist quantum algorithms efficiently solving the factorization and logarithm problems. To make secure proxy signature schemes against quantum analysis, some lattice-based proxy signature schemes are suggested. However, none of the suggested latticebased proxy signature schemes is proxy-protected in the adaptive security model. In the paper, we propose a provably-secure IDbased proxy signature scheme based on the lattice problems. Our scheme is proxy-protected in the adaptive security model.",
keywords = "Delegation-by-warrant, ID-based, Lattice-based, Proxy-protected",
author = "Kim, {Kee Sung} and Dowon Hong and Jeong, {ik rae}",
year = "2013",
month = "2",
day = "1",
doi = "10.1109/JCN.2013.000003",
language = "English",
volume = "15",
pages = "1--7",
journal = "Journal of Communications and Networks",
issn = "1229-2370",
publisher = "Korean Institute of Communication Sciences",
number = "1",

}

TY - JOUR

T1 - Identity-based proxy signature from lattices

AU - Kim, Kee Sung

AU - Hong, Dowon

AU - Jeong, ik rae

PY - 2013/2/1

Y1 - 2013/2/1

N2 - Most of the provably-secure proxy signature schemes rely on the average-case hardness problems such as the integer factorization problems and the discrete logarithm problems. Therefore, those schemes are insecure to quantum analysis algorithms, since there exist quantum algorithms efficiently solving the factorization and logarithm problems. To make secure proxy signature schemes against quantum analysis, some lattice-based proxy signature schemes are suggested. However, none of the suggested latticebased proxy signature schemes is proxy-protected in the adaptive security model. In the paper, we propose a provably-secure IDbased proxy signature scheme based on the lattice problems. Our scheme is proxy-protected in the adaptive security model.

AB - Most of the provably-secure proxy signature schemes rely on the average-case hardness problems such as the integer factorization problems and the discrete logarithm problems. Therefore, those schemes are insecure to quantum analysis algorithms, since there exist quantum algorithms efficiently solving the factorization and logarithm problems. To make secure proxy signature schemes against quantum analysis, some lattice-based proxy signature schemes are suggested. However, none of the suggested latticebased proxy signature schemes is proxy-protected in the adaptive security model. In the paper, we propose a provably-secure IDbased proxy signature scheme based on the lattice problems. Our scheme is proxy-protected in the adaptive security model.

KW - Delegation-by-warrant

KW - ID-based

KW - Lattice-based

KW - Proxy-protected

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

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

U2 - 10.1109/JCN.2013.000003

DO - 10.1109/JCN.2013.000003

M3 - Article

AN - SCOPUS:84875443029

VL - 15

SP - 1

EP - 7

JO - Journal of Communications and Networks

JF - Journal of Communications and Networks

SN - 1229-2370

IS - 1

ER -