Abstract
We present new constructions of non-malleable commitment schemes, in the public parameter model (where a trusted party makes parameters available to all parties), based on the discrete logarithm or RSA assumptions. The main features of our schemes are: they achieve near-optimal communication for arbitrarily-large messages and are non-interactive. Previous schemes either required (several rounds of) interaction or focused on achieving non-malleable commitment based on general assumptions and were thus efficient only when committing to a single bit. Although our main constructions are for the case of perfectly-hiding commitment, we also present a communication-efficient, non-interactive commitment scheme (based on general assumptions) that is perfectly binding.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
D. Beaver. Adaptive Zero-Knowledge and Computational Equivocation. FOCS '96.
M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway. Relations Among Notions of Security for Public-Key Encryption Schemes. CRYPTO '98.
M. Blum, A. De Santis, S. Micali, and G. Persiano. Non-Interactive Zero-Knowledge. SIAM Journal of Computing, vol. 20, no. 6, Dec 1991, pp. 1084–1118.
M. Blum, P. Feldman, and S. Micali. Non-Interactive Zero-Knowledge and Applications. STOC '88.
S. Brands. Rapid Demonstration of Linear Relations Connected by Boolean Operators. Eurocrypt '97.
R. Cramer and V. Shoup. A Practical Public Key Cryptosystem Provably Secure Against Chosen Ciphertext Attack. CRYPTO '98.
A. De Santis, G. Di Crescenzo, and G. Persiano. Necessary and Sufficient Assumptions for Non-Interactive Zero-Knowledge Proofs of Knowledge for All NP Relations. ICALP '00.
A. De Santis and G. Persiano. Zero-Knowledge Proofs of Knowledge Without Interaction. FOCS '92.
G. Di Crescenzo, Y. Ishai, and R. Ostrovsky. Non-Interactive and Non-Malleable Commitment. STOC '98.
G. Di Crescenzo and R. Ostrovsky. On Concurrent Zero-Knowledge with Preprocessing. CRYPTO '99.
D. Dolev, C. Dwork, and M. Naor. Nonmalleable Cryptography. SIAM J. Comp. 30 (2) 391–437, 2000. A preliminary version appears in STOC '91.
C. Dwork. The Non-Malleability Lectures. Available from the author.
S. Even, O. Goldreich, A. Lempel. A Randomized Protocol for Signing Contracts. Communications of the ACM 28(6), 637–647, 1985.
M. Fischlin and R. Fischlin. Efficient Non-Malleable Commitment Schemes. CRYPTO 2000.
O. Goldreich. Foundations of Cryptography, Fragments of a Book, 1998.
O. Goldreich, S. Micali, and A. Wigderson. How to Play Any Mental Game or a Completeness Theorem for Protocols with Honest Majority. STOC '87.
O. Goldreich, S. Micali, and A. Wigderson. Proofs that Yield Nothing but their Validity or All Languages in NP have Zero-Knowledge Proof Systems. J. ACM 38(3): 691–729 (1991).
J. Katz and M. Yung. Complete Characterization of Security Notions for Probabilistic Private-Key Encryption. STOC '00.
M. Naor. Bit Commitment Using Pseudorandomness. J. Crypto. 4(2): 151–158 (1991).
M. Naor and M. Yung. Universal One-Way Hash Functions and Their Cryptographic Applications. STOC '89.
M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung. Perfect zero-knowledge arguments for NP can be based on general complexity assumptions. J. Cryptology, 11(2):87–108, 1998 (also CRYPTO '92).
T. Okamoto. Provable Secure and Practical Identification Schemes and Corresponding Signature Schemes. CRYPTO '92.
R. Ostrovsky, R. Venkatesan, and M. Yung. Fair games against an all-powerful adversary. AMS DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 13 pp. 155–169, 1993.
T.P. Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. CRYPTO '91.
A. Sahai. Non-Malleable Non-Interactive Zero-Knowledge and Adaptive Chosen-Ciphertext Security. FOCS '99.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg40-59
About this paper
Cite this paper
Di Crescenzo, G., Katz, J., Ostrovsky, R., Smith, A. (2001). Efficient and Non-interactive Non-malleable Commitment. In: Pfitzmann, B. (eds) Advances in Cryptology — EUROCRYPT 2001. EUROCRYPT 2001. Lecture Notes in Computer Science, vol 2045. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44987-6_4
Download citation
DOI: https://doi.org/10.1007/3-540-44987-6_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42070-5
Online ISBN: 978-3-540-44987-4
eBook Packages: Springer Book Archive