UPDF AI

Everything Provable is Provable in Zero-Knowledge

M. Ben-Or,Oded Goldreich,4 Authors,P. Rogaway

1990 · DOI: 10.1007/0-387-34799-2_4
Annual International Cryptology Conference · 247 Citations

TLDR

It is shown that every language that admits an interactive proof admits a (computational) zero-knowledge interactive proof.