Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs

@article{Katz2005HandlingEP,
  title={Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs},
  author={Jonathan Katz and Yehuda Lindell},
  journal={Journal of Cryptology},
  year={2005},
  volume={21},
  pages={303-349}
}
The standard class of adversaries considered in cryptography is that of strict polynomial-time probabilistic machines. However, expected polynomial-time machines are often also considered. For example, there are many zero-knowledge protocols for which the only known simulation techniques run in expected (and not strict) polynomial time. In addition, it has been shown that expected polynomial-time simulation is essential for achieving constant-round black-box zero-knowledge protocols. This… CONTINUE READING
Highly Cited
This paper has 24 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…