Synthesizers and Their Application to the Parallel Construction of Psuedo-Random Functions. - Moni Naor; Omer Reingold (FOCS, 1995)

On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited (Extended Abstract). - Moni Naor; Omer Reingold (STOC, 1997)

On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited - Moni Naor; Omer Reingold (Electron. Colloquium Comput. Complex., 1997)

Generalized Diffie-Hellman Modulo a Composite is not Weaker than Factoring - Eli Biham; Dan Boneh; Omer Reingold (Electron. Colloquium Comput. Complex., 1997)

From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs (Extended Abstract). - Moni Naor; Omer Reingold (CRYPTO, 1998)

Perfectly One-Way Probabilistic Hash Functions (Preliminary Version). - Ran Canetti; Daniele Micciancio; Omer Reingold (STOC, 1998)

Distributed Pseudo-random Functions and KDCs. - Moni Naor; Benny Pinkas; Omer Reingold (EUROCRYPT, 1999)

Error Reduction for Extractors. - Ran Raz; Omer Reingold; Salil P. Vadhan (FOCS, 1999)

On Recycling the Randomness of States in Space Bounded Computation. - Ran Raz; Omer Reingold (STOC, 1999)

Breaking Generalized Diffie-Hellmann Modulo a Composite is no Easier Than Factoring. - Eli Biham; Dan Boneh; Omer Reingold (Inf. Process. Lett., 1999)

Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions. - Moni Naor; Omer Reingold (J. Comput. Syst. Sci., 1999)

On the Construction of Pseudorandom Permutations: Luby-Rackoff Revisited. - Moni Naor; Omer Reingold (J. Cryptol., 1999)

The Relationship between Public Key Encryption and Oblivious Transfer. - Yael Gertner; Sampath Kannan; Tal Malkin; Omer Reingold; Mahesh Viswanathan 001 (FOCS, 2000)

Pseudo-random functions and factoring (extended abstract). - Moni Naor; Omer Reingold; Alon Rosen (STOC, 2000)

Priced Oblivious Transfer: How to Sell Digital Goods. - William Aiello; Yuval Ishai; Omer Reingold (EUROCRYPT, 2001)

On the Impossibility of Basing Trapdoor Functions on Trapdoor Predicates. - Yael Gertner; Tal Malkin; Omer Reingold (FOCS, 2001)

Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors - Omer Reingold; Salil P. Vadhan; Avi Wigderson (Electron. Colloquium Comput. Complex., 2001)

Pseudo-Random Functions and Factoring - Moni Naor; Omer Reingold; Alon Rosen (Electron. Colloquium Comput. Complex., 2001)

Efficient, DoS-resistant, secure key exchange for internet protocols. - William Aiello; Steven M. Bellovin; Matt Blaze; John Ioannidis; Omer Reingold; Ran Canetti; Angelos D. Keromytis (CCS, 2002)

Streaming Computation of Combinatorial Objects. - Ziv Bar-Yossef; Luca Trevisan 001; Omer Reingold; Ronen Shaltiel (CCC, 2002)

Randomness conductors and constant-degree lossless expanders. - Michael R. Capalbo; Omer Reingold; Salil P. Vadhan; Avi Wigderson (STOC, 2002)

Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes. - Michael Merritt; Omer Reingold; Gadi Taubenfeld; Rebecca N. Wright (DISC, 2002)

Extracting all the Randomness and Reducing the Error in Trevisan's Extractors. - Ran Raz; Omer Reingold; Salil P. Vadhan (J. Comput. Syst. Sci., 2002)

Constructing Pseudo-Random Permutations with a Prescribed Structure. - Moni Naor; Omer Reingold (J. Cryptol., 2002)

Pseudorandom Functions and Factoring. - Moni Naor; Omer Reingold; Alon Rosen (SIAM J. Comput., 2002)

Extractors: optimal up to constant factors. - Chi-Jen Lu; Omer Reingold; Salil P. Vadhan; Avi Wigderson (STOC, 2003)

Completeness in Two-Party Secure Computation - A Computational View - Danny Harnik; Moni Naor; Omer Reingold; Alon Rosen (Electron. Colloquium Comput. Complex., 2003)

Magic Functions. - Cynthia Dwork; Moni Naor; Omer Reingold; Larry J. Stockmeyer (J. ACM, 2003)

