We show how to produce short proofs of theorems such that a distrusting Verifier can be convinced that the theorem is true
yet obtains no information about the proof itself. The proofs are non-interactive pro- vided that the quadratic residuosity
bit commitment scheme is available to the Prover and Verifier. For typical applications, the proofs are short enough to fit
on a floppy disk.
Supported in part by NSF Grant CCR-9207204. This author is currently on sabbatical leave from the University of Wisconsin
at Milwaukee.