[BFM88] Non-Interactive Zero-Knowledge and Its Applications

Authors: Manuel Blum, Paul Feldman, Silvio Micali | Venue: STOC 1988 | Source

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.

BibTeX

Copy

@inproceedings{BFM88,
  author    = {Manuel Blum and Paul Feldman and Silvio Micali},
  title     = {Non-Interactive Zero-Knowledge and Its Applications},
  booktitle = {Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC 1988)},
  pages     = {103--112},
  year      = {1988}
}