Concurrent Non-Malleable Zero Knowledge Proofs

  • Huijia Lin
  • Rafael Pass
  • Wei-Lung Dustin Tseng
  • Muthuramakrishnan Venkitasubramaniam
Conference paper

DOI: 10.1007/978-3-642-14623-7_23

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6223)
Cite this paper as:
Lin H., Pass R., Tseng WL.D., Venkitasubramaniam M. (2010) Concurrent Non-Malleable Zero Knowledge Proofs. In: Rabin T. (eds) Advances in Cryptology – CRYPTO 2010. CRYPTO 2010. Lecture Notes in Computer Science, vol 6223. Springer, Berlin, Heidelberg

Abstract

Concurrent non-malleable zero-knowledge (NMZK) considers the concurrent execution of zero-knowledge protocols in a setting where the attacker can simultaneously corrupt multiple provers and verifiers. Barak, Prabhakaran and Sahai (FOCS’06) recently provided the first construction of a concurrent NMZK protocol without any set-up assumptions. Their protocol, however, is only computationally sound (a.k.a., a concurrent NMZK argument). In this work we present the first construction of a concurrent NMZK proof without any set-up assumptions. Our protocol requires poly(n) rounds assuming one-way functions, or \(\tilde{O}(\log n)\) rounds assuming collision-resistant hash functions.

As an additional contribution, we improve the round complexity of concurrent NMZK arguments based on one-way functions (from poly(n) to \(\tilde O(\log n)\)), and achieve a near linear (instead of cubic) security reductions. Taken together, our results close the gap between concurrent ZK protocols and concurrent NMZK protocols (in terms of feasibility, round complexity, hardness assumptions, and tightness of the security reduction).

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Huijia Lin
    • 1
  • Rafael Pass
    • 1
  • Wei-Lung Dustin Tseng
    • 1
  • Muthuramakrishnan Venkitasubramaniam
    • 1
  1. 1.Cornell University 

Personalised recommendations