next up previous
Next: On-line/Off-line Digital signatures Up: The Technion Period (1986-94) Previous: On the Existence of

A Perfect Zero-Knowledge Proof for a Decision Problem Equivalent to Discrete Logarithm

In proving that such a problem belongs to the class of problems having perfect zero-knowledge proof (PZK), this work provides addition support to the belief that the class PZK is a strict superset of BPP.


Comments: Authored by O. Goldreich and E. Kushilevitz. Appeared in



Oded Goldreich
2003-07-30