Other Directory Sites: SeekWonder | Directory Owners Forum
The following archive was created by hippie-mail 7.98617-22 on Sat Apr 10 1999 - 01:10:58
bram (bram@gawth.com)
Fri, 14 Aug 1998 09:06:52 -0700 (PDT)
On Fri, 14 Aug 1998, Anonymous wrote:
> You can turn a 3 move ZK proof (prover commits, verifier challenges,
> prover responds) into a signature by making the challenge be a hash
> of the message to be signed and the prover commitment. An example is
> the Schnorr signature, which is based on a ZK proof of knowledge of a
> discrete logarithm.
Hmmm, never thought of it that way before.
> Do you have in mind a different way of using ZK techniques for signatures?
No, I was just wondering if anyone had done the whole shabang of making a
full-fledged NP-complete ZK signature scheme and made the problem it was
based on be inversion of the hash algorithm which was used to find the
challenges. Given that some of the common signature schemes are basically
the same thing but much more efficient, it would probably be pointless.
-Bram
The following archive was created by hippie-mail 7.98617-22 on Sat Apr 10 1999 - 01:10:58