Non-interactive zero-knowledge and its applications

@inproceedings{Blum1988NoninteractiveZA,
  title={Non-interactive zero-knowledge and its applications},
  author={M. Blum and Paul Feldman and S. Micali},
  booktitle={STOC '88},
  year={1988}
}
We show that interaction in <italic>any</italic> zero-knowledge proof can be replaced by sharing a common, short, random string. We use this result to construct the <italic>first</italic> public-key cryptosystem secure against chosen ciphertext attack. 
672 Citations
Non-interactive Zero Knowledge Proofs in the Random Oracle Model
  • PDF
Sub-linear Size Pairing-based Non-interactive Zero-Knowledge Arguments
  • Jens Groth
  • Computer Science, Mathematics
  • IACR Cryptol. ePrint Arch.
  • 2009
  • 1
  • PDF
Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
  • 91
  • PDF
Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
  • 126
  • PDF
Subversion-Zero-Knowledge SNARKs
  • 50
  • PDF
Non-Interactive Zero-Knowledge with Preprocessing
  • 61
  • PDF
Scalable Zero Knowledge via Cycles of Elliptic Curves
  • 149
  • PDF
Shorter QA-NIZK and SPS with Tighter Security
  • 9
  • PDF
Proving Security Against Chosen Cyphertext Attacks
  • 33
  • PDF
...
1
2
3
4
5
...