Omer Reingold

Ron D. Rothblum

Udi Wieder

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

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

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Deterministic Coupon Collection and Better Strong Dispersers.

[BibT_eX]

[DOI]

Raghu Meka

Yuan Zhou

Proceedings of the Approximation, 2014

2013

Pseudorandomness for Regular Branching Programs via Fourier Analysis.

[BibT_eX]

[DOI]

Thomas Steinke

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012

DNF Sparsification and a Faster Deterministic Counting.

[BibT_eX]

[DOI]

Parikshit Gopalan

Raghu Meka

Electron. Colloquium Comput. Complex., 2012

Fairness through awareness.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

Better Pseudorandom Generators from Milder Pseudorandom Restrictions.

[BibT_eX]

[DOI]

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

Incremental Deterministic Public-Key Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

DNF Sparsification and a Faster Deterministic Counting Algorithm.

[BibT_eX]

[DOI]

Parikshit Gopalan

Raghu Meka

Proceedings of the 27th Conference on Computational Complexity, 2012

2011

Pseudorandom generators for combinatorial shapes.

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Only valuable experts can be valued.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

Balls and Bins: Smaller Hash Families and Faster Evaluation.

[BibT_eX]

[DOI]

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

Partial exposure in large games.

[BibT_eX]

[DOI]

Ronen Gradwohl

Games Econ. Behav., 2010

Efficiency improvements in constructing pseudorandom generators from one-way functions.

[BibT_eX]

[DOI]

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

The Limits of Two-Party Differential Privacy.

[BibT_eX]

[DOI]

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Universal One-Way Hash Functions via Inaccessible Entropy.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

2009

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

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

Players' Effects Under Limited Independence.

[BibT_eX]

[DOI]

Math. Oper. Res., 2009

Derandomized Constructions of <i>k</i>-Wise (Almost) Independent Permutations.

[BibT_eX]

[DOI]

Eyal Kaplan

Algorithmica, 2009

Inaccessible entropy.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

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

[BibT_eX]

[DOI]

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Computational Differential Privacy.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2009

Pseudorandom Bit Generators That Fool Modular Sums.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2009

How Well Do Random Walks Parallelize?.

[BibT_eX]

[DOI]

Klim Efremenko

Proceedings of the Approximation, 2009

2008

Undirected connectivity in log-space.

[BibT_eX]

[DOI]

J. ACM, 2008

Fault tolerance in large games.

[BibT_eX]

[DOI]

Ronen Gradwohl

Proceedings of the Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), 2008

Dense Subsets of Pseudorandom Sets.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007

Statistically-hiding commitment from any one-way function.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

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

[BibT_eX]

[DOI]

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 2007

A New Interactive Hashing Theorem.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 2007

S-T Connectivity on Digraphs with a Known Stationary Distribution.

[BibT_eX]

[DOI]

Kai-Min Chung

Proceedings of the 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 2007

2006

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

[BibT_eX]

[DOI]

Luca Trevisan

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions.

[BibT_eX]

[DOI]

Danny Harnik

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

On the Power of the Randomized Iterate.

[BibT_eX]

[DOI]

Danny Harnik

Proceedings of the Advances in Cryptology, 2006

2005

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

[BibT_eX]

[DOI]

Luca Trevisan

Electron. Colloquium Comput. Complex., 2005

Tight bounds for shared memory systems accessed by Byzantine processes.

[BibT_eX]

[DOI]

Distributed Comput., 2005

Keyword Search and Oblivious Pseudorandom Functions.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Undirected ST-connectivity in log-space.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

On Robust Combiners for Oblivious Transfer and Other Primitives.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

Derandomized Constructions of k-Wise (Almost) Independent Permutations.

[BibT_eX]

[DOI]

Eyal Kaplan

Proceedings of the Approximation, 2005

On the Error Parameter of Dispersers.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2005

2004

Just fast keying: Key agreement in a hostile internet.

[BibT_eX]

[DOI]

ACM Trans. Inf. Syst. Secur., 2004

Notions of Reducibility between Cryptographic Primitives.

[BibT_eX]

[DOI]

Luca Trevisan

Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

Completeness in two-party secure computation: a computational view.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

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

[BibT_eX]

[DOI]

Irit Dinur

Proceedings of the 45th Symposium on Foundations of Computer Science, 2004

Immunizing Encryption Schemes from Decryption Errors.

[BibT_eX]

[DOI]

Cynthia Dwork

Proceedings of the Advances in Cryptology, 2004

2003

Extractors: optimal up to constant factors.

[BibT_eX]

[DOI]

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

2002

Pseudorandom Functions and Factoring.

[BibT_eX]

[DOI]

Alon Rosen

SIAM J. Comput., 2002

Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 16th International Conference, 2002

Randomness Conductors and Constant-Degree Lossless Expanders.

[BibT_eX]

[DOI]

Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002

Streaming Computation of Combinatorial Objects.

[BibT_eX]

[DOI]

Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002

2001

Pseudo-Random Functions and Factoring

[BibT_eX]

[DOI]

Alon Rosen

Electron. Colloquium Comput. Complex., 2001

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

[BibT_eX]

[DOI]

Proceedings of the Security Protocols, 2001

Constructing pseudo-random permutations with a prescribed structure.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

On the Impossibility of Basing Trapdoor Functions on Trapdoor Predicates.

[BibT_eX]

[DOI]

Yael Gertner

Tal Malkin

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

Priced Oblivious Transfer: How to Sell Digital Goods.

[BibT_eX]

[DOI]

William Aiello

Yuval Ishai

Proceedings of the Advances in Cryptology, 2001

2000

Pseudo-random functions and factoring (extended abstract).

[BibT_eX]

[DOI]

Alon Rosen

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors.

[BibT_eX]

[DOI]

Avi Wigderson

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

Extracting Randomness via Repeated Condensing.

[BibT_eX]

[DOI]

Ronen Shaltiel

Avi Wigderson

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

The Relationship between Public Key Encryption and Oblivious Transfer.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999

On the Construction of Pseudorandom Permutations: Luby-Rackoff Revisited.

[BibT_eX]

[DOI]

J. Cryptol., 1999

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

[BibT_eX]

[DOI]

Eli Biham

Dan Boneh

Inf. Process. Lett., 1999

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

[BibT_eX]

[DOI]

Ran Raz

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

On Recycling the Randomness of States in Space Bounded Computation.

[BibT_eX]

[DOI]

Ran Raz

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Error Reduction for Extractors.

[BibT_eX]

[DOI]

Ran Raz

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

Magic Functions.

[BibT_eX]

[DOI]

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

Distributed Pseudo-random Functions and KDCs.

[BibT_eX]

[DOI]

Benny Pinkas

Proceedings of the Advances in Cryptology, 1999

1998

Perfectly One-Way Probabilistic Hash Functions (Preliminary Version).

[BibT_eX]

[DOI]

Ran Canetti

Daniele Micciancio

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1998

1997

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

[BibT_eX]

[DOI]

Eli Biham

Dan Boneh

Electron. Colloquium Comput. Complex., 1997

On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1997

On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Number-theoretic Constructions of Efficient Pseudo-random Functions.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1995

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

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1995

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

[BibT_eX]

[DOI]