NSF CNS-0205423
Bibliographic References tagged with NSF CNS-0205423
Not finding what you're looking for? Try using Advanced Search.
Not finding what you're looking for? Try using Advanced Search.
Vadhan, Salil. “An Unconditional Study of Computational Zero Knowledge”. SIAM Journal on Computing: Special Issue on Randomness and Complexity 36, no. 4 (2006): 1160-1214.
Vadhan, Salil. “An Unconditional Study of Computational Zero Knowledge”. SIAM Journal on Computing: Special Issue on Randomness and Complexity 36, no. 4 (2006): 1160-1214.
Micciancio, Daniele, Shien Jin Ong, Amit Sahai, and Salil Vadhan. “Concurrent Zero Knowledge Without Complexity Assumptions”. In S. Halevi and T. Rabin, Eds., Proceedings of the Third Theory of Cryptography Conference (TCC ’06), 3876:1-20. New York, NY, USA: Springer Verlag, Lecture Notes in Computer Science, 2006.
Micciancio, Daniele, Shien Jin Ong, Amit Sahai, and Salil Vadhan. “Concurrent Zero Knowledge Without Complexity Assumptions”. In S. Halevi and T. Rabin, Eds., Proceedings of the Third Theory of Cryptography Conference (TCC ’06), 3876:1-20. New York, NY, USA: Springer Verlag, Lecture Notes in Computer Science, 2006.
Nguyen, Minh, and Salil Vadhan. “Zero Knowledge With Efficient Provers”. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC ‘06), 287-95. ACM, 2006.
Nguyen, Minh, and Salil Vadhan. “Zero Knowledge With Efficient Provers”. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC ‘06), 287-95. ACM, 2006.