Immunizing Encryption Schemes from Decryption Errors. - Cynthia Dwork; Moni Naor; Omer Reingold (EUROCRYPT, 2004)

Notions of Reducibility between Cryptographic Primitives. - Omer Reingold; Luca Trevisan 001; Salil P. Vadhan (TCC, 2004)

Undirected ST-Connectivity in Log-Space - Omer Reingold (Electron. Colloquium Comput. Complex., 2004)

Number-theoretic constructions of efficient pseudo-random functions. - Moni Naor; Omer Reingold (J. ACM, 2004)

Just fast keying: Key agreement in a hostile internet. - William Aiello; Steven M. Bellovin; Matt Blaze; Ran Canetti; John Ioannidis; Angelos D. Keromytis; Omer Reingold (ACM Trans. Inf. Syst. Secur., 2004)

On Robust Combiners for Oblivious Transfer and Other Primitives. - Danny Harnik; Joe Kilian; Moni Naor; Omer Reingold; Alon Rosen (EUROCRYPT, 2005)

Keyword Search and Oblivious Pseudorandom Functions. - Michael J. Freedman; Yuval Ishai; Benny Pinkas; Omer Reingold (TCC, 2005)

Tight bounds for shared memory systems accessed by Byzantine processes. - Noga Alon; Michael Merritt; Omer Reingold; Gadi Taubenfeld; Rebecca N. Wright (Distributed Comput., 2005)

Pseudorandom Walks in Biregular Graphs and the RL vs. L Problem - Omer Reingold; Luca Trevisan 001; Salil P. Vadhan (Electron. Colloquium Comput. Complex., 2005)

On the Error Parameter of Dispersers - Ronen Gradwohl; Guy Kindler; Omer Reingold; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2005)

Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions. - Iftach Haitner; Danny Harnik; Omer Reingold (ICALP (2), 2006)

Pseudorandom walks on regular digraphs and the RL vs. L problem. - Omer Reingold; Luca Trevisan 001; Salil P. Vadhan (STOC, 2006)

Derandomized Constructions of k-Wise (Almost) Independent Permutations - Eyal Kaplan; Moni Naor; Omer Reingold (Electron. Colloquium Comput. Complex., 2006)

A New Interactive Hashing Theorem. - Iftach Haitner; Omer Reingold (Electron. Colloquium Comput. Complex., 2006)

Statistically-Hiding Commitment from Any One-Way Function. - Iftach Haitner; Omer Reingold (IACR Cryptol. ePrint Arch., 2006)

Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem. - Irit Dinur; Omer Reingold (SIAM J. Comput., 2006)

Extracting Randomness via Repeated Condensing. - Omer Reingold; Ronen Shaltiel; Avi Wigderson (SIAM J. Comput., 2006)

S-T Connectivity on Digraphs with a Known Stationary Distribution. - Kai-Min Chung; Omer Reingold; Salil P. Vadhan (Electron. Colloquium Comput. Complex., 2007)

Finding Collisions in Interactive Protocols – A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. - Iftach Haitner; Jonathan J. Hoch; Omer Reingold; Gil Segev 001 (Electron. Colloquium Comput. Complex., 2007)

Dense Subsets of Pseudorandom Sets. - Omer Reingold; Luca Trevisan 001; Madhur Tulsiani; Salil P. Vadhan (Electron. Colloquium Comput. Complex., 2008)

Undirected connectivity in log-space. - Omer Reingold (J. ACM, 2008)

How Well Do Random Walks Parallelize?. - Klim Efremenko; Omer Reingold (APPROX-RANDOM, 2009)

Pseudorandom Bit Generators That Fool Modular Sums. - Shachar Lovett; Omer Reingold; Luca Trevisan 001; Salil P. Vadhan (APPROX-RANDOM, 2009)

Computational Differential Privacy. - Ilya Mironov; Omkant Pandey; Omer Reingold; Salil P. Vadhan (CRYPTO, 2009)

On the complexity of differentially private data release: efficient algorithms and hardness results. - Cynthia Dwork; Moni Naor; Omer Reingold; Guy N. Rothblum; Salil P. Vadhan (STOC, 2009)

Derandomized Constructions of k-Wise (Almost) Independent Permutations. - Eyal Kaplan; Moni Naor; Omer Reingold (Algorithmica, 2009)

Inaccessible Entropy. - Iftach Haitner; Omer Reingold; Salil P. Vadhan; Hoeteck Wee (Electron. Colloquium Comput. Complex., 2009)

