Resettably-Sound Resettable Zero Knowledge in Constant Rounds
暂无分享,去创建一个
Rafail Ostrovsky | Ivan Visconti | Wutichai Chongchitmate | R. Ostrovsky | Ivan Visconti | Wutichai Chongchitmate
[1] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[2] Oded Goldreich,et al. Foundations of Cryptography: Basic Tools , 2000 .
[3] J. Kilian,et al. Concurrent and Resettable Zero-Knowledge in Poly-logarithmic Rounds [ Extended Abstract ] , 2001 .
[4] Giovanni Di Crescenzo,et al. Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model , 2004, CRYPTO.
[5] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[6] Kai-Min Chung,et al. Non-black-box simulation from one-way functions and applications to resettable security , 2013, STOC '13.
[7] Oded Goldreich,et al. On the foundations of cryptography , 2019, Providing Sound Foundations for Cryptography.
[8] Kai-Min Chung,et al. Constant-Round Concurrent Zero Knowledge from P-Certificates , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[9] Nir Bitansky,et al. ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation , 2015, TCC.
[10] Moni Naor,et al. Concurrent zero-knowledge , 2004, JACM.
[11] Amit Sahai,et al. Resettably Secure Computation , 2009, EUROCRYPT.
[12] Moni Naor,et al. Zaps and their applications , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[13] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[14] Kai-Min Chung,et al. Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation , 2015, CRYPTO.
[15] Oded Goldreich,et al. Universal arguments and their applications , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[16] Nir Bitansky,et al. On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation , 2015, SIAM J. Comput..
[17] Yunlei Zhao,et al. Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model , 2007, EUROCRYPT.
[18] Rafail Ostrovsky,et al. Simultaneous Resettability from One-Way Functions , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[19] Ran Canetti,et al. Resettable zero-knowledge (extended abstract) , 2000, STOC '00.
[20] Rafail Ostrovsky,et al. 4-Round Resettably-Sound Zero Knowledge , 2014, TCC.
[21] David Chaum,et al. Minimum Disclosure Proofs of Knowledge , 1988, J. Comput. Syst. Sci..
[22] Yehuda Lindell,et al. Resettably-sound zero-knowledge and its applications , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[23] Oded Goldreich,et al. Foundations of Cryptography: List of Figures , 2001 .
[24] Adi Shamir,et al. Witness indistinguishable and witness hiding protocols , 1990, STOC '90.
[25] Rafail Ostrovsky,et al. Simultaneously Resettable Arguments of Knowledge , 2012, TCC.
[26] Rafail Ostrovsky,et al. Simultaneous Resettability from Collision Resistance , 2012, Electron. Colloquium Comput. Complex..
[27] Dongdai Lin,et al. Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability , 2007, EUROCRYPT.
[28] Nir Bitansky,et al. On the impossibility of approximate obfuscation and applications to resettable cryptography , 2013, STOC '13.
[29] Boaz Barak,et al. How to go beyond the black-box simulation barrier , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[30] Oded Goldreich. Foundations of Cryptography: Index , 2001 .
[31] Rafail Ostrovsky,et al. Non-interactive Zaps and New Techniques for NIZK , 2006, CRYPTO.
[32] Ivan Visconti,et al. On Round-Optimal Zero Knowledge in the Bare Public-Key Model , 2012, EUROCRYPT.
[33] Amit Sahai,et al. Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[34] Silvio Micali,et al. Soundness in the Public-Key Model , 2001, CRYPTO.
[35] Rafail Ostrovsky,et al. Resettable Statistical Zero Knowledge , 2012, IACR Cryptol. ePrint Arch..
[36] Moni Naor,et al. Bit commitment using pseudorandomness , 1989, Journal of Cryptology.