Zaps and Their Applications

@article{Dwork2000ZapsAT,
  title={Zaps and Their Applications},
  author={Cynthia Dwork and Moni Naor},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={2000}
}
A zap is a two-round, witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to the prover, can be fixed “once-and-for-all” and applied to any instance, and where the verifier does not use any private coins. We present a zap for every language in NP, based on the existence of non-interactive zero-knowledge proofs in the shared random string model. The zap is in the standard model, and hence requires no common guaranteed random string. We present… CONTINUE READING
Highly Influential
This paper has highly influenced 26 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 246 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 142 CITATIONS, ESTIMATED 58% COVERAGE

246 Citations

0102030'01'04'08'12'16
Citations per Year
Semantic Scholar estimates that this publication has 246 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-10 OF 36 REFERENCES

and S . Micali , How to Construct Random Functions

  • Goldreich S. Goldwasser
  • Foundations of Cryptography - Basic Tools
  • 2001

A Note on the Round-Complexity of Concurrent Zero-Knowledge, Advances in Cryptology - CRYPTO’2000

  • A. Rosen
  • Proceedings, Lecture Notes in Computer Science…
  • 2000

Similar Papers

Loading similar papers…