Players' Effects Under Limited Independence. - Ronen Gradwohl; Omer Reingold; Ariel Yadin; Amir Yehudayoff (Math. Oper. Res., 2009)

Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function. - Iftach Haitner; Minh-Huyen Nguyen; Shien Jin Ong; Omer Reingold; Salil P. Vadhan (SIAM J. Comput., 2009)

Partial exposure in large games. - Ronen Gradwohl; Omer Reingold (Games Econ. Behav., 2010)

Universal One-Way Hash Functions via Inaccessible Entropy. - Iftach Haitner; Thomas Holenstein; Omer Reingold; Salil P. Vadhan; Hoeteck Wee (IACR Cryptol. ePrint Arch., 2010)

Only valuable experts can be valued. - Moshe Babaioff; Liad Blumrosen; Nicolas S. Lambert; Omer Reingold (EC, 2011)

The Limits of Two-Party Differential Privacy. - Andrew McGregor 001; Ilya Mironov; Toniann Pitassi; Omer Reingold; Kunal Talwar; Salil P. Vadhan (Electron. Colloquium Comput. Complex., 2011)

On the Power of the Randomized Iterate. - Iftach Haitner; Danny Harnik; Omer Reingold (SIAM J. Comput., 2011)

Fairness through awareness. - Cynthia Dwork; Moritz Hardt; Toniann Pitassi; Omer Reingold; Richard S. Zemel (ITCS, 2012)

DNF Sparsification and a Faster Deterministic Counting. - Parikshit Gopalan; Raghu Meka; Omer Reingold (Electron. Colloquium Comput. Complex., 2012)

Better pseudorandom generators from milder pseudorandom restrictions. - Parikshit Gopalan; Raghu Meka; Omer Reingold; Luca Trevisan 001; Salil P. Vadhan (Electron. Colloquium Comput. Complex., 2012)

DNF sparsification and a faster deterministic counting algorithm. - Parikshit Gopalan; Raghu Meka; Omer Reingold (Comput. Complex., 2013)

Pseudorandomness for Regular Branching Programs via Fourier Analysis. - Omer Reingold; Thomas Steinke 002; Salil P. Vadhan (Electron. Colloquium Comput. Complex., 2013)

Balls and Bins: Smaller Hash Families and Faster Evaluation. - L. Elisa Celis; Omer Reingold; Gil Segev 001; Udi Wieder (SIAM J. Comput., 2013)

Pseudorandom Generators for Combinatorial Shapes. - Parikshit Gopalan; Raghu Meka; Omer Reingold; David Zuckerman (SIAM J. Comput., 2013)

Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions. - Iftach Haitner; Omer Reingold; Salil P. Vadhan (SIAM J. Comput., 2013)

Deterministic Coupon Collection and Better Strong Dispersers. - Raghu Meka; Omer Reingold; Yuan Zhou 007 (APPROX-RANDOM, 2014)

Fast Pseudorandomness for Independence and Load Balancing - (Extended Abstract). - Raghu Meka; Omer Reingold; Guy N. Rothblum; Ron D. Rothblum (ICALP (1), 2014)

Pseudorandom Graphs in Data Structures. - Omer Reingold; Ron D. Rothblum; Udi Wieder (ICALP (1), 2014)

Fault tolerance in large games. - Ronen Gradwohl; Omer Reingold (Games Econ. Behav., 2014)

Pure Differential Privacy for Rectangle Queries via Private Partitions. - Cynthia Dwork; Moni Naor; Omer Reingold; Guy N. Rothblum (ASIACRYPT (2), 2015)

Generalization in Adaptive Data Analysis and Holdout Reuse. - Cynthia Dwork; Vitaly Feldman; Moritz Hardt; Toniann Pitassi; Omer Reingold; Aaron Roth 001 (NIPS, 2015)

Preserving Statistical Validity in Adaptive Data Analysis. - Cynthia Dwork; Vitaly Feldman; Moritz Hardt; Toniann Pitassi; Omer Reingold; Aaron Leon Roth (STOC, 2015)

Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments. - Iftach Haitner; Jonathan J. Hoch; Omer Reingold; Gil Segev 001 (SIAM J. Comput., 2015)

Adaptive Condorcet-Based Stopping Rules Can Be Efficient. - Omer Reingold; Nina Narodytska (ECAI, 2016)

