Black-box concurrent zero-knowledge requires (almost) logarithmically many rounds
- Ran Canetti
- Joe Kilian
- et al.
- 2003
- SIAM Journal on Computing
Publications
4 results for Joe Kilian
Black-box concurrent zero-knowledge requires Ω̃(log n) Rounds
- Ran Canetti
- Joe Kilian
- et al.
- 2001
- STOC 2001
Lower bounds for zero knowledge on the Internet
- Joe Kilian
- Erez Petrank
- et al.
- 1998
- FOCS 1998
On the role of shared randomness in two prover proof systems
- Mihir Bellare
- U. Feige
- et al.
- 1995
- ISTCS 1995