Theory of Cryptography Conference

TCC 2011: Theory of Cryptography pp 274-292

Concurrent Non-Malleable Zero Knowledge with Adaptive Inputs

  • Huijia Lin
  • Rafael Pass
Conference paper

DOI: 10.1007/978-3-642-19571-6_17

Volume 6597 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Lin H., Pass R. (2011) Concurrent Non-Malleable Zero Knowledge with Adaptive Inputs. In: Ishai Y. (eds) Theory of Cryptography. TCC 2011. Lecture Notes in Computer Science, vol 6597. Springer, Berlin, Heidelberg


Concurrent non-malleable zero-knowledge (\(\mathcal{CN}\!\mathcal{MZK}\)) considers the concurrent execution of zero-knowledge protocols in a setting where the attacker can simultaneously corrupt multiple provers and verifiers. We provide the first construction of a \(\mathcal{CN}\!\mathcal{MZK}\) protocol that, without any trusted set-up, remains secure even if the attacker may adaptively select the statements to receive proofs of; previous works only handle scenarios where the statements are fixed at the beginning of the execution, or chosen adaptively from a restricted set of statements.

Download to read the full conference paper text

Copyright information

© International Association for Cryptologic Research 2011

Authors and Affiliations

  • Huijia Lin
    • 1
  • Rafael Pass
    • 1
  1. 1.Cornell UniversityUSA