Equality and Social Mobility in Twitter Discussion Groups. - Katherine Ellis; Moisés Goldszmidt; Gert R. G. Lanckriet; Nina Mishra; Omer Reingold (WSDM, 2016)

New techniques and tighter bounds for local computation algorithms. - Omer Reingold; Shai Vardi (J. Comput. Syst. Sci., 2016)

ERA: A Framework for Economic Resource Allocation for the Cloud. - Moshe Babaioff; Yishay Mansour; Noam Nisan; Gali Noti; Carlo Curino; Nar Ganapathy; Ishai Menache; Omer Reingold; Moshe Tennenholtz; Erez Timnat (WWW (Companion Volume), 2017)

Guilt-free data reuse. - Cynthia Dwork; Vitaly Feldman; Moritz Hardt; Toniann Pitassi; Omer Reingold; Aaron Roth 001 (Commun. ACM, 2017)

Calibration for the (Computationally-Identifiable) Masses. - Úrsula Hébert-Johnson; Michael P. Kim; Omer Reingold; Guy N. Rothblum (CoRR, 2017)

Improved Pseudorandomness for Unordered Branching Programs through Local Monotonicity. - Eshan Chattopadhyay; Pooya Hatami; Omer Reingold; Avishay Tal (Electron. Colloquium Comput. Complex., 2017)

Multicalibration: Calibration for the (Computationally-Identifiable) Masses. - Úrsula Hébert-Johnson; Michael P. Kim; Omer Reingold; Guy N. Rothblum (ICML, 2018)

Fairness Through Computationally-Bounded Awareness. - Michael P. Kim; Omer Reingold; Guy N. Rothblum (NeurIPS, 2018)

On the Communication Complexity of Key-Agreement Protocols. - Iftach Haitner; Noam Mazor; Rotem Oshman; Omer Reingold; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2018)

Pseudorandom Generators for Width-3 Branching Programs. - Raghu Meka; Omer Reingold; Avishay Tal (Electron. Colloquium Comput. Complex., 2018)

Efficient Batch Verification for UP. - Omer Reingold; Guy N. Rothblum; Ron Rothblum (Electron. Colloquium Comput. Complex., 2018)

Incremental Deterministic Public-Key Encryption. - Ilya Mironov; Omkant Pandey; Omer Reingold; Gil Segev 001 (J. Cryptol., 2018)

Tracking and Improving Information in the Service of Fairness. - Sumegha Garg; Michael P. Kim; Omer Reingold (EC, 2019)

Learning from Outcomes: Evidence-Based Rankings. - Cynthia Dwork; Michael P. Kim; Omer Reingold; Guy N. Rothblum; Gal Yona (FOCS, 2019)

Bounded-Leakage Differential Privacy. - Katrina Ligett; Charlotte Peale; Omer Reingold (FORC, 2020)

Through the lens of a passionate theoretician. - Omer Reingold (Commun. ACM, 2020)

Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from One-Way Functions. - Iftach Haitner; Omer Reingold; Salil P. Vadhan; Hoeteck Wee (CoRR, 2020)

Outcome Indistinguishability. - Cynthia Dwork; Michael P. Kim; Omer Reingold; Guy N. Rothblum; Gal Yona (Electron. Colloquium Comput. Complex., 2020)

Inaccessible Entropy II: IE Functions and Universal One-Way Hashing. - Iftach Haitner; Thomas Holenstein; Omer Reingold; Salil P. Vadhan; Hoeteck Wee (Theory Comput., 2020)

Robust Mean Estimation on Highly Incomplete Data with Arbitrary Outliers. - Lunjia Hu; Omer Reingold (AISTATS, 2021)

Pseudorandom Generators for Read-Once Monotone Branching Programs. - Dean Doron; Raghu Meka; Omer Reingold; Avishay Tal; Salil P. Vadhan (APPROX-RANDOM, 2021)

Monotone Branching Programs: Pseudorandomness and Circuit Complexity. - Dean Doron; Raghu Meka; Omer Reingold; Avishay Tal; Salil P. Vadhan (Electron. Colloquium Comput. Complex., 2021)

Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space. - Jack Murtagh; Omer Reingold; Aaron Sidford; Salil P. Vadhan (SIAM J. Comput., 2021)

Constant-Round Interactive Proofs for Delegating Computation. - Omer Reingold; Guy N. Rothblum; Ron D. Rothblum (SIAM J. Comput., 2021)

