Omer Reingold

发表

Erratum to: Theory of Cryptography

Omer Reingold, 2009 .

Adaptive Condorcet-Based Stopping Rules Can Be Efficient

Nina Narodytska, Omer Reingold, Nina Narodytska, 2016, European Conference on Artificial Intelligence.

Derandomized Constructions of k-Wise (Almost) Independent Permutations

Moni Naor, Omer Reingold, Eyal Kaplan, 2005, APPROX-RANDOM.

Theory of Cryptography

Omer Reingold, O. Reingold, Omer Reingold, 2009, Lecture Notes in Computer Science.

Distributed Pseudo-random Functions and KDCs

Moni Naor, Benny Pinkas, Omer Reingold, 1999, EUROCRYPT.

Error reduction for extractors

Ran Raz, Omer Reingold, Salil P. Vadhan, 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

Pseudorandom Bit Generators That Fool Modular Sums

Shachar Lovett, Luca Trevisan, Omer Reingold, 2009, APPROX-RANDOM.

Streaming computation of combinatorial objects

Luca Trevisan, Omer Reingold, Ziv Bar-Yossef, 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography

Omer Reingold, O. Reingold, 2009 .

Extracting all the Randomness and Reducing the Error in Trevisan's Extractors

Ran Raz, Omer Reingold, Salil P. Vadhan, 2002, J. Comput. Syst. Sci..

DNF Sparsification and a Faster Deterministic Counting Algorithm

Omer Reingold, Parikshit Gopalan, Raghu Meka, 2012, Computational Complexity Conference.

On the Power of the Randomized Iterate

Omer Reingold, Iftach Haitner, Danny Harnik, 2006, SIAM J. Comput..

DNF sparsification and a faster deterministic counting algorithm

Omer Reingold, Parikshit Gopalan, Raghu Meka, 2012, 2012 IEEE 27th Conference on Computational Complexity.

Dense Subsets of Pseudorandom Sets

Madhur Tulsiani, Luca Trevisan, Omer Reingold, 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

Number-theoretic constructions of efficient pseudo-random functions

Moni Naor, Omer Reingold, M. Naor, 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

Guilt-free data reuse

Toniann Pitassi, Vitaly Feldman, Omer Reingold, 2017, Commun. ACM.

Randomness conductors and constant-degree lossless expanders

Avi Wigderson, Omer Reingold, Salil P. Vadhan, 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

Efficient Batch Verification for UP

Ron Rothblum, Guy N. Rothblum, Omer Reingold, 2018, Electron. Colloquium Comput. Complex..

Equality and Social Mobility in Twitter Discussion Groups

Omer Reingold, Gert R. G. Lanckriet, Nina Mishra, 2016, WSDM.

Incremental Deterministic Public-Key Encryption

Omer Reingold, Gil Segev, Ilya Mironov, 2012, Journal of Cryptology.

On Robust Combiners for Oblivious Transfer and Other Primitives

Moni Naor, Joe Kilian, Omer Reingold, 2005, EUROCRYPT.

Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions

Moni Naor, Omer Reingold, 1999, J. Comput. Syst. Sci..

Perfectly One-Way Probabilistic Hash Functions

Ran Canetti, Omer Reingold, Daniele Micciancio, 1998, Symposium on the Theory of Computing.

Assignment testers: towards a combinatorial proof of the PCP-theorem

Omer Reingold, Irit Dinur, O. Reingold, 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

Deterministic Coupon Collection and Better Strong Dispersers

Yuan Zhou, Omer Reingold, Raghu Meka, 2014, APPROX-RANDOM.

Pseudorandom Generators for Combinatorial Shapes

Omer Reingold, David Zuckerman, Parikshit Gopalan, 2013, SIAM J. Comput..

Through the lens of a passionate theoretician

Omer Reingold, 2020, Commun. ACM.

Pseudorandom Graphs in Data Structures

Ron Rothblum, Omer Reingold, Udi Wieder, 2014, ICALP.

