Proof Systems

Bibliographic References tagged with Proof Systems

Not finding what you're looking for? Try using Advanced Search.
Not finding what you're looking for? Try using Advanced Search.
Barak, Boaz, Yael Kalai, Ran Raz, Salil Vadhan, and Nisheeth Vishnoi. “On the Works of Avi Widgerson”. In The Abel Prize 2018-2022 (eds. Helge Holden and Ragni Piene), 2023rd ed. Springer, Cham, 2024.
Barak, Boaz, Yael Kalai, Ran Raz, Salil Vadhan, and Nisheeth Vishnoi. “On the Works of Avi Widgerson”. In The Abel Prize 2018-2022 (eds. Helge Holden and Ragni Piene), 2023rd ed. Springer, Cham, 2024.
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-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.
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.
Haitner, Iftach, Minh Nguyen, Shien Jin Ong, Omer Reingold, and Salil Vadhan. “Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function”. SIAM Journal on Computing 39, no. 3 (2009): 1153-1218.
Haitner, Iftach, Minh Nguyen, Shien Jin Ong, Omer Reingold, and Salil Vadhan. “Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function”. SIAM Journal on Computing 39, no. 3 (2009): 1153-1218.
Dodis, Yevgeniy, Salil Vadhan, and Daniel Wichs. “Proofs of Retrievability via Hardness Amplification”. In O. Reingold, Editor, Proceedings of the Fourth Theory of Cryptography Conference (TCC ‘09), Lecture Notes in Computer Science, 5444:109-27. Springer-Verlag, 2009.
Dodis, Yevgeniy, Salil Vadhan, and Daniel Wichs. “Proofs of Retrievability via Hardness Amplification”. In O. Reingold, Editor, Proceedings of the Fourth Theory of Cryptography Conference (TCC ‘09), Lecture Notes in Computer Science, 5444:109-27. Springer-Verlag, 2009.
Rothblum, Guy, and Salil Vadhan. “Are PCPs Inherent in Efficient Arguments?”. Computational Complexity 19, no. 2 (2010): 265-304.
Rothblum, Guy, and Salil Vadhan. “Are PCPs Inherent in Efficient Arguments?”. Computational Complexity 19, no. 2 (2010): 265-304.
Birrell, Eleanor, and Salil Vadhan. “Composition of Zero-Knowledge Proofs With Efficient Provers”. In Daniele Micciancio, Editor, Proceedings of the 7th IACR Theory of Cryptography Conference (TCC ‘10), Lecture Notes on Computer Science, 5978:572-87. Springer-Verlag, 2010.
Birrell, Eleanor, and Salil Vadhan. “Composition of Zero-Knowledge Proofs With Efficient Provers”. In Daniele Micciancio, Editor, Proceedings of the 7th IACR Theory of Cryptography Conference (TCC ‘10), Lecture Notes on Computer Science, 5978:572-87. Springer-Verlag, 2010.