Black-box concurrent zero-knowledge requires Ω̃(log n) Rounds
- Ran Canetti
- Joe Kilian
- et al.
- 2001
- STOC 2001
Conference paper
Publications
6 results at STOC 2001
A sieve algorithm for the shortest lattice vector problem
- Miklos Ajtai
- R. Kumar
- et al.
- 2001
- STOC 2001
Conference paperBuffer overflow management in QoS switches
- Alexander Kesselman
- Zvi Lotker
- et al.
- 2001
- STOC 2001
Conference paperOnline server allocation in a server farm via benefit task systems
- T.S. Jayram
- Tracy Kimbrel
- et al.
- 2001
- STOC 2001
Conference paperPrivate approximation of NP-hard functions
- Shai Halevi
- Robert Krauthgamer
- et al.
- 2001
- STOC 2001
Conference paperThe round complexity of verifiable secret sharing and secure multicast
- R. Gennaro
- Y. Ishai
- et al.
- 2001
- STOC 2001
Conference paper