On the Composition of Public-Coin Zero-Knowledge Protocols

  • Rafael Pass
  • Wei-Lung Dustin Tseng
  • Douglas Wikström
Conference paper

DOI: 10.1007/978-3-642-03356-8_10

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5677)
Cite this paper as:
Pass R., Tseng WL.D., Wikström D. (2009) On the Composition of Public-Coin Zero-Knowledge Protocols. In: Halevi S. (eds) Advances in Cryptology - CRYPTO 2009. Lecture Notes in Computer Science, vol 5677. Springer, Berlin, Heidelberg

Abstract

We show that only languages in BPP have public-coin, black-box zero-knowledge protocols that are secure under an unbounded (polynomial) number of parallel repetitions. This result holds both in the plain model (without any set-up) and in the Bare Public-Key Model (where the prover and the verifier have registered public keys). We complement this result by showing the existence of a public-coin black-box zero-knowledge proof that remains secure under any a-priori bounded number of concurrent executions.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Rafael Pass
    • 1
  • Wei-Lung Dustin Tseng
    • 1
  • Douglas Wikström
    • 2
  1. 1.Cornell UniversityUSA
  2. 2.KTH Royal Institute of TechnologySweden

Personalised recommendations