Cryptography

Bibliographic References tagged with Cryptography

Not finding what you're looking for? Try using Advanced Search.
Not finding what you're looking for? Try using Advanced Search.
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.
Ong, Shien Jin, David Parkes, Alon Rosen, and Salil Vadhan. “Fairness With an Honest Minority and a Rational Majority”. In O. Reingold, Editor, Proceedings of the Fourth Theory of Cryptography Conference (TCC ‘09), Lecture Notes in Computer Science, 5444:36-53. Springer-Verlag, 2009.
Ong, Shien Jin, David Parkes, Alon Rosen, and Salil Vadhan. “Fairness With an Honest Minority and a Rational Majority”. In O. Reingold, Editor, Proceedings of the Fourth Theory of Cryptography Conference (TCC ‘09), Lecture Notes in Computer Science, 5444:36-53. 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.
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.
Dwork, Cynthia, Moni Naor, Omer Reingold, Guy Rothblum, and Salil Vadhan. “On the Complexity of Differentially Private Data Release: Efficient Algorithms and Hardness Results”. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC ‘09), 381-90. ACM, 2009.
Dwork, Cynthia, Moni Naor, Omer Reingold, Guy Rothblum, and Salil Vadhan. “On the Complexity of Differentially Private Data Release: Efficient Algorithms and Hardness Results”. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC ‘09), 381-90. ACM, 2009.
Haitner, Iftach, Omer Reingold, Salil Vadhan, and Hoeteck Wee. “Inaccessible Entropy”. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC ‘09), 611-20. ACM, 2009.
Haitner, Iftach, Omer Reingold, Salil Vadhan, and Hoeteck Wee. “Inaccessible Entropy”. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC ‘09), 611-20. ACM, 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.
Mironov, Ilya, Omkant Pandey, Omer Reingold, and Salil Vadhan. “Computational Differential Privacy”. In S. Halevi, Editor, Advances in Cryptology—CRYPTO ‘09, Lecture Notes in Computer Science, 5677:126-42. Springer-Verlag, 2009.
Mironov, Ilya, Omkant Pandey, Omer Reingold, and Salil Vadhan. “Computational Differential Privacy”. In S. Halevi, Editor, Advances in Cryptology—CRYPTO ‘09, Lecture Notes in Computer Science, 5677:126-42. Springer-Verlag, 2009.
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.