NSF CNS-0430336

Bibliographic References tagged with NSF CNS-0430336

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.
Sanghvi, Saurabh, and Salil Vadhan. “The Round Complexity of Two-Party Random Selection”. SIAM Journal on Computing: Special Issue on STOC ’05 38, no. 2 (2008): 523-50.
Sanghvi, Saurabh, and Salil Vadhan. “The Round Complexity of Two-Party Random Selection”. SIAM Journal on Computing: Special Issue on STOC ’05 38, no. 2 (2008): 523-50.
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.
Gradwohl, Ronen, Salil Vadhan, and David Zuckerman. “Random Selection With an Adversarial Majority”. In Advances in Cryptology—CRYPTO ‘06, C. Dwork, Ed., 4117:409–426. Springer Verlag, Lecture Notes in Computer Science , 2006.
Gradwohl, Ronen, Salil Vadhan, and David Zuckerman. “Random Selection With an Adversarial Majority”. In Advances in Cryptology—CRYPTO ‘06, C. Dwork, Ed., 4117:409–426. Springer Verlag, Lecture Notes in Computer Science , 2006.
Nguyen, Minh-Huyen, Shien Jin Ong, and Salil Vadhan. “Statistical Zero-Knowledge Arguments for NP from Any One-Way Function”. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS ‘06), 3-13. IEEE, 2006.
Nguyen, Minh-Huyen, Shien Jin Ong, and Salil Vadhan. “Statistical Zero-Knowledge Arguments for NP from Any One-Way Function”. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS ‘06), 3-13. IEEE, 2006.
Ong, Shien Jin, and Salil Vadhan. “Zero Knowledge and Soundness Are Symmetric”. In Advances in Cryptology–EUROCRYPT ’07, 4515:187-209. Barcelona, Spain: Springer Verlag, Lecture Notes in Computer Science, M. Naor, ed., 2007.
Ong, Shien Jin, and Salil Vadhan. “Zero Knowledge and Soundness Are Symmetric”. In Advances in Cryptology–EUROCRYPT ’07, 4515:187-209. Barcelona, Spain: Springer Verlag, Lecture Notes in Computer Science, M. Naor, ed., 2007.
Canetti, Ran, Ron Rivest, Madhu Sudan, Luca Trevisan, Salil Vadhan, and Hoeteck Wee. “Amplifying Collision-Resistance: A Complexity-Theoretic Treatment”. In A. Menezes, Editor, Advances in Cryptology (CRYPTO ’07), 4622:264-83. Lecture Notes in Computer Science, Springer-Verlag, 2007.
Canetti, Ran, Ron Rivest, Madhu Sudan, Luca Trevisan, Salil Vadhan, and Hoeteck Wee. “Amplifying Collision-Resistance: A Complexity-Theoretic Treatment”. In A. Menezes, Editor, Advances in Cryptology (CRYPTO ’07), 4622:264-83. Lecture Notes in Computer Science, Springer-Verlag, 2007.
Chailloux, André, Dragos Florin Ciocan, Iordanis Kerenidis, and Salil Vadhan. “Interactive and Noninteractive Zero Knowledge Are Equivalent in the Help Model”. In Proceedings of the Third Theory of Cryptography Conference (TCC ’08), 4948:501-534. Springer-Verlag, Lecture Notes in Computer Science, 2008.
Chailloux, André, Dragos Florin Ciocan, Iordanis Kerenidis, and Salil Vadhan. “Interactive and Noninteractive Zero Knowledge Are Equivalent in the Help Model”. In Proceedings of the Third Theory of Cryptography Conference (TCC ’08), 4948:501-534. Springer-Verlag, Lecture Notes in Computer Science, 2008.
Ong, Shien Jin, and Salil Vadhan. “An Equivalence Between Zero Knowledge and Commitments.”. In R. Canetti, Editor, Proceedings of the Third Theory of Cryptography Conference (TCC ‘08), 4948:482-500. Springer Verlag, Lecture Notes in Computer Science, 2008.
Ong, Shien Jin, and Salil Vadhan. “An Equivalence Between Zero Knowledge and Commitments.”. In R. Canetti, Editor, Proceedings of the Third Theory of Cryptography Conference (TCC ‘08), 4948:482-500. Springer Verlag, Lecture Notes in Computer Science, 2008.