Computational Complexity

Bibliographic References tagged with Computational Complexity

Not finding what you're looking for? Try using Advanced Search.
Not finding what you're looking for? Try using Advanced Search.
Mahmoody, Mohammad, Tal Moran, and Salil Vadhan. “Publicly Verifiable Proofs of Sequential Work”. In Innovations in Theoretical Computer Science (ITCS ‘13), 373-88. ACM, 2013.
Mahmoody, Mohammad, Tal Moran, and Salil Vadhan. “Publicly Verifiable Proofs of Sequential Work”. In Innovations in Theoretical Computer Science (ITCS ‘13), 373-88. ACM, 2013.
Dodis, Yevgeniy, Thomas Ristenpart, and Salil Vadhan. “Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources”. In Ronald Cramer, Editor, Proceedings of the 9th IACR Theory of Cryptography Conference (TCC ‘12), Lecture Notes on Computer Science, 7194:618-35. Springer-Verlag, 2012.
Dodis, Yevgeniy, Thomas Ristenpart, and Salil Vadhan. “Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources”. In Ronald Cramer, Editor, Proceedings of the 9th IACR Theory of Cryptography Conference (TCC ‘12), Lecture Notes on Computer Science, 7194:618-35. Springer-Verlag, 2012.
Mahmoody, Mohammad, Tal Moran, and Salil Vadhan. “Time-Lock Puzzles in the Random Oracle Model”. In P. Rogaway, Editor, Advances in Cryptology—CRYPTO ‘11, Lecture Notes in Computer Science, 6841:39-50. Springer-Verlag, 2011.
Mahmoody, Mohammad, Tal Moran, and Salil Vadhan. “Time-Lock Puzzles in the Random Oracle Model”. In P. Rogaway, Editor, Advances in Cryptology—CRYPTO ‘11, Lecture Notes in Computer Science, 6841:39-50. Springer-Verlag, 2011.
Dvir, Zeev, Dan Gutfreund, Guy Rothblum, and Salil Vadhan. “On Approximating the Entropy of Polynomial Mappings”. In Proceedings of the Second Symposium on Innovations in Computer Science (ICS 2011), 460-75. Tsinghua University Press, 2011.
Dvir, Zeev, Dan Gutfreund, Guy Rothblum, and Salil Vadhan. “On Approximating the Entropy of Polynomial Mappings”. In Proceedings of the Second Symposium on Innovations in Computer Science (ICS 2011), 460-75. Tsinghua University Press, 2011.
McGregor, Andrew, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, and Salil Vadhan. “The Limits of Two-Party Differential Privacy”. In Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS ‘10), 81-90. IEEE, 2010.
McGregor, Andrew, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, and Salil Vadhan. “The Limits of Two-Party Differential Privacy”. In Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS ‘10), 81-90. IEEE, 2010.
Chung, Kai-Min, Yael Kalai, and Salil Vadhan. “Improved Delegation of Computation Using Fully Homomorphic Encryption”. In T. Rabin, Editor, Advances in Cryptology—CRYPTO ‘10, Lecture Notes in Computer Science, 6223:483-501. Springer-Verlag, 2010.
Chung, Kai-Min, Yael Kalai, and Salil Vadhan. “Improved Delegation of Computation Using Fully Homomorphic Encryption”. In T. Rabin, Editor, Advances in Cryptology—CRYPTO ‘10, Lecture Notes in Computer Science, 6223:483-501. Springer-Verlag, 2010.
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.
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.
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.
Lovett, Shachar, Omer Reingold, Luca Trevisan, and Salil Vadhan. “Pseudorandom Bit Generators That Fool Modular Sums”. In Proceedings of the 13th International Workshop on Randomization and Computation (RANDOM ‘09), Lecture Notes in Computer Science, 5687:615-30. Springer-Verlag, 2009.
Lovett, Shachar, Omer Reingold, Luca Trevisan, and Salil Vadhan. “Pseudorandom Bit Generators That Fool Modular Sums”. In Proceedings of the 13th International Workshop on Randomization and Computation (RANDOM ‘09), Lecture Notes in Computer Science, 5687:615-30. Springer-Verlag, 2009.