Next: Concurrent Zero-Knowledge With Timing,
Up: Back at Weizmann (1998-2003)
Previous: Resettably-Sound Zero-Knowledge and its
The main result of this work is an exponential lower-bound
on the length of linear codes that allow to recover
each desired information bit by probing
the corrupted codeword at two (random) positions.
Comments:
Authored by O. Goldreich, H. Karloff, L. Schulman and L. Trevisan. Appeared in
- Proceedings of 17th CCC, pages 175-183, 2002.
Oded Goldreich
2003-07-30