A slight correction is noted, which isn't very relevant to the
ZK proofs in the proposed payment system.
At 11:41 AM 9/20/99 -0700, bram wrote:
> Interactive ZK proofs can be made non-interactive by generating an
> encoding of the information offered by the prover, and using the bits of
> the secure hash of that as the challenges by the provee.
Not all interactive ZK proofs can be converted into non-interactive
ZK proofs. For example, in ZK proofs of low-entropy knowledge,
non-interactive proofs are not possible.
---------------------------
David P. Jablon
[EMAIL PROTECTED]
www.IntegritySciences.com
