STOC
1998
ACM
14 years 3 months ago
1998
ACM
Abstract. Loosely speaking, an interactive proof is said to be zeroknowledge if the view of every “efficient” verifier can be “efficiently” simulated. An outstanding open ...
CRYPTO
2000
Springer
14 years 4 months ago
2000
Springer
Abstract. We present a lower bound on the number of rounds required by Concurrent Zero-Knowledge proofs for languages in NP. It is shown that in the context of Concurrent Zero-Know...