Omer Reingold
Affiliations: Weizmann Institute of Science, Israel
According to our database^{1},
Omer Reingold
authored at least 120 papers
between 1995 and 2024.
Collaborative distances:
Collaborative distances:
Awards
ACM Fellow
ACM Fellow 2014, "For contributions to the study of pseudorandomness, derandomization, and cryptography.".
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on zbmath.org

on viaf.org

on id.loc.gov

on dl.acm.org
On csauthors.net:
Bibliography
2024
Proceedings of the 2024 ACMSIAM Symposium on Discrete Algorithms, 2024
Proceedings of the ThirtyEighth AAAI Conference on Artificial Intelligence, 2024
2023
CoRR, 2023
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023
Proceedings of the International Conference on Machine Learning, 2023
Proceedings of the 4th Symposium on Foundations of Responsible Computing, 2023
Proceedings of the 4th Symposium on Foundations of Responsible Computing, 2023
Proceedings of the 38th Computational Complexity Conference, 2023
2022
Bull. EATCS, 2022
CoRR, 2022
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022
Proceedings of the 3rd Symposium on Foundations of Responsible Computing, 2022
Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022
Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022
Beyond Bernoulli: Generating Random Outcomes that cannot be Distinguished from Nature.
Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022
2021
Theory Comput., 2021
Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space.
SIAM J. Comput., 2021
Electron. Colloquium Comput. Complex., 2021
Proceedings of the Approximation, 2021
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021
2020
Theory Comput., 2020
Electron. Colloquium Comput. Complex., 2020
Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from OneWay Functions.
CoRR, 2020
Commun. ACM, 2020
Proceedings of the 1st Symposium on Foundations of Responsible Computing, 2020
2019
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019
2018
J. Cryptol., 2018
Electron. Colloquium Comput. Complex., 2018
Electron. Colloquium Comput. Complex., 2018
Electron. Colloquium Comput. Complex., 2018
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018
Proceedings of the 35th International Conference on Machine Learning, 2018
2017
Improved Pseudorandomness for Unordered Branching Programs through Local Monotonicity.
Electron. Colloquium Comput. Complex., 2017
CoRR, 2017
Commun. ACM, 2017
Proceedings of the 26th International Conference on World Wide Web Companion, 2017
2016
J. Comput. Syst. Sci., 2016
Electron. Colloquium Comput. Complex., 2016
Proceedings of the Ninth ACM International Conference on Web Search and Data Mining, 2016
Proceedings of the ECAI 2016  22nd European Conference on Artificial Intelligence, 29 August2 September 2016, The Hague, The Netherlands, 2016
2015
Finding Collisions in Interactive Protocols  Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments.
SIAM J. Comput., 2015
Proceedings of the FortySeventh Annual ACM on Symposium on Theory of Computing, 2015
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015
Proceedings of the Advances in Cryptology  ASIACRYPT 2015  21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015
2014
J. Cryptol., 2014
Games Econ. Behav., 2014
Proceedings of the Automata, Languages, and Programming  41st International Colloquium, 2014
Proceedings of the Automata, Languages, and Programming  41st International Colloquium, 2014
Proceedings of the Approximation, 2014
2013
Electron. Colloquium Comput. Complex., 2013
Comput. Complex., 2013
2012
Electron. Colloquium Comput. Complex., 2012
Electron. Colloquium Comput. Complex., 2012
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012
2011
ACM Trans. Algorithms, 2011
Electron. Colloquium Comput. Complex., 2011
Electron. Colloquium Comput. Complex., 2011
Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC2011), 2011
2010
IACR Cryptol. ePrint Arch., 2010
Games Econ. Behav., 2010
Efficiency Improvements in Constructing Pseudorandom Generators from Oneway Functions.
Electron. Colloquium Comput. Complex., 2010
Electron. Colloquium Comput. Complex., 2010
2009
Statistically Hiding Commitments and Statistical ZeroKnowledge Arguments from Any OneWay Function.
SIAM J. Comput., 2009
Math. Oper. Res., 2009
Electron. Colloquium Comput. Complex., 2009
Algorithmica, 2009
On the complexity of differentially private data release: efficient algorithms and hardness results.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009
Proceedings of the Advances in Cryptology, 2009
Proceedings of the Approximation, 2009
Proceedings of the Approximation, 2009
2008
J. ACM, 2008
Electron. Colloquium Comput. Complex., 2008
2007
Finding Collisions in Interactive Protocols  A Tight Lower Bound on the Round Complexity of StatisticallyHiding Commitments.
Electron. Colloquium Comput. Complex., 2007
2006
SIAM J. Comput., 2006
J. Cryptol., 2006
IACR Cryptol. ePrint Arch., 2006
Electron. Colloquium Comput. Complex., 2006
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006
2005
Electron. Colloquium Comput. Complex., 2005
Electron. Colloquium Comput. Complex., 2005
Electron. Colloquium Comput. Complex., 2005
Distributed Comput., 2005
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005
Proceedings of the Advances in Cryptology, 2005
2004
ACM Trans. Inf. Syst. Secur., 2004
J. ACM, 2004
Electron. Colloquium Comput. Complex., 2004
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004
Proceedings of the Advances in Cryptology, 2004
2003
J. ACM, 2003
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003
2002
SIAM J. Comput., 2002
J. Cryptol., 2002
J. Comput. Syst. Sci., 2002
Proceedings of the Distributed Computing, 16th International Conference, 2002
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002
Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002
Proceedings of the 9th ACM Conference on Computer and Communications Security, 2002
2001
Electron. Colloquium Comput. Complex., 2001
Entropy Waves, the ZigZag Graph Product, and New ConstantDegree Expanders and Extractors
Electron. Colloquium Comput. Complex., 2001
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001
Proceedings of the Advances in Cryptology, 2001
2000
Electron. Colloquium Comput. Complex., 2000
Proceedings of the ThirtySecond Annual ACM Symposium on Theory of Computing, 2000
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000
1999
J. Cryptol., 1999
Synthesizers and Their Application to the Parallel Construction of PseudoRandom Functions.
J. Comput. Syst. Sci., 1999
Breaking Generalized DiffieHellmann Modulo a Composite is no Easier Than Factoring.
Inf. Process. Lett., 1999
Proceedings of the ThirtyFirst Annual ACM Symposium on Theory of Computing, 1999
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999
Proceedings of the Advances in Cryptology, 1999
1998
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998
From Unpredictability to Indistinguishability: A Simple Construction of PseudoRandom Functions from MACs (Extended Abstract).
Proceedings of the Advances in Cryptology, 1998
1997
Electron. Colloquium Comput. Complex., 1997
Electron. Colloquium Comput. Complex., 1997
On the Construction of PseudoRandom Permutations: LubyRackoff Revisited (Extended Abstract).
Proceedings of the TwentyNinth Annual ACM Symposium on the Theory of Computing, 1997
1995
Synthesizers and Their Application to the Parallel Construction of PsuedoRandom Functions.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995