[GK96a] On the Composition of Zero-Knowledge Proof Systems

Authors: Oded Goldreich, Hugo Krawczyk | Venue: SIAM Journal on Computing 1996 | Source

Abstract

TODO — abstract.

Notes

• Summary of the results, not the abstract: zero-knowledge in the original (non-auxiliary-input) sense is not closed under sequential composition, whereas auxiliary-input zero-knowledge is; zero-knowledge is not closed under parallel composition. Only $\mathbf{BPP}$ languages have three-round interactive proofs, or constant-round public-coin (Arthur–Merlin) proofs, with negligible soundness error that are black-box simulation zero-knowledge.

BibTeX

Copy

@article{GK96a,
  author  = {Oded Goldreich and Hugo Krawczyk},
  title   = {On the Composition of Zero-Knowledge Proof Systems},
  journal = {SIAM Journal on Computing},
  volume  = {25},
  number  = {1},
  pages   = {169--192},
  year    = {1996}
}