A multi-trapdoor commitment scheme from the RSA assumption

Authors:
Ryo Nishimaki;Eiichiro Fujisaki;Keisuke Tanaka
Affiliations:
NTT Laboratories, Musashino-shi, Tokyo, Japan and Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, Japan;NTT Laboratories, Musashino-shi, Tokyo, Japan;Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, Japan
Venue:
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Year:
2010

Citing 25
Cited 1

Zero-knowledge proofs of identity

Journal of Cryptology
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
Non-interactive and non-malleable commitment

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On the generation of cryptographically strong pseudorandom sequences

ACM Transactions on Computer Systems (TOCS)
Foundations of Cryptography: Basic Tools

Foundations of Cryptography: Basic Tools
Nonmalleable Cryptography

SIAM Journal on Computing
Constant-Round Coin-Tossing with a Man in the Middle or Realizing the Shared Random String Model

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Optimal Tree-Based One-Time Digital Signature Schemes

STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Efficient Non-malleable Commitment Schemes

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
A "Paradoxical" Indentity-Based Signature Scheme Resulting from Zero-Knowledge

CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Efficient and Non-interactive Non-malleable Commitment

EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
On the Efficiency of One-Time Digital Signatures

ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
On Defining Proofs of Knowledge

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Non-interactive and reusable non-malleable commitment schemes

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Strengthening Zero-Knowledge Protocols Using Signatures

Journal of Cryptology
Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series)

Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series)
New and Improved Constructions of Nonmalleable Cryptographic Protocols

SIAM Journal on Computing
Adaptive One-Way Functions and Applications

CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs

CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Hash Functions from Sigma Protocols and Improvements to VSH

ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Non-malleability amplification

Proceedings of the forty-first annual ACM symposium on Theory of computing
Efficient Non-malleable Commitment Schemes

Journal of Cryptology
Short and Stateless Signatures from the RSA Assumption

CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Efficient identity-based encryption without random oracles

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques

New constructions of efficient simulation-sound commitments using encryption and their applications

CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Gennaro introduced the notion of multi-trapdoor commitments which is a stronger form of trapdoor commitment schemes at CRYPTO 2004. Multi-trapdoor commitments have several cryptographic applications. For example, Gennaro proposed a conversion that makes a non-interactive multi-trapdoor commitment scheme into a noninteractive and reusable non-malleable commitment scheme and a compiler that transforms any proof of knowledge into concurrently nonmalleable one. Gennaro gave constructions of multi-trapdoor commitments, but they rely on stronger assumptions, such as the strong RSA assumption, the q-strong Diffie-Hellman assumption. In this paper, we propose a non-interactive multi-trapdoor commitment scheme from the standard RSA assumption. Thus, as a corollary of our result, we obtain a non-interactive and reusable non-malleable commitment scheme from the standard RSA assumption. Our scheme is based on theHohenberger-Waters signature scheme proposed at CRYPTO2009. Several non-interactive and reusable non-malleable commitment schemes (in the common reference string model) have been proposed, but all of them rely on stronger assumptions (e.g., strong RSA).