On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits
暂无分享,去创建一个
[1] Oded Goldreich,et al. How to construct constant-round zero-knowledge proof systems for NP , 1996, Journal of Cryptology.
[2] Leonid A. Levin,et al. Average Case Complete Problems , 1986, SIAM J. Comput..
[3] Oded Goldreich. On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits , 2007, TCC.
[4] Yehuda Lindell,et al. General Composition and Universal Composability in Secure Multiparty Computation , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[5] Oded Goldreich,et al. Foundations of Cryptography: List of Figures , 2001 .
[6] Ran Canetti,et al. Resettable zero-knowledge (extended abstract) , 2000, STOC '00.
[7] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[8] Yehuda Lindell,et al. Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs , 2008, Journal of Cryptology.
[9] Yehuda Lindell,et al. Session-Key Generation Using Human Passwords Only , 2001, Journal of Cryptology.
[10] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[11] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[12] Oded Goldreich,et al. Foundations of Cryptography: Basic Tools , 2000 .
[13] Silvio Micali,et al. Local zero knowledge , 2006, STOC '06.
[14] Boaz Barak,et al. How to go beyond the black-box simulation barrier , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[15] Oded Goldreich,et al. Universal arguments and their applications , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[16] Oded Goldreich,et al. Definitions and properties of zero-knowledge proof systems , 1994, Journal of Cryptology.
[17] Oded Goldreich,et al. Notes on Levin's Theory of Average-Case Complexity , 1997, Studies in Complexity and Cryptography.
[18] Oded Goldreich,et al. Foundations of Cryptography: Volume 2, Basic Applications , 2004 .
[19] Moni Naor,et al. Concurrent zero-knowledge , 2004, JACM.
[20] Oded Goldreich. Foundations of Cryptography: Index , 2001 .
[21] Oded Goldreich,et al. Foundations of Cryptography: Volume 1, Basic Tools , 2001 .
[22] Silvio Micali,et al. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[23] Yehuda Lindell,et al. Strict Polynomial-Time in Simulation and Extraction , 2004, SIAM J. Comput..
[24] Silvio Micali,et al. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.
[25] Ran Canetti,et al. Resettable Zero-Knowledge , 1999, IACR Cryptol. ePrint Arch..