NSF CCF-1116616

Bibliographic References tagged with NSF CCF-1116616

Not finding what you're looking for? Try using Advanced Search.
Not finding what you're looking for? Try using Advanced Search.
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. “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.
Vadhan, Salil, and Colin Jia Zheng. “Characterizing Pseudoentropy and Simplifying Pseudorandom Generator Constructions”. In Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC ‘12), 817-36. ACM, 2012.
Vadhan, Salil, and Colin Jia Zheng. “Characterizing Pseudoentropy and Simplifying Pseudorandom Generator Constructions”. In Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC ‘12), 817-36. ACM, 2012.
Dodis, Yevgeniy, Adriana López-Alt, Ilya Mironov, and Salil Vadhan. “Differential Privacy With Imperfect Randomness”. In Ran Canetti and Rei Safavi-Naini, Editors, Proceedings of the 32nd International Cryptology Conference (CRYPTO ‘12), Lecture Notes on Computer Science, 7417:497-516. Springer-Verlag, 2012.
Dodis, Yevgeniy, Adriana López-Alt, Ilya Mironov, and Salil Vadhan. “Differential Privacy With Imperfect Randomness”. In Ran Canetti and Rei Safavi-Naini, Editors, Proceedings of the 32nd International Cryptology Conference (CRYPTO ‘12), Lecture Notes on Computer Science, 7417:497-516. Springer-Verlag, 2012.
Gopalan, Parikshit, Raghu Meka, Omer Reingold, Luca Tevisan, and Salil Vadhan. “Better Pseudorandom Generators via Milder Pseudorandom Restrictions”. In Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS ‘12), 120-29. IEEE, 2012.
Gopalan, Parikshit, Raghu Meka, Omer Reingold, Luca Tevisan, and Salil Vadhan. “Better Pseudorandom Generators via Milder Pseudorandom Restrictions”. In Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS ‘12), 120-29. IEEE, 2012.
Raghunathan, Ananth, Gil Segev, and Salil P. Vadhan. “Deterministic Public-Key Encryption for Adaptively-Chosen Plaintext Distributions”. Journal of Cryptology 31, no. 4 (2018): 1012-63.
Raghunathan, Ananth, Gil Segev, and Salil P. Vadhan. “Deterministic Public-Key Encryption for Adaptively-Chosen Plaintext Distributions”. Journal of Cryptology 31, no. 4 (2018): 1012-63.
Vadhan, Salil, and Colin Jia Zheng. “A Uniform Min-Max Theorem With Applications in Cryptography”. In Ran Canetti and Juan Garay, Editors, Advances in Cryptology—CRYPTO ‘13, Lecture Notes on Computer Science, 8042:93-110. Springer Verlag, Lecture Notes in Computer Science, 2013.
Vadhan, Salil, and Colin Jia Zheng. “A Uniform Min-Max Theorem With Applications in Cryptography”. In Ran Canetti and Juan Garay, Editors, Advances in Cryptology—CRYPTO ‘13, Lecture Notes on Computer Science, 8042:93-110. Springer Verlag, Lecture Notes in Computer Science, 2013.
Reingold, Omer, Thomas Steinke, and Salil Vadhan. “Pseudorandomness for Regular Branching Programs via Fourier Analysis”. In Sofya Raskhodnikova and José Rolim, Editors, Proceedings of the 17th International Workshop on Randomization and Computation (RANDOM ‘13), Lecture Notes in Computer Science, 8096:655-70. Springer-Verlag, 2013.
Reingold, Omer, Thomas Steinke, and Salil Vadhan. “Pseudorandomness for Regular Branching Programs via Fourier Analysis”. In Sofya Raskhodnikova and José Rolim, Editors, Proceedings of the 17th International Workshop on Randomization and Computation (RANDOM ‘13), Lecture Notes in Computer Science, 8096:655-70. Springer-Verlag, 2013.
Gopalan, Parikshit, Salil Vadhan, and Yuan Zhou. “Locally Testable Codes and Cayley Graphs”. In In Moni Naor, Editor, Innovations in Theoretical Computer Science (ITCS ‘14), 81-92. ACM, 2014.
Gopalan, Parikshit, Salil Vadhan, and Yuan Zhou. “Locally Testable Codes and Cayley Graphs”. In In Moni Naor, Editor, Innovations in Theoretical Computer Science (ITCS ‘14), 81-92. ACM, 2014.
Steinke, Thomas, Salil Vadhan, and Andrew Wan. “Pseudorandomness and Fourier Growth Bounds for Width 3 Branching Programs”. Theory of Computing – Special Issue on APPROX-RANDOM 2014 13, no. 12 (2017): 1-50.
Steinke, Thomas, Salil Vadhan, and Andrew Wan. “Pseudorandomness and Fourier Growth Bounds for Width 3 Branching Programs”. Theory of Computing – Special Issue on APPROX-RANDOM 2014 13, no. 12 (2017): 1-50.