DLOG ∈ SZK

Inclusion · GK93

Statement

A decision problem equivalent to the discrete logarithm under polynomial-time reductions has a perfect zero-knowledge proof, so it lies in SZK — GK93.

Notes

• The discrete logarithm is also in $\mathbf{NP}\cap \mathbf{coNP}$ (DLOG ∈ NP, DLOG ∈ coNP) and in BQP — folklore, Shor97.