One-Way Functions are Essential for Non-Trivial Zero-Knowledge(Extended Abstract) (1993)
Cached
Download Links
| Venue: | IN PROC. 2ND ISRAEL SYMP. ON THEORY OF COMPUTING AND SYSTEMS (ISTCS93), IEEE COMPUTER |
| Citations: | 35 - 10 self |
BibTeX
@INPROCEEDINGS{Ostrovsky93one-wayfunctions,
author = {Rafail Ostrovsky and Avi Wigderson},
title = {One-Way Functions are Essential for Non-Trivial Zero-Knowledge(Extended Abstract) },
booktitle = {IN PROC. 2ND ISRAEL SYMP. ON THEORY OF COMPUTING AND SYSTEMS (ISTCS93), IEEE COMPUTER},
year = {1993},
pages = {3--17},
publisher = {Society Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
It was known that if one-way functions exist, then there are zero-knowledge proofs for every language in PSPACE. We prove that unless very weak one-way functions exist, Zero-Knowledge proofs can be given only for languages in BPP. For average-case definitions of BPP we prove an analogous result under the assumption that uniform one-way functions do not exist. Thus, very loosely speaking, zero-knowledge is either useless (exists only for "easy" languages), or universal (exists for every provable language).
