Pseudorandomness

Bibliographic References tagged with Pseudorandomness

Not finding what you're looking for? Try using Advanced Search.
Not finding what you're looking for? Try using Advanced Search.
Canonne, Clément L., Francis E. Su, and Salil P. Vadhan. “The Randomness Complexity of Differential Privacy”. In 16th Innovations in Theoretical Computer Science Conference (ITCS 2025). Columbia University, New York, New York, United States: Leibniz International Proceedings in Informatics (LIPIcs), Volume 325, pp. 27:1-27:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.ITCS.2025.27.
Canonne, Clément L., Francis E. Su, and Salil P. Vadhan. “The Randomness Complexity of Differential Privacy”. In 16th Innovations in Theoretical Computer Science Conference (ITCS 2025). Columbia University, New York, New York, United States: Leibniz International Proceedings in Informatics (LIPIcs), Volume 325, pp. 27:1-27:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.ITCS.2025.27.
Casacuberta, Sílvia, Cynthia Dwork, and Salil Vadhan. “Complexity-Theoretic Implications of Multicalibration”, 2023.
Casacuberta, Sílvia, Cynthia Dwork, and Salil Vadhan. “Complexity-Theoretic Implications of Multicalibration”, 2023.
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.
Hoza, William M., Edward Pyne, and Salil Vadhan. “Limitations of the Impagliazzo–Nisan–Wigderson Pseudorandom Generator Against Permutation Branching Programs”. Algorithmica 86:3153-3185, no. Special Issue on COCOON ’21 (2024).
Hoza, William M., Edward Pyne, and Salil Vadhan. “Limitations of the Impagliazzo–Nisan–Wigderson Pseudorandom Generator Against Permutation Branching Programs”. Algorithmica 86:3153-3185, no. Special Issue on COCOON ’21 (2024).
Doron, Dean, Raghu Meka, Omer Reingold, Avishay Tal, and Salil Vadhan. “Pseudorandom Generators for Read-Once Monotone Branching Programs”. APPROX//RANDOM/2021. Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl Leibniz-Zentrum für Informatik , 2021.
Doron, Dean, Raghu Meka, Omer Reingold, Avishay Tal, and Salil Vadhan. “Pseudorandom Generators for Read-Once Monotone Branching Programs”. APPROX//RANDOM/2021. Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl Leibniz-Zentrum für Informatik , 2021.
Pyne, Edward, and Salil Vadhan. “Pseudodistributions That Beat All Pseudorandom Generators”. 36th Annual Computational Complexity Conference (CCC ’21) . Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl Leibniz-Zentrum für Informatik , 2021.
Pyne, Edward, and Salil Vadhan. “Pseudodistributions That Beat All Pseudorandom Generators”. 36th Annual Computational Complexity Conference (CCC ’21) . Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl Leibniz-Zentrum für Informatik , 2021.
Hoza, William M., Edward Pyne, and Salil Vadhan. “Pseudorandom Generators for Unbounded-Width Permutation Branching Programs”. 12th Innovations in Theoretical Computer Science (ITCS ’21) . Leibniz International Proceedings in Informatics (LIPIcs), 2021.
Hoza, William M., Edward Pyne, and Salil Vadhan. “Pseudorandom Generators for Unbounded-Width Permutation Branching Programs”. 12th Innovations in Theoretical Computer Science (ITCS ’21) . Leibniz International Proceedings in Informatics (LIPIcs), 2021.
Haitner, Iftach, Omer Reingold, Salil Vadhan, and Hoeteck Wee. “Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from One-Way Functions”. ArXiv: 2010.05586 [cs.CR], 2020.
Haitner, Iftach, Omer Reingold, Salil Vadhan, and Hoeteck Wee. “Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from One-Way Functions”. ArXiv: 2010.05586 [cs.CR], 2020.
Kamp, Jesse, Anup Rao, Salil Vadhan, and David Zuckerman. “Deterministic Extractors for Small-Space Sources”. Journal of Computer and System Sciences 77, no. 1 (2011): 191-220.
Kamp, Jesse, Anup Rao, Salil Vadhan, and David Zuckerman. “Deterministic Extractors for Small-Space Sources”. Journal of Computer and System Sciences 77, no. 1 (2011): 191-220.
Haitner, Iftach, and Salil Vadhan. “The Many Entropies in One-Way Functions”. In Tutorials on the Foundations of Cryptography, 159-217. Springer, Yehuda Lindell, ed., 2017.
Haitner, Iftach, and Salil Vadhan. “The Many Entropies in One-Way Functions”. In Tutorials on the Foundations of Cryptography, 159-217. Springer, Yehuda Lindell, ed., 2017.