NSF CNS-0831289

Bibliographic References tagged with NSF CNS-0831289

Not finding what you're looking for? Try using Advanced Search.
Not finding what you're looking for? Try using Advanced Search.
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.
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.
Haitner, Iftach, Thomas Holenstein, Omer Reingold, Salil Vadhan, and Hoeteck Wee. “Inaccessible Entropy II: IE Functions and Universal One-Way Hashing”. Theory of Computing 16, no. 8 (2020): 1-55.
Haitner, Iftach, Thomas Holenstein, Omer Reingold, Salil Vadhan, and Hoeteck Wee. “Inaccessible Entropy II: IE Functions and Universal One-Way Hashing”. Theory of Computing 16, no. 8 (2020): 1-55.
Haitner, Iftach, Omer Reingold, and Salil Vadhan. “Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions”. SIAM Journal on Computing 42, no. 3 (2013): 1405-30.
Haitner, Iftach, Omer Reingold, and Salil Vadhan. “Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions”. SIAM Journal on Computing 42, no. 3 (2013): 1405-30.
Dwork, Cynthia, Guy Rothblum, and Salil Vadhan. “Boosting and Differential Privacy”. In Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS ‘10), 51-60. IEEE, 2010.
Dwork, Cynthia, Guy Rothblum, and Salil Vadhan. “Boosting and Differential Privacy”. In Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS ‘10), 51-60. IEEE, 2010.
Ullman, Jon, and Salil Vadhan. “PCPs and the Hardness of Generating Synthetic Data”. Journal of Cryptology 33 (2020): 2078-2112.
Ullman, Jon, and Salil Vadhan. “PCPs and the Hardness of Generating Synthetic Data”. Journal of Cryptology 33 (2020): 2078-2112.