Signatures from Trapdoor Commitments with Strong Openings

Goichiro HANAOKA; Jacob C. N. SCHULDT

doi:10.1587/transfun.E100.A.1924

Signatures from Trapdoor Commitments with Strong Openings

Goichiro HANAOKA, Jacob C. N. SCHULDT

Full Text Views

0

Share
Cite this

Summary :

In this paper, we propose a new generic construction of signatures from trapdoor commitments with strong openings in the random oracle model. Our construction is very efficient in the sense that signatures consist of just a single decommitment of the underlying commitment scheme, and verification corresponds to verifying this decommitment against a commitment derived via a hash function. Furthermore, assuming the commitment scheme provides sufficiently strong statistical hiding and trapdoor opening properties, the reduction of the security of the signature scheme to the binding property of the commitment scheme is tight. To instantiate our construction, we propose two new commitment schemes with strong openings. Both of these are statistically hiding, and have binding properties based on a Diffie-Hellman inversion problem and factoring, respectively. The signature schemes obtained from these are very efficient; the first matches the performance of BLS signatures, which currently provides the shortest signatures, and the second provides signatures of similar length to the shortest version of Rabin-Williams signatures while still being tightly related to factoring.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E100-A No.9 pp.1924-1931

Publication Date: 2017/09/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E100.A.1924

Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)

Category

Authors

Goichiro HANAOKA
National Institute of Advanced Industrial Science and Technology (AIST)
Jacob C. N. SCHULDT
National Institute of Advanced Industrial Science and Technology (AIST)

Keyword

signatures, generic construction, trapdoor commitments

Cite this

Copy

Goichiro HANAOKA, Jacob C. N. SCHULDT, "Signatures from Trapdoor Commitments with Strong Openings" in IEICE TRANSACTIONS on Fundamentals, vol. E100-A, no. 9, pp. 1924-1931, September 2017, doi: 10.1587/transfun.E100.A.1924.
Abstract: In this paper, we propose a new generic construction of signatures from trapdoor commitments with strong openings in the random oracle model. Our construction is very efficient in the sense that signatures consist of just a single decommitment of the underlying commitment scheme, and verification corresponds to verifying this decommitment against a commitment derived via a hash function. Furthermore, assuming the commitment scheme provides sufficiently strong statistical hiding and trapdoor opening properties, the reduction of the security of the signature scheme to the binding property of the commitment scheme is tight. To instantiate our construction, we propose two new commitment schemes with strong openings. Both of these are statistically hiding, and have binding properties based on a Diffie-Hellman inversion problem and factoring, respectively. The signature schemes obtained from these are very efficient; the first matches the performance of BLS signatures, which currently provides the shortest signatures, and the second provides signatures of similar length to the shortest version of Rabin-Williams signatures while still being tightly related to factoring.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E100.A.1924/_p

Copy

@ARTICLE{e100-a_9_1924,
author={Goichiro HANAOKA, Jacob C. N. SCHULDT, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Signatures from Trapdoor Commitments with Strong Openings},
year={2017},
volume={E100-A},
number={9},
pages={1924-1931},
abstract={In this paper, we propose a new generic construction of signatures from trapdoor commitments with strong openings in the random oracle model. Our construction is very efficient in the sense that signatures consist of just a single decommitment of the underlying commitment scheme, and verification corresponds to verifying this decommitment against a commitment derived via a hash function. Furthermore, assuming the commitment scheme provides sufficiently strong statistical hiding and trapdoor opening properties, the reduction of the security of the signature scheme to the binding property of the commitment scheme is tight. To instantiate our construction, we propose two new commitment schemes with strong openings. Both of these are statistically hiding, and have binding properties based on a Diffie-Hellman inversion problem and factoring, respectively. The signature schemes obtained from these are very efficient; the first matches the performance of BLS signatures, which currently provides the shortest signatures, and the second provides signatures of similar length to the shortest version of Rabin-Williams signatures while still being tightly related to factoring.},
keywords={},
doi={10.1587/transfun.E100.A.1924},
ISSN={1745-1337},
month={September},}

Copy

TY - JOUR
TI - Signatures from Trapdoor Commitments with Strong Openings
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1924
EP - 1931
AU - Goichiro HANAOKA
AU - Jacob C. N. SCHULDT
PY - 2017
DO - 10.1587/transfun.E100.A.1924
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E100-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2017
AB - In this paper, we propose a new generic construction of signatures from trapdoor commitments with strong openings in the random oracle model. Our construction is very efficient in the sense that signatures consist of just a single decommitment of the underlying commitment scheme, and verification corresponds to verifying this decommitment against a commitment derived via a hash function. Furthermore, assuming the commitment scheme provides sufficiently strong statistical hiding and trapdoor opening properties, the reduction of the security of the signature scheme to the binding property of the commitment scheme is tight. To instantiate our construction, we propose two new commitment schemes with strong openings. Both of these are statistically hiding, and have binding properties based on a Diffie-Hellman inversion problem and factoring, respectively. The signature schemes obtained from these are very efficient; the first matches the performance of BLS signatures, which currently provides the shortest signatures, and the second provides signatures of similar length to the shortest version of Rabin-Williams signatures while still being tightly related to factoring.
ER -