Extracting randomness via repeated condensing

Avi Wigderson, Omer Reingold, Ronen Shaltiel, 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

Pseudorandom Functions and Factoring

Moni Naor, Omer Reingold, Alon Rosen, 2002, SIAM J. Comput..

Just fast keying: Key agreement in a hostile internet

Angelos D. Keromytis, Ran Canetti, Matt Blaze, 2004, TSEC.

A New Interactive Hashing Theorem

Omer Reingold, Iftach Haitner, 2007, Computational Complexity Conference.

Extractors: optimal up to constant factors

Avi Wigderson, Omer Reingold, Chi-Jen Lu, 2003, STOC '03.

Players' Effects Under Limited Independence

Omer Reingold, Amir Yehudayoff, Ronen Gradwohl, 2009, Math. Oper. Res..

Partial exposure in large games

Omer Reingold, Ronen Gradwohl, O. Reingold, 2010, Games Econ. Behav..

Tight bounds for shared memory systems accessed by Byzantine processes

Noga Alon, Omer Reingold, Michael Merritt, 2002, Distributed Computing.

Fairness Through Computationally-Bounded Awareness

Guy N. Rothblum, Omer Reingold, Michael P. Kim, 2018, NeurIPS.

On the construction of pseudo-random permutations: Luby-Rackoff revisited (extended abstract)

Moni Naor, Omer Reingold, M. Naor, 1997, STOC '97.

Randomness conductors and constant-degree lossless expanders

Avi Wigderson, Omer Reingold, Salil P. Vadhan, 2002, STOC '02.

Multicalibration: Calibration for the (Computationally-Identifiable) Masses

Guy N. Rothblum, Omer Reingold, Michael P. Kim, 2018, ICML.

Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors

Avi Wigderson, Omer Reingold, Salil P. Vadhan, 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

Fairness through awareness pdf

Toniann Pitassi, Omer Reingold, Richard S. Zemel, 2011, ITCS '12.

Fault tolerance in large games

Omer Reingold, Ronen Gradwohl, 2014, Games Econ. Behav..

Balls and Bins: Smaller Hash Families and Faster Evaluation

Omer Reingold, Gil Segev, L. Elisa Celis, 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

On the impossibility of basing trapdoor functions on trapdoor predicates

Tal Malkin, Omer Reingold, Yael Gertner, 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

Efficient, DoS-Resistant, Secure Key Exchange for Internet Protocols

Angelos D. Keromytis, Ran Canetti, Matt Blaze, 2001, Security Protocols Workshop.

Deterministic Approximation of Random Walks in Small Space pdf

Omer Reingold, Salil P. Vadhan, Aaron Sidford, 2019, APPROX-RANDOM.

Pseudorandom Walks in Biregular Graphs and the RL vs. L Problem

Luca Trevisan, Omer Reingold, Salil P. Vadhan, 2005, Electron. Colloquium Comput. Complex..

The Limits of Two-Party Differential Privacy

Toniann Pitassi, Omer Reingold, Andrew McGregor, 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem

Omer Reingold, Irit Dinur, 2004, FOCS.

S-T Connectivity on Digraphs with a Known Stationary Distribution

Omer Reingold, Kai-Min Chung, Salil P. Vadhan, 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

Pseudorandom walks on regular digraphs and the RL vs. L problem

Luca Trevisan, Omer Reingold, Salil P. Vadhan, 2006, STOC '06.

Computational Differential Privacy

Omer Reingold, Ilya Mironov, Salil P. Vadhan, 2009, CRYPTO.

Incremental Deterministic Public-Key Encryption

Omer Reingold, Gil Segev, Ilya Mironov, 2012, EUROCRYPT.

A note on ex-tracting randomness from Santha-Vazirani sources

Avi Wigderson, Omer Reingold, Salil P. Vadhan, 2004 .

A New Interactive Hashing Theorem

Omer Reingold, Iftach Haitner, O. Reingold, 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

