Composition of Zero-Knowledge Proofs with Efficient Provers

We revisit the composability of different forms of zero-knowledge proofs when the honest prover strategy is restricted to be polynomial time (given an appropriate auxiliary input). Our results are:

• Type: Journal
• Year: 2010
• Where: TCC
• Authors: Eleanor Birrell, Salil P. Vadhan
• Keywords: Appropriate Auxiliary Input, Cryptology, Honest Prover Strategy, TCC 2010, Zero-knowledge Proofs