Deterministic Approximation of Random Walks in Small Space. - Jack Murtagh; Omer Reingold; Aaron Sidford; Salil P. Vadhan (Adv. Math. Commun., 2021)

Beyond Bernoulli: Generating Random Outcomes that cannot be Distinguished from Nature. - Cynthia Dwork; Michael P. Kim; Omer Reingold; Guy N. Rothblum; Gal Yona (ALT, 2022)

Multicalibrated Partitions for Importance Weights. - Parikshit Gopalan; Omer Reingold; Vatsal Sharan; Udi Wieder (ALT, 2022)

Metric Entropy Duality and the Sample Complexity of Outcome Indistinguishability. - Lunjia Hu; Charlotte Peale; Omer Reingold (ALT, 2022)

Leximax Approximations and Representative Cohort Selection. - Monika Henzinger; Charlotte Peale; Omer Reingold; Judy Hanwen Shen (FORC, 2022)

Omnipredictors. - Parikshit Gopalan; Adam Tauman Kalai; Omer Reingold; Vatsal Sharan; Udi Wieder (ITCS, 2022)

KL Divergence Estimation with Multi-group Attribution. - Parikshit Gopalan; Nina Narodytska; Omer Reingold; Vatsal Sharan; Udi Wieder (CoRR, 2022)

Bringing Research-Life to Centerstage. - Omer Reingold (Bull. EATCS, 2022)

Generative Models of Huge Objects. - Lunjia Hu; Inbal Livni Navon; Omer Reingold (CCC, 2023)

From the Real Towards the Ideal: Risk Prediction in a Better World. - Cynthia Dwork; Omer Reingold; Guy N. Rothblum (FORC, 2023)

Bidding Strategies for Proportional Representation in Advertisement Campaigns. - Inbal Livni Navon; Charlotte Peale; Omer Reingold; Judy Hanwen Shen (FORC, 2023)

Omnipredictors for Constrained Optimization. - Lunjia Hu; Inbal Rachel Livni Navon; Omer Reingold; Chutong Yang (ICML, 2023)

Loss Minimization Through the Lens Of Outcome Indistinguishability. - Parikshit Gopalan; Lunjia Hu; Michael P. Kim; Omer Reingold; Udi Wieder (ITCS, 2023)

Swap Agnostic Learning, or Characterizing Omniprediction via Multicalibration. - Parikshit Gopalan; Michael P. Kim; Omer Reingold (NeurIPS, 2023)

Characterizing notions of omniprediction via multicalibration. - Parikshit Gopalan; Michael P. Kim; Omer Reingold (CoRR, 2023)

Dissenting Explanations: Leveraging Disagreement to Reduce Model Overreliance. - Omer Reingold; Judy Hanwen Shen; Aditi Talati (AAAI, 2024)

Oracle Efficient Online Multicalibration and Omniprediction. - Sumegha Garg; Christopher Jung 001; Omer Reingold; Aaron Roth 001 (SODA, 2024)

Multiaccuracy for Subpopulation Calibration Over Distribution Shift in Medical Prediction Models. - Daniel Kapash; Noam Barda; Omer Reingold; Noa Dagan; Ran D. Balicer (CHIL, 2025)

OWA for Bipartite Assignments. - Jabari Hastings; Sigal Oren; Omer Reingold (FORC, 2025)

Fairness with respect to Stereotype Predictors: Impossibilities and Best Practices. - Inbal Rachel Livni Navon; Omer Reingold; Judy Hanwen Shen (Trans. Mach. Learn. Res., 2025)

How Global Calibration Strengthens Multiaccuracy. - Sílvia Casacuberta; Parikshit Gopalan; Varun Kanade; Omer Reingold (CoRR, 2025)

Accuracy vs. Accuracy: Computational Tradeoffs Between Classification Rates and Utility. - Noga Amit; Omer Reingold; Guy N. Rothblum (CoRR, 2025)

Representative Language Generation. - Charlotte Peale; Vinod Raman; Omer Reingold (CoRR, 2025)

On the Impossibility of Separating Intelligence from Judgment: The Computational Intractability of Filtering for AI Alignment. - Sarah Ball; Greg Gluch; Shafi Goldwasser; Frauke Kreuter; Omer Reingold; Guy N. Rothblum (CoRR, 2025)