Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs
暂无分享,去创建一个
[1] P. Spreij. Probability and Measure , 1996 .
[2] Hugo Krawczyk,et al. On the Composition of Zero-Knowledge Proof Systems , 1990, ICALP.
[3] Silvio Micali,et al. How to construct random functions , 1986, JACM.
[4] Boaz Barak,et al. How to go beyond the black-box simulation barrier , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[5] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[6] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[7] Oded Goldreich,et al. How to construct constant-round zero-knowledge proof systems for NP , 1996, Journal of Cryptology.
[8] Oded Goldreich,et al. Universal arguments and their applications , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[9] Michael R. Beauregard,et al. The Basic Tools , 1992 .
[10] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[11] Adi Shamir,et al. Zero Knowledge Proofs of Knowledge in Two Rounds , 1989, CRYPTO.
[12] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[13] Oded Goldreich,et al. Definitions and properties of zero-knowledge proof systems , 1994, Journal of Cryptology.
[14] Yehuda Lindell,et al. Strict Polynomial-Time in Simulation and Extraction , 2004, SIAM J. Comput..
[15] Oded Goldreich,et al. Foundations of Cryptography: Volume 1, Basic Tools , 2001 .
[16] Ran Canetti,et al. Resettable Zero-Knowledge , 1999, IACR Cryptol. ePrint Arch..
[17] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[18] Oded Goldreich,et al. The Foundations of Cryptography - Volume 2: Basic Applications , 2001 .
[19] Silvio Micali,et al. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.
[20] Yehuda Lindell. Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation , 2001, CRYPTO.
[21] Ran Canetti,et al. Resettable zero-knowledge (extended abstract) , 2000, STOC '00.