A Multi-Trapdoor Commitment Scheme from the RSA Assumption

Ryo NISHIMAKI; Eiichiro FUJISAKI; Keisuke TANAKA

doi:10.1587/transfun.E95.A.176

A Multi-Trapdoor Commitment Scheme from the RSA Assumption

Ryo NISHIMAKI, Eiichiro FUJISAKI, Keisuke TANAKA

Full Text Views

0

Share
Cite this

Summary :

This paper presents a new non-interactive multi-trapdoor commitment scheme from the standard RSA assumption. Multi-trapdoor commitment is a stronger variant of trapdoor commitment. Its notion was introduced by Gennaro at CRYPTO 2004. Multi-trapdoor commitment schemes are very useful because we can convert a non-interactive multi-trapdoor commitment scheme into a non-interactive and reusable non-malleable commitment scheme by using one-time signature and transform any proof of knowledge into a concurrently non-malleable one (this can be used as concurrently secure identification). Gennaro gave concrete constructions of multi-trapdoor commitment, but its security relies on stronger assumptions, such as the strong RSA assumption and the q-strong Diffie-Hellman assumption as opposed to our construction based on the standard RSA assumption. As a corollary of our results, we constructed a non-interactive and reusable non-malleable commitment scheme from the standard RSA assumption. Our scheme is based on the Hohenberger-Waters (weak) signature scheme presented at CRYPTO 2009. Several non-interactive and reusable non-malleable commitment schemes (in the common reference string model) have been proposed, but they all rely on stronger assumptions (such as the strong RSA assumption). Thus, we give the first construction of a non-interactive and reusable non-malleable commitment scheme from the standard RSA assumption.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E95-A No.1 pp.176-184

Publication Date: 2012/01/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E95.A.176

Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security)

Category: Secure Protocol

Cite this

Copy

Ryo NISHIMAKI, Eiichiro FUJISAKI, Keisuke TANAKA, "A Multi-Trapdoor Commitment Scheme from the RSA Assumption" in IEICE TRANSACTIONS on Fundamentals, vol. E95-A, no. 1, pp. 176-184, January 2012, doi: 10.1587/transfun.E95.A.176.
Abstract: This paper presents a new non-interactive multi-trapdoor commitment scheme from the standard RSA assumption. Multi-trapdoor commitment is a stronger variant of trapdoor commitment. Its notion was introduced by Gennaro at CRYPTO 2004. Multi-trapdoor commitment schemes are very useful because we can convert a non-interactive multi-trapdoor commitment scheme into a non-interactive and reusable non-malleable commitment scheme by using one-time signature and transform any proof of knowledge into a concurrently non-malleable one (this can be used as concurrently secure identification). Gennaro gave concrete constructions of multi-trapdoor commitment, but its security relies on stronger assumptions, such as the strong RSA assumption and the q-strong Diffie-Hellman assumption as opposed to our construction based on the standard RSA assumption. As a corollary of our results, we constructed a non-interactive and reusable non-malleable commitment scheme from the standard RSA assumption. Our scheme is based on the Hohenberger-Waters (weak) signature scheme presented at CRYPTO 2009. Several non-interactive and reusable non-malleable commitment schemes (in the common reference string model) have been proposed, but they all rely on stronger assumptions (such as the strong RSA assumption). Thus, we give the first construction of a non-interactive and reusable non-malleable commitment scheme from the standard RSA assumption.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E95.A.176/_p

Copy

@ARTICLE{e95-a_1_176,
author={Ryo NISHIMAKI, Eiichiro FUJISAKI, Keisuke TANAKA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Multi-Trapdoor Commitment Scheme from the RSA Assumption},
year={2012},
volume={E95-A},
number={1},
pages={176-184},
abstract={This paper presents a new non-interactive multi-trapdoor commitment scheme from the standard RSA assumption. Multi-trapdoor commitment is a stronger variant of trapdoor commitment. Its notion was introduced by Gennaro at CRYPTO 2004. Multi-trapdoor commitment schemes are very useful because we can convert a non-interactive multi-trapdoor commitment scheme into a non-interactive and reusable non-malleable commitment scheme by using one-time signature and transform any proof of knowledge into a concurrently non-malleable one (this can be used as concurrently secure identification). Gennaro gave concrete constructions of multi-trapdoor commitment, but its security relies on stronger assumptions, such as the strong RSA assumption and the q-strong Diffie-Hellman assumption as opposed to our construction based on the standard RSA assumption. As a corollary of our results, we constructed a non-interactive and reusable non-malleable commitment scheme from the standard RSA assumption. Our scheme is based on the Hohenberger-Waters (weak) signature scheme presented at CRYPTO 2009. Several non-interactive and reusable non-malleable commitment schemes (in the common reference string model) have been proposed, but they all rely on stronger assumptions (such as the strong RSA assumption). Thus, we give the first construction of a non-interactive and reusable non-malleable commitment scheme from the standard RSA assumption.},
keywords={},
doi={10.1587/transfun.E95.A.176},
ISSN={1745-1337},
month={January},}

Copy

TY - JOUR
TI - A Multi-Trapdoor Commitment Scheme from the RSA Assumption
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 176
EP - 184
AU - Ryo NISHIMAKI
AU - Eiichiro FUJISAKI
AU - Keisuke TANAKA
PY - 2012
DO - 10.1587/transfun.E95.A.176
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E95-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2012
AB - This paper presents a new non-interactive multi-trapdoor commitment scheme from the standard RSA assumption. Multi-trapdoor commitment is a stronger variant of trapdoor commitment. Its notion was introduced by Gennaro at CRYPTO 2004. Multi-trapdoor commitment schemes are very useful because we can convert a non-interactive multi-trapdoor commitment scheme into a non-interactive and reusable non-malleable commitment scheme by using one-time signature and transform any proof of knowledge into a concurrently non-malleable one (this can be used as concurrently secure identification). Gennaro gave concrete constructions of multi-trapdoor commitment, but its security relies on stronger assumptions, such as the strong RSA assumption and the q-strong Diffie-Hellman assumption as opposed to our construction based on the standard RSA assumption. As a corollary of our results, we constructed a non-interactive and reusable non-malleable commitment scheme from the standard RSA assumption. Our scheme is based on the Hohenberger-Waters (weak) signature scheme presented at CRYPTO 2009. Several non-interactive and reusable non-malleable commitment schemes (in the common reference string model) have been proposed, but they all rely on stronger assumptions (such as the strong RSA assumption). Thus, we give the first construction of a non-interactive and reusable non-malleable commitment scheme from the standard RSA assumption.
ER -