Pure Differential Privacy for Rectangle Queries via Private Partitions

Moni Naor, Guy N. Rothblum, Omer Reingold, 2015, ASIACRYPT.

Tracking and Improving Information in the Service of Fairness

Omer Reingold, Sumegha Garg, Michael P. Kim, 2019, EC.

Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from One-Way Functions pdf

Omer Reingold, Hoeteck Wee, Salil Vadhan, 2020, ArXiv.

Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions

Omer Reingold, Iftach Haitner, Danny Harnik, 2006, ICALP.

Statistically-hiding commitment from any one-way function

Omer Reingold, Iftach Haitner, O. Reingold, 2007, STOC '07.

Fast Pseudorandomness for Independence and Load Balancing - (Extended Abstract)

Ron Rothblum, Guy N. Rothblum, Omer Reingold, 2014, ICALP.

Efficiency improvements in constructing pseudorandom generators from one-way functions

Omer Reingold, Salil P. Vadhan, Iftach Haitner, 2010, STOC '10.

Synthesizers and their application to the parallel construction of pseudo-random functions

Moni Naor, Omer Reingold, M. Naor, 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

Derandomized Constructions of k-Wise (Almost) Independent Permutations

Moni Naor, Omer Reingold, Eyal Kaplan, 2005, Algorithmica.

Completeness in Two-Party Secure Computation: A Computational View

Moni Naor, Omer Reingold, Alon Rosen, 2004, STOC '04.

Notions of Reducibility between Cryptographic Primitives

Luca Trevisan, Omer Reingold, Salil P. Vadhan, 2004, TCC.

Fault tolerance in large games

Omer Reingold, Ronen Gradwohl, O. Reingold, 2008, EC '08.

On the Power of the Randomized Iterate

Omer Reingold, Iftach Haitner, Danny Harnik, 2011, SIAM J. Comput..

Bounded-Leakage Differential Privacy

Omer Reingold, Katrina Ligett, Charlotte Peale, 2020, FORC.

Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments

Omer Reingold, Gil Segev, Iftach Haitner, 2015, SIAM J. Comput..

Balls and Bins: Smaller Hash Families and Faster Evaluation

Omer Reingold, Gil Segev, L. Elisa Celis, 2011, FOCS.

Calibration for the (Computationally-Identifiable) Masses pdf

Guy N. Rothblum, Omer Reingold, Michael P. Kim, 2017, ArXiv.

Magic functions

Moni Naor, Omer Reingold, Cynthia Dwork, 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

Completeness in two-party secure computation: a computational view

Moni Naor, Omer Reingold, Alon Rosen, 2004, STOC.

Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes

Omer Reingold, Michael Merritt, Gadi Taubenfeld, 2002, DISC.

Magic Functions: In Memoriam: Bernard M. Dwork 1923--1998

Moni Naor, Omer Reingold, Cynthia Dwork, 2003, JACM.

Theory of cryptography : 6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009 : proceedings

Omer Reingold, 2009 .

Immunizing Encryption Schemes from Decryption Errors

Moni Naor, Omer Reingold, Cynthia Dwork, 2004, EUROCRYPT.

Learning from Outcomes: Evidence-Based Rankings

Guy N. Rothblum, Omer Reingold, Cynthia Dwork, 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).

Randomness Conductors and Constant-Degree Expansion Beyond the Degree / 2 Barrier

Omer Reingold, Salil P. Vadhan, Michael R. Capalbo, 2001 .

Undirected connectivity in log-space

Omer Reingold, O. Reingold, Omer Reingold, 2008, JACM.

Extracting Randomness via Repeated Condensing

Avi Wigderson, Omer Reingold, Ronen Shaltiel, 2006, SIAM J. Comput..

Constant-round interactive proofs for delegating computation

Ron Rothblum, Guy N. Rothblum, Omer Reingold, 2016, Electron. Colloquium Comput. Complex..

Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function

Omer Reingold, Salil P. Vadhan, Iftach Haitner, 2009, SIAM J. Comput..

