[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 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.

BibTeX

Copy

@Inproceedings{STOC:BluFelMic88,
  author = {Manuel Blum and Paul Feldman and Silvio Micali},
  title = {Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract)},
  pages = {103--112},
  booktitle = {20th Annual {ACM} Symposium on Theory of Computing},
  address = {Chicago, IL, USA},
  month = {may~2--4},
  publisher = {{ACM} Press},
  year = {1988},
  doi = {10.1145/62212.62222},
}