IEICE TRANSACTIONS on Fundamentals
Open Access
A Constant-Size Signature Scheme with a Tighter Reduction from the CDH Assumption
-
Full Text Views
21
- Cite this
- Free PDF (1MB)
Summary :
We present a constant-size signature scheme under the CDH assumption. It has a tighter security reduction than any other constant-size signature scheme with a security reduction to solving some intractable search problems. Hofheinz, Jager, and Knapp (PKC 2012) presented a constant-size signature scheme under the CDH assumption with a reduction loss of O(q), where q is the number of signing queries. They also proved that the reduction loss of O(q) is optimal in a black-box security proof. To the best of our knowledge, no constant-size signature scheme has been proposed with a tighter reduction (to the hardness of a search problem) than that proposed by Hofheinz et al., even if it is not re-randomizable. We remark that our scheme is not re-randomizable. We achieve the reduction loss of O(q/d), where d is the number of group elements in a public key.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E103-A No.1 pp.141-149
- Publication Date
- 2020/01/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.2019CIP0015
- Type of Manuscript
- Special Section PAPER (Special Section on Cryptography and Information Security)
- Category
Authors
Kaisei KAJITA
Japan Broadcasting Corporation
Kazuto OGAWA
Japan Broadcasting Corporation
Eiichiro FUJISAKI
Japan Advanced Institute of Science and Technology (JAIST)
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
Kaisei KAJITA, Kazuto OGAWA, Eiichiro FUJISAKI, "A Constant-Size Signature Scheme with a Tighter Reduction from the CDH Assumption" in IEICE TRANSACTIONS on Fundamentals,
vol. E103-A, no. 1, pp. 141-149, January 2020, doi: 10.1587/transfun.2019CIP0015.
Abstract: We present a constant-size signature scheme under the CDH assumption. It has a tighter security reduction than any other constant-size signature scheme with a security reduction to solving some intractable search problems. Hofheinz, Jager, and Knapp (PKC 2012) presented a constant-size signature scheme under the CDH assumption with a reduction loss of O(q), where q is the number of signing queries. They also proved that the reduction loss of O(q) is optimal in a black-box security proof. To the best of our knowledge, no constant-size signature scheme has been proposed with a tighter reduction (to the hardness of a search problem) than that proposed by Hofheinz et al., even if it is not re-randomizable. We remark that our scheme is not re-randomizable. We achieve the reduction loss of O(q/d), where d is the number of group elements in a public key.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2019CIP0015/_p
Copy
@ARTICLE{e103-a_1_141,
author={Kaisei KAJITA, Kazuto OGAWA, Eiichiro FUJISAKI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Constant-Size Signature Scheme with a Tighter Reduction from the CDH Assumption},
year={2020},
volume={E103-A},
number={1},
pages={141-149},
abstract={We present a constant-size signature scheme under the CDH assumption. It has a tighter security reduction than any other constant-size signature scheme with a security reduction to solving some intractable search problems. Hofheinz, Jager, and Knapp (PKC 2012) presented a constant-size signature scheme under the CDH assumption with a reduction loss of O(q), where q is the number of signing queries. They also proved that the reduction loss of O(q) is optimal in a black-box security proof. To the best of our knowledge, no constant-size signature scheme has been proposed with a tighter reduction (to the hardness of a search problem) than that proposed by Hofheinz et al., even if it is not re-randomizable. We remark that our scheme is not re-randomizable. We achieve the reduction loss of O(q/d), where d is the number of group elements in a public key.},
keywords={},
doi={10.1587/transfun.2019CIP0015},
ISSN={1745-1337},
month={January},}
Copy
TY - JOUR
TI - A Constant-Size Signature Scheme with a Tighter Reduction from the CDH Assumption
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 141
EP - 149
AU - Kaisei KAJITA
AU - Kazuto OGAWA
AU - Eiichiro FUJISAKI
PY - 2020
DO - 10.1587/transfun.2019CIP0015
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E103-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2020
AB - We present a constant-size signature scheme under the CDH assumption. It has a tighter security reduction than any other constant-size signature scheme with a security reduction to solving some intractable search problems. Hofheinz, Jager, and Knapp (PKC 2012) presented a constant-size signature scheme under the CDH assumption with a reduction loss of O(q), where q is the number of signing queries. They also proved that the reduction loss of O(q) is optimal in a black-box security proof. To the best of our knowledge, no constant-size signature scheme has been proposed with a tighter reduction (to the hardness of a search problem) than that proposed by Hofheinz et al., even if it is not re-randomizable. We remark that our scheme is not re-randomizable. We achieve the reduction loss of O(q/d), where d is the number of group elements in a public key.
ER -
English
