sci.crypt archive
Re: perfect zero-knowledge
From: Anika Behrens <abehrens_nospam@web.de>
Date: Fri Sep 23 2005 - 20:41:11 CEST
Date: Fri Sep 23 2005 - 20:41:11 CEST
Hi,
Anika Behrens wrote:
> Hi,
>
> I ask myself whether the proofs of knowledge of a discrete log given in
> [1] or [2] are prefect zk or computational zk. Can you help me?
>
> Thanks for your help!
> Anika
>
> [1] Demonstrating possession of a discrete logarithm without revealing
> it (D. Chaum, J.-H. Evertse, J. van de Graaf, R. Peralta, CRYPTO 86)
> [2] Efficient signature generation for smart cards
> (Schnorr, J. of Cryptology, 1991)
Has nobody any idea?
Received on Thu Sep 29 21:57:24 2005