TCC
2010
Springer
13 years 10 months ago
2010
Springer
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)...