Perfectly one-way probabilistic hashing

Ran Canetti, Omer Reingold, Daniele Micciancio, 1998 .

Generalization in Adaptive Data Analysis and Holdout Reuse

Toniann Pitassi, Vitaly Feldman, Omer Reingold, 2015, NIPS.

How Well Do Random Walks Parallelize?

Omer Reingold, Klim Efremenko, K. Efremenko, 2009, APPROX-RANDOM.

Pseudorandom generators for width-3 branching programs

Avishay Tal, Omer Reingold, Raghu Meka, 2018, Electron. Colloquium Comput. Complex..

DNF Sparsification and a Faster Deterministic Counting

Omer Reingold, Parikshit Gopalan, Raghu Meka, 2012, Electron. Colloquium Comput. Complex..

Perfectly one-way probabilistic hash functions (preliminary version)

Ran Canetti, Omer Reingold, Daniele Micciancio, 1998, STOC '98.

ERA: A Framework for Economic Resource Allocation for the Cloud

Carlo Curino, Moshe Tennenholtz, Moshe Babaioff, 2017, WWW.

On the complexity of differentially private data release: efficient algorithms and hardness results

Moni Naor, Guy N. Rothblum, Omer Reingold, 2009, STOC '09.

Undirected ST-connectivity in log-space

Omer Reingold, O. Reingold, Omer Reingold, 2005, STOC '05.

Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments

Omer Reingold, Gil Segev, Iftach Haitner, 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

The reusable holdout: Preserving validity in adaptive data analysis

Toniann Pitassi, Vitaly Feldman, Omer Reingold, 2015, Science.

Pseudorandomness for Regular Branching Programs via Fourier Analysis

Thomas Steinke, Omer Reingold, Salil P. Vadhan, 2013, APPROX-RANDOM.

From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs (Extended Abstract)

Moni Naor, Omer Reingold, M. Naor, 1998, CRYPTO.

Extracting all the randomness and reducing the error in Trevisan's extractors

Ran Raz, Omer Reingold, Salil P. Vadhan, 1999, STOC '99.

The relationship between public key encryption and oblivious transfer

Sampath Kannan, Tal Malkin, Omer Reingold, 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

Derandomization Beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space

Omer Reingold, Salil P. Vadhan, Aaron Sidford, 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

Only valuable experts can be valued

Moshe Babaioff, Omer Reingold, Liad Blumrosen, 2011, EC '11.

Inaccessible entropy

Omer Reingold, Hoeteck Wee, Salil P. Vadhan, 2009, STOC '09.

Pseudorandom generators for combinatorial shapes

Omer Reingold, David Zuckerman, Parikshit Gopalan, 2011, STOC '11.

Constant-Round Interactive Proofs for Delegating Computation

Guy N. Rothblum, Omer Reingold, Ron D. Rothblum, 2016, Electron. Colloquium Comput. Complex..

Priced Oblivious Transfer: How to Sell Digital Goods

Yuval Ishai, Omer Reingold, William Aiello, 2001, EUROCRYPT.

Constructing Pseudo-Random Permutations with a Prescribed Structure

Moni Naor, Omer Reingold, M. Naor, 2001, SODA '01.

Number-theoretic constructions of efficient pseudo-random functions

Moni Naor, Omer Reingold, 2004, JACM.

Efficiency improvements in constructing pseudorandom generators from one-way functions

Omer Reingold, Salil P. Vadhan, Iftach Haitner, 2010, STOC '10.

Better Pseudorandom Generators from Milder Pseudorandom Restrictions

Luca Trevisan, Omer Reingold, Parikshit Gopalan, 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

Improved pseudorandomness for unordered branching programs through local monotonicity

Avishay Tal, Omer Reingold, Pooya Hatami, 2017, Electron. Colloquium Comput. Complex..

Outcome indistinguishability

Guy N. Rothblum, Omer Reingold, Cynthia Dwork, 2020, Electron. Colloquium Comput. Complex..

