Non-interactive zero-knowledge and its applications
M Blum, P Feldman, S Micali - … for Cryptography: On the Work of Shafi …, 2019 - dl.acm.org
M Blum, P Feldman, S Micali
Providing Sound Foundations for Cryptography: On the Work of Shafi …, 2019•dl.acm.orgNon-interactive zero-knowledge and its applications Page 1 14Non-Interactive Zero-Knowledge
(NIZK) Proof Systems This chapter reproduces the contents of the paper “Non-Interactive
Zero-Knowledge and its Applications,” which appeared in the proceedings of the 20th Annual
ACM Symposium on Theory of Computing, pp. 103–112, 1988. This influential work of Manuel
Blum, Paul Feldman, and Silvio Micali introduced a model that includes a common random
string provided from the outside and available to both the prover and the verifier. It then showed …
(NIZK) Proof Systems This chapter reproduces the contents of the paper “Non-Interactive
Zero-Knowledge and its Applications,” which appeared in the proceedings of the 20th Annual
ACM Symposium on Theory of Computing, pp. 103–112, 1988. This influential work of Manuel
Blum, Paul Feldman, and Silvio Micali introduced a model that includes a common random
string provided from the outside and available to both the prover and the verifier. It then showed …
Abstract
We show that interaction in any zero-knowledge proof can be replaced by sharing a common, short, random string. We use this result to construct the first public-key cryptosystem secure against chosen ciphertext attack.
ACM Digital Library