Composition of Zero-Knowledge Proofs with Efficient Provers [chapter]

Eleanor Birrell, Salil Vadhan
2010 Lecture Notes in Computer Science  
We revisit the composability of different forms of zeroknowledge proofs when the honest prover strategy is restricted to be polynomial time (given an appropriate auxiliary input). Our results are: Introduction Composition has been one of the most active subjects of research on zeroknowledge proofs. The goal is to understand whether the zero-knowledge property is preserved when a zero-knowledge proof is repeated many times. The These results first appeared in the first author's undergraduate
more » ... is [5] and in the full version of the paper is available on the Cryptology ePrint Archive [6] .
doi:10.1007/978-3-642-11799-2_34 fatcat:hshi4kcclzdurcixnccl5yjhhe