Robust Mean Estimation on Highly Incomplete Data with Arbitrary Outliers pdf

Omer Reingold, Lunjia Hu, 2020, ArXiv.

New techniques and tighter bounds for local computation algorithms pdf

Omer Reingold, Shai Vardi, O. Reingold, 2014, J. Comput. Syst. Sci..

Generalized Diffie-Hellman Modulo a Composite is not Weaker than Factoring

Dan Boneh, Eli Biham, Omer Reingold, 1997, Electron. Colloquium Comput. Complex..

On recycling the randomness of states in space bounded computation

Ran Raz, Omer Reingold, O. Reingold, 1999, STOC '99.

Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques

Klaus Jansen, José D. P. Rolim, Omer Reingold, 2007 .

Efficient, DoS-resistant, secure key exchange for internet protocols

Angelos D. Keromytis, Ran Canetti, Matt Blaze, 2001, CCS '02.

Universal One-Way Hash Functions via Inaccessible Entropy

Omer Reingold, Hoeteck Wee, Salil Vadhan, 2010, EUROCRYPT.

On the Error Parameter of Dispersers

Guy Kindler, Omer Reingold, Amnon Ta-Shma, 2005, APPROX-RANDOM.

Breaking Generalized Diffie-Hellmann Modulo a Composite is no Easier Than Factoring

Dan Boneh, Eli Biham, Omer Reingold, 1999, Information Processing Letters.

On the Communication Complexity of Key-Agreement Protocols

Omer Reingold, Amir Yehudayoff, Iftach Haitner, 2018, Electron. Colloquium Comput. Complex..

Keyword Search and Oblivious Pseudorandom Functions

Benny Pinkas, Yuval Ishai, Omer Reingold, 2005, TCC.

S-T Connectivity on Digraphs with a Known Stationary Distribution

Omer Reingold, Kai-Min Chung, Salil Vadhan, 2007, Computational Complexity Conference.

Pseudo-random functions and factoring (extended abstract)

Moni Naor, Omer Reingold, Alon Rosen, 2000, STOC '00.

On the Construction of Pseudorandom Permutations: Luby—Rackoff Revisited

Moni Naor, Omer Reingold, M. Naor, 1996, Journal of Cryptology.

Preserving Statistical Validity in Adaptive Data Analysis

Toniann Pitassi, Vitaly Feldman, Omer Reingold, 2014, STOC.

Pseudorandom Generators for Read-Once Monotone Branching Programs

Avishay Tal, Omer Reingold, Dean Doron, 2021, APPROX-RANDOM.

Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space

Omer Reingold, Salil Vadhan, Aaron Sidford, 2021, SIAM J. Comput..

Monotone Branching Programs: Pseudorandomness and Circuit Complexity

Avishay Tal, Omer Reingold, Dean Doron, 2021, Electron. Colloquium Comput. Complex..

Multicalibrated Partitions for Importance Weights pdf

Omer Reingold, Vatsal Sharan, Parikshit Gopalan, 2021, ALT.

Omnipredictors

Adam Tauman Kalai, Omer Reingold, Vatsal Sharan, 2021, ITCS.

Deterministic Approximation of Random Walks in Small Space

Omer Reingold, Salil Vadhan, Aaron Sidford, 2021, Theory of Computing.

New Proofs of the Green-Tao-Ziegler Dense Model Theorem: An Exposition

Madhur Tulsiani, Luca Trevisan, Omer Reingold, 2008 .

A Pseudo-Random Encryption Mode

Moni Naor, Omer Reingold, 2014 .

Universal One-Way Hash Functions via Inaccessible

Omer Reingold, Hoeteck Wee, Salil Vadhan, 2010 .

A Pseudo-Random Encryption

Omer Reingold, ModeMoni Naor, 1997 .

Dense Subsets of Pseudorandom Sets (Extended Abstract)

Madhur Tulsiani, Luca Trevisan, Omer Reingold, 2008 .