Precise Bounded-Concurrent Zero-Knowledge in Almost Constant Rounds
暂无分享,去创建一个
Dawu Gu | Ning Ding | Bart Preneel | B. Preneel | Dawu Gu | Ning Ding
[1] Oded Goldreich,et al. Universal arguments and their applications , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[2] Rafael Pass,et al. Bounded-concurrent secure multi-party computation with a dishonest majority , 2004, STOC '04.
[3] Ralph C. Merkle,et al. A Certified Digital Signature , 1989, CRYPTO.
[4] Yehuda Lindell,et al. Bounded-concurrent secure two-party computation without setup assumptions , 2003, STOC '03.
[5] Rafael Pass,et al. A precise computational approach to knowledge , 2006 .
[6] Manuel Blum,et al. How to Prove a Theorem So No One Else Can Claim It , 2010 .
[7] David Chaum,et al. Minimum Disclosure Proofs of Knowledge , 1988, J. Comput. Syst. Sci..
[8] Amit Sahai,et al. Precise Concurrent Zero Knowledge , 2008, EUROCRYPT.
[9] Salil P. Vadhan,et al. Derandomization in Cryptography , 2003, SIAM J. Comput..
[10] Moni Naor,et al. Bit commitment using pseudorandomness , 1989, Journal of Cryptology.
[11] Richard E. Overill,et al. Foundations of Cryptography: Basic Tools , 2002, J. Log. Comput..
[12] Oded Goldreich,et al. Definitions and properties of zero-knowledge proof systems , 1994, Journal of Cryptology.
[13] Rafael Pass,et al. Bounded-concurrent secure two-party computation in a constant number of rounds , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[14] Boaz Barak,et al. Non-black-box Techniques in Cryptography , 2006, CSR.
[15] Moni Naor,et al. Universal one-way hash functions and their cryptographic applications , 1989, STOC '89.
[16] Adi Shamir,et al. Witness indistinguishable and witness hiding protocols , 1990, STOC '90.
[17] Oded Goldreich,et al. Concurrent zero-knowledge with timing, revisited , 2002, STOC '02.
[18] Silvio Micali,et al. Local zero knowledge , 2006, STOC '06.
[19] Boaz Barak,et al. How to go beyond the black-box simulation barrier , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[20] Amit Sahai,et al. Concurrent zero knowledge with logarithmic round-complexity , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[21] Joe Kilian,et al. On the Concurrent Composition of Zero-Knowledge Proofs , 1999, EUROCRYPT.
[22] Leonid A. Levin,et al. A hard-core predicate for all one-way functions , 1989, STOC '89.
[23] Joe Kilian,et al. Concurrent Zero-Knowledge in Poly-logarithmic Rounds , 2000, IACR Cryptol. ePrint Arch..
[24] Moni Naor,et al. Concurrent zero-knowledge , 1998, STOC '98.
[25] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.