Extracted from a working draft of Goldreich’s FOUNDATIONS OF CRYPTOGRAPHY. See copyright notice.
Chapter
Zero Knowledge Pro of Systems
In this chapter we discuss zero knowledge pro of systems Lo osely sp eaking such pro of
systems have the remarkable prop erty of b eing convincing and yielding nothing b eyond
the validity of the assertion The main result presented is a metho d to generate zero
knowledge pro of systems for every language in NP This metho d can b e implemented using
any bit commitmentscheme which in turn can b e implemented using any pseudorandom
generator In addition we discuss more re