Abstract

We construct the first constant-round non-malleable commitment scheme and the first constantround non-malleable zero-knowledge argument system, as defined by Dolev, Dwork and Naor. Previous constructions either used a non-constant number of rounds, or were only secure under stronger setup assumptions. An example of such an assumption is the shared random string model where we assume all parties have access to a reference string that was chosen uniformly at random by a trusted dealer. We obtain these results by defining an adequate notion of non-malleable coin-tossing, and presenting a constant-round protocol that satisfies it. This protocol allows us to transform protocols that are non-malleable in (a modified notion of) the shared random string model into protocols that are non-malleable in the plain model (without any trusted dealer or setup assumptions). Observing that known constructions of a non-interactive non-malleable zeroknowledge argument systems in the shared random string model are in fact non-malleable in the modified model, and combining them with our coin-tossing protocol we obtain the results mentioned above. The techniques we use are different from those used in previous constructions of nonmalleable protocols. In particular our protocol uses diagonalization and a non-black-box proof of security (in a sense similar to Barak’s zero-knowledge argument).

Citations

410	Nonmalleable cryptography - Dolev, Dwork, et al. - 2000
289	Zero Knowledge Proofs of Identity - Feige, Fiat, et al. - 1987
175	How to go beyond the black-box simulation barrier - Barak - 1997
156	Robust non-interactive zero knowledge - Santis, Crescenzo, et al. - 2001
143	Multiple non-interactive zero knowledge proofs based on a single random string - Feige, Lapidot, et al. - 1990
140	Concurrent zero-knowledge - Dwork, Naor, et al. - 1998
121	On Defining Proofs of Knowledge - Bellare, Goldreich - 1993
104	Non-Interactive Zero-Knowledge and its Applications - Blum, Feldman, et al. - 1988
94	Zero knowledge proofs of knowledge in two rounds - Feige, Shamir - 1989
90	Moni Naor. Non-Malleable Cryptography - Dolev, Dwork - 1991
71	Black-box concurrent zero-knowledge requires ˜ω(log n) rounds - Canetti, Kilian, et al. - 2001
62	Resettable Zero-Knowledge - Canetti, Goldreich, et al. - 2000
57	Zero-knowledge proofs of knowledge without interaction - Santis, Persiano - 1992
49	Universal arguments and their applications - Barak, Goldreich
49	Non-Interactive and Non-Malleable Commitment - Crescenzo, Ishai, et al. - 1998
47	Coin Flipping by Phone - Blum - 1982
39	Strict polynomial-time in simulation and extraction - Barak, Lindell - 2004
35	Non-interactive zero-knowledge and its applications (extended abstract - Blum, Feldman, et al. - 1988
30	Efficient Non-Malleable Commitment Schemes - Fischlin, Fischlin - 2000
22	Achieving Independence in Logarithmic Number of Rounds - Chor, Rabin - 1987
11	Yuval Ishai, and Rafail Ostrovsky. Non-interactive and nonmalleable commitment - Crescenzo - 1998
4	Universal Arguments and their Applications. Cryptology ePrint Archive - Barak, Goldreich - 2001
4	Universally composable commitments. Report 2001/055, Cryptology ePrint Archive - Canetti, Fischlin - 2001
2	Coin by phone - Blum - 1982
2	Ecient and non-interactive non-malleable commitment. Report 2001/032, Cryptology ePrint Archive - Crescenzo, Katz, et al. - 2001