A Digital Signature Scheme Based on NP-Complete Lattice Problems
Summary :
In [13], we proposed new decision problems related to lattices, and proved their NP-completeness. In this paper, we present a new public-key identification scheme and a digital signature scheme based on one of the problems in [13]. We also prove the security of our schemes under certain assumptions, and analyze the efficiency of ours.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E91-A No.5 pp.1253-1264
- Publication Date
- 2008/05/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1093/ietfec/e91-a.5.1253
- Type of Manuscript
- PAPER
- Category
- Cryptography and Information Security
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Shunichi HAYASHI, Mitsuru TADA, "A Digital Signature Scheme Based on NP-Complete Lattice Problems" in IEICE TRANSACTIONS on Fundamentals,
vol. E91-A, no. 5, pp. 1253-1264, May 2008, doi: 10.1093/ietfec/e91-a.5.1253.
Abstract: In [13], we proposed new decision problems related to lattices, and proved their NP-completeness. In this paper, we present a new public-key identification scheme and a digital signature scheme based on one of the problems in [13]. We also prove the security of our schemes under certain assumptions, and analyze the efficiency of ours.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e91-a.5.1253/_p
Copy
@ARTICLE{e91-a_5_1253,
author={Shunichi HAYASHI, Mitsuru TADA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Digital Signature Scheme Based on NP-Complete Lattice Problems},
year={2008},
volume={E91-A},
number={5},
pages={1253-1264},
abstract={In [13], we proposed new decision problems related to lattices, and proved their NP-completeness. In this paper, we present a new public-key identification scheme and a digital signature scheme based on one of the problems in [13]. We also prove the security of our schemes under certain assumptions, and analyze the efficiency of ours.},
keywords={},
doi={10.1093/ietfec/e91-a.5.1253},
ISSN={1745-1337},
month={May},}
Copy
TY - JOUR
TI - A Digital Signature Scheme Based on NP-Complete Lattice Problems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1253
EP - 1264
AU - Shunichi HAYASHI
AU - Mitsuru TADA
PY - 2008
DO - 10.1093/ietfec/e91-a.5.1253
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E91-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2008
AB - In [13], we proposed new decision problems related to lattices, and proved their NP-completeness. In this paper, we present a new public-key identification scheme and a digital signature scheme based on one of the problems in [13]. We also prove the security of our schemes under certain assumptions, and analyze the efficiency of ours.
ER -
English
