Non-Interactive Zero-Knowledge and Its Applications

URL: https://dl.acm.org/doi/10.1145/62212.62222 Authors: Manuel Blum, Paul Feldman, Silvio Micali

Abstract

We show that interaction in any zero-knowledge proof system can be replaced by a shared random string. Specifically, assuming the existence of trapdoor permutations, we give a non-interactive zero-knowledge proof system for any NP language in the common random string model. We also show several applications of non-interactive zero-knowledge proofs to cryptographic protocol design, including digital signature schemes secure against adaptive chosen-message attacks, public-key cryptosystems secure against adaptive chosen-ciphertext attacks, and identification schemes.