DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Omer Reingold
Omer Reingold
Reproducibility and Pseudo-Determinism in Log-Space
FOCS 2005 Program SUNDAY October 23, 2005
Secure Multi-Party Computation in Practice
A Decade of Lattice Cryptography
Hard Communication Channels for Steganography
Algebraic Pseudorandom Functions with Improved Efficiency from the Augmented Cascade*
Omer Reingold, June 2017
Immunizing Encryption Schemes from Decryption Errors
Computational Hardness of Optimal Fair Computation: Beyond Minicrypt
Fall 2016 Dear Computer Science Alumni and Friends, These Are
Omer Reingold, June 2019
Trustworthy AI: a Computational Perspective
Omer Reingold, March 2018
Verifiable Random Functions
Computer Science and Its Impact on Our Future
Provably Secure Steganography
The Gödel Prize 2019 - Call for Nominations Deadline: February 15, 2019
Calibration for the (Computationally-Identifiable) Masses
Top View
List of Publications
Arxiv:2012.06421V2 [Cs.LG] 21 Jul 2021
Expander Codes
On Adaptive Distance Estimation
ADSA13 Final Report
Undirected ST-Connectivity in Log-Space PRELIMINARY VERSION
The Limits of Two-Party Differential Privacy
Lipics-ITCS-2019-0.Pdf (0.4
A Biography of Avi Wigderson
Lattice-Based Non-Interactive Argument Systems
Salil P. Vadhan
Salil P. Vadhan
Sponsored by IEEE Computer Society Technical Committee On
Calibrating Noise to Variance in Adaptive Data Analysis
Black-Box Separations for Differentially Private Protocols
Contents U U U
Breaking Generalized Diffie-Hellman Modulo a Composite Is No Easier
Barriers in Cryptography with Weak, Correlated and Leaky Sources
Academic Member Highlight Book Fall 2017
STOC 2005 Program Committee Selected Two Award Papers
Undirected Connectivity in Log-Space∗
Synthesizers and Their Application to the Parallel Construction of Pseudo
Deterministic Approximation of Random Walks in Small Space
2009 Karl Menger Award
Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors (Extended Abstract)
The Zig-Zag Product and Reingold's Theorem
Arxiv:1210.0049V1 [Cs.CC] 28 Sep 2012 Eerhslcnvalley
Advances in Cryptology EUROCRYPT 2004
Provably Secure Steganography
Randomness Conductors and Constant-Degree Lossless Expanders
09005.Wigdersonavi.2340.Pdf (0.1
Deterministic Approximation of Random Walks in Small Space
Safe Machine Learning
Guaranteed Validity for Empirical Approaches to Adaptive Data Analysis
Submission Data for 2020-2021 CORE Conference Ranking Process International Workshop on Randomization and Computation
Computer Science and Its Impact on Our Future
Association for Computing Machinery 2 Penn Plaza, Suite 701, New York
John Von Neumann
Randomness Efficient Steganography
Upper and Lower Bounds on Black-Box Steganography∗
On the Geometry of Two-Party Differentially-Private Protocols
The Apple PSI System
Reasoning About Knowledge
Undirected Connectivity in Log-Space∗
Efficient Selective-ID Secure Identity Based Encryption Without Random
Adaptive Hypothesis Testing