Abstract
We efficiently combine unpredictability and verifiability by extending the Goldreich-Goldwasser-Micali construction of pseudorandom functions fs from a secret seed s, so that knowledge of s not only enables one to evaluate fs at any point x, but also to provide an NP-proof that the value fs(x) is indeed correct without compromising the unpredictability of fs at any other point for which no such a proof was provided.
| Original language | English |
|---|---|
| Pages (from-to) | 120-130 |
| Number of pages | 11 |
| Journal | Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS |
| State | Published - 1999 |
| Externally published | Yes |
| Event | Proceedings of the 1999 IEEE 40th Annual Conference on Foundations of Computer Science - New York, NY, USA Duration: 17 Oct 1999 → 19 Oct 1999 |