Abstract
New lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments were shown. Beyond the lower bounds themselves, new differences between the power of zero-knowledge proofs versus arguments were implied. It was also implied in some cases complexity assumptions can and should be used to obtain zero-knowledge lower bounds.
| Original language | English |
|---|---|
| Pages (from-to) | 384-393 |
| Number of pages | 10 |
| Journal | Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS |
| State | Published - 2003 |
| Externally published | Yes |
| Event | Proceedings: 44th Annual IEEE Symposium on Foundations of Computer Science - FOCS 2003 - Cambridge, MA, United States Duration: 11 Oct 2003 → 14 Oct 2003 |