perfect zero-knowledge

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)
Received on Thu Sep 29 21:57:04 2005