Salil P. Vadhan

CoRR, 2024

Membership Inference Attacks and Privacy in Topic Modeling.

[BibT_eX]

[DOI]

Nico Manzonelli

Wanrong Zhang

CoRR, 2024

2023

On the Power of Regular and Permutation Branching Programs.

[BibT_eX]

[DOI]

Chin Ho Lee

Electron. Colloquium Comput. Complex., 2023

Complexity-Theoretic Implications of Multicalibration.

[BibT_eX]

[DOI]

Sílvia Casacuberta

Cynthia Dwork

CoRR, 2023

On the works of Avi Wigderson.

[BibT_eX]

[DOI]

CoRR, 2023

Singular Value Approximation and Reducing Directed to Undirected Graph Sparsification.

[BibT_eX]

[DOI]

AmirMahdi Ahmadinejad

CoRR, 2023

Concurrent Composition Theorems for Differential Privacy.

[BibT_eX]

[DOI]

Wanrong Zhang

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Singular Value Approximation and Sparsifying Random Walks on Directed Graphs.

[BibT_eX]

[DOI]

AmirMahdi Ahmadinejad

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Don't Look at the Data! How Differential Privacy Reconfigures the Practices of Data Science.

[BibT_eX]

[DOI]

Proceedings of the 2023 CHI Conference on Human Factors in Computing Systems, 2023

Concurrent Composition for Interactive Differential Privacy with Adaptive Privacy-Loss Parameters.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022

Differentially Private Simple Linear Regression.

[BibT_eX]

[DOI]

Proc. Priv. Enhancing Technol., 2022

Fourier Growth of Regular Branching Programs.

[BibT_eX]

[DOI]

Chin Ho Lee

Electron. Colloquium Comput. Complex., 2022

Pseudorandomness of Expander Random Walks for Symmetric Functions and Permutation Branching Programs.

[BibT_eX]

[DOI]

Louis Golowich

Electron. Colloquium Comput. Complex., 2022

Analyzing the Differentially Private Theil-Sen Estimator for Simple Linear Regression.

[BibT_eX]

[DOI]

Jayshree Sarathy

CoRR, 2022

Concurrent Composition Theorems for all Standard Variants of Differential Privacy.

[BibT_eX]

[DOI]

Wanrong Zhang

CoRR, 2022

Deterministic Approximation of Random Walks via Queries in Graphs of Unbounded Size.

[BibT_eX]

[DOI]

Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

Hypothesis Testing for Differentially Private Linear Regression.

[BibT_eX]

[DOI]

Daniel Alabi

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Widespread Underestimation of Sensitivity in Differentially Private Libraries and How to Fix It.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021

Deterministic Approximation of Random Walks in Small Space.

[BibT_eX]

[DOI]

Theory Comput., 2021

Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space.

[BibT_eX]

[DOI]

SIAM J. Comput., 2021

Concurrent Composition of Differential Privacy.

[BibT_eX]

[DOI]

Tianhao Wang

IACR Cryptol. ePrint Arch., 2021

Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator against Permutation Branching Programs.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2021

Pseudodistributions That Beat All Pseudorandom Generators.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2021

Monotone Branching Programs: Pseudorandomness and Circuit Complexity.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2021

Canonical Noise Distributions and Private Hypothesis Tests.

[BibT_eX]

[DOI]

Jordan Awan

CoRR, 2021

Pseudodistributions That Beat All Pseudorandom Generators (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 36th Computational Complexity Conference, 2021

Pseudorandom Generators for Read-Once Monotone Branching Programs.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2021

2020

Inaccessible Entropy II: IE Functions and Universal One-Way Hashing.

[BibT_eX]

[DOI]

Theory Comput., 2020

Privacy Games.

[BibT_eX]

[DOI]

Yiling Chen

Or Sheffet

ACM Trans. Economics and Comput., 2020

PCPs and the Hardness of Generating Synthetic Data.

[BibT_eX]

[DOI]

J. Cryptol., 2020

Pseudorandom Generators for Unbounded-Width Permutation Branching Programs.

[BibT_eX]

[DOI]

William Hoza

Electron. Colloquium Comput. Complex., 2020

Spectral Sparsification via Bounded-Independence Sampling.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

High-precision Estimation of Random Walks in Small Space.

[BibT_eX]

[DOI]

AmirMahdi Ahmadinejad

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

When Simple Hash Functions Suffice.

[BibT_eX]

[DOI]

Michael Mitzenmacher

Proceedings of the Beyond the Worst-Case Analysis of Algorithms, 2020

2019

Differential Privacy on Finite Computers.

[BibT_eX]

[DOI]

Victor Balcer

J. Priv. Confidentiality, 2019

Unifying computational entropies via Kullback-Leibler divergence.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Computational entropy.

[BibT_eX]

[DOI]

Proceedings of the Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, 2019

2018

The Complexity of Computing the Optimal Composition of Differential Privacy.

[BibT_eX]

[DOI]

Jack Murtagh

Theory Comput., 2018

Fingerprinting Codes and the Price of Approximate Differential Privacy.

[BibT_eX]

[DOI]

Mark Bun

SIAM J. Comput., 2018

Deterministic Public-Key Encryption for Adaptively-Chosen Plaintext Distributions.

[BibT_eX]

[DOI]

Ananth Raghunathan

Gil Segev

J. Cryptol., 2018

A Tight Lower Bound for Entropy Flattening.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2018

Usable Differential Privacy: A Case Study with PSI.

[BibT_eX]

[DOI]

CoRR, 2018

Finite Sample Differentially Private Confidence Intervals.

[BibT_eX]

[DOI]

Vishesh Karwa

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

2017

Pseudorandomness and Fourier-Growth Bounds for Width-3 Branching Programs.

[BibT_eX]

[DOI]

Thomas Steinke

Andrew Wan

Theory Comput., 2017

The Many Entropies in One-Way Functions.

[BibT_eX]

[DOI]

Iftach Haitner

Electron. Colloquium Comput. Complex., 2017

Computational Notions of Quantum Min-Entropy.

[BibT_eX]

[DOI]

CoRR, 2017

On Learning vs. Refutation.

[BibT_eX]

[DOI]

Proceedings of the 30th Conference on Learning Theory, 2017

The Complexity of Differential Privacy.

[BibT_eX]

[DOI]

Proceedings of the Tutorials on the Foundations of Cryptography., 2017

The Many Entropies in One-Way Functions.

[BibT_eX]

[DOI]

Iftach Haitner

Proceedings of the Tutorials on the Foundations of Cryptography., 2017

2016

Truthful Mechanisms for Agents That Value Privacy.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2016

Separating Computational and Statistical Differential Privacy in the Client-Server Model.

[BibT_eX]

[DOI]

Mark Bun

Yi-Hsiu Chen

IACR Cryptol. ePrint Arch., 2016

PSI (Ψ): a Private data Sharing Interface.

[BibT_eX]

[DOI]

CoRR, 2016

Towards a Privacy Research Roadmap for the Computing Community.

[BibT_eX]

[DOI]

CoRR, 2016

Locating a Small Cluster Privately.

[BibT_eX]

[DOI]

Kobbi Nissim

Uri Stemmer

Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

Privacy Odometers and Filters: Pay-as-you-Go Composition.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Differentially Private Chi-Squared Hypothesis Testing: Goodness of Fit and Independence Testing.

[BibT_eX]

[DOI]

Proceedings of the 33nd International Conference on Machine Learning, 2016

2015

Pseudorandomness for Read-Once, Constant-Depth Circuits.

[BibT_eX]

[DOI]

Sitan Chen

Thomas Steinke

CoRR, 2015

Robust Traceability from Trace Amounts.

[BibT_eX]

[DOI]

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Differentially Private Release and Learning of Threshold Functions.

[BibT_eX]

[DOI]

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014

Redrawing the boundaries on purchasing data from privacy-sensitive individuals.

[BibT_eX]

[DOI]

Kobbi Nissim

David Xiao

Proceedings of the Innovations in Theoretical Computer Science, 2014

2013

Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream.

[BibT_eX]

[DOI]

Michael Mitzenmacher

Theory Comput., 2013

On extractors and exposure-resilient functions for sublogarithmic entropy.

[BibT_eX]

[DOI]

Yakir Reshef

Random Struct. Algorithms, 2013

A Uniform Min-Max Theorem with Applications in Cryptography.

[BibT_eX]

[DOI]

Colin Jia Zheng

Electron. Colloquium Comput. Complex., 2013

Pseudorandomness for Regular Branching Programs via Fourier Analysis.

[BibT_eX]

[DOI]

Thomas Steinke

Electron. Colloquium Comput. Complex., 2013

Locally Testable Codes and Cayley Graphs.

[BibT_eX]

[DOI]

Parikshit Gopalan

Yuan Zhou

Electron. Colloquium Comput. Complex., 2013

Interactive proofs of proximity: delegating computation in sublinear time.

[BibT_eX]

[DOI]

Guy N. Rothblum

Proceedings of the Symposium on Theory of Computing Conference, 2013

Publicly verifiable proofs of sequential work.

[BibT_eX]

[DOI]

Mohammad Mahmoody

Tal Moran

Proceedings of the Innovations in Theoretical Computer Science, 2013

2012

Special Section on the Forty-Third Annual ACM Symposium on Theory of Computing (STOC 2011).

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

On the (im)possibility of obfuscating programs.

[BibT_eX]

[DOI]

J. ACM, 2012

Differential Privacy with Imperfect Randomness.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Pseudorandomness.

[BibT_eX]

[DOI]

Found. Trends Theor. Comput. Sci., 2012

Better pseudorandom generators from milder pseudorandom restrictions.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2012

Special issue from RANDOM'09: Editors' Foreword.

[BibT_eX]

[DOI]

Comput. Complex., 2012

Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources.

[BibT_eX]

[DOI]

Yevgeniy Dodis

Thomas Ristenpart

Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Characterizing pseudoentropy.

[BibT_eX]

[DOI]

Colin Jia Zheng

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Faster Algorithms for Privately Releasing Marginals.

[BibT_eX]

[DOI]

Justin Thaler

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

The Privacy of the Analyst and the Power of the State.

[BibT_eX]

[DOI]

Cynthia Dwork

Moni Naor

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

2011

Computational Complexity.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

S-T connectivity on digraphs with a known stationary distribution.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2011

Deterministic extractors for small-space sources.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2011

Non-Interactive Time-Stamping and Proofs of Work in the Random Oracle Model.

[BibT_eX]

[DOI]

Mohammad Mahmoody

Tal Moran

IACR Cryptol. ePrint Arch., 2011

Characterizing Pseudoentropy and Simplifying Pseudorandom Generator Constructions.

[BibT_eX]

[DOI]

Colin Jia Zheng

Electron. Colloquium Comput. Complex., 2011

The Limits of Two-Party Differential Privacy.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2011

On the complexity of computational problems regarding distributions (a survey).

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2011

PCPs and the Hardness of Generating Private Synthetic Data.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Time-Lock Puzzles in the Random Oracle Model.

[BibT_eX]

[DOI]

Mohammad Mahmoody

Tal Moran

Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

Simplified Derandomization of BPP Using a Hitting Set Generator.

[BibT_eX]

[DOI]

Proceedings of the Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation, 2011

On the Complexity of Computational Problems Regarding Distributions.

[BibT_eX]

[DOI]

Proceedings of the Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation, 2011

2010

A Lower Bound on List Size for List Decoding.

[BibT_eX]

[DOI]

Venkatesan Guruswami

IEEE Trans. Inf. Theory, 2010

Universal One-Way Hash Functions via Inaccessible Entropy.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

Improved Delegation of Computation using Fully Homomorphic Encryption.

[BibT_eX]

[DOI]

Yael Tauman Kalai

IACR Cryptol. ePrint Arch., 2010

Efficiency Improvements in Constructing Pseudorandom Generators from One-way Functions.

[BibT_eX]

[DOI]

Iftach Haitner

Electron. Colloquium Comput. Complex., 2010

On Approximating the Entropy of Polynomial Mappings.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2010

Are PCPs Inherent in Efficient Arguments?

[BibT_eX]

[DOI]

Guy N. Rothblum

Comput. Complex., 2010

Boosting and Differential Privacy.

[BibT_eX]

[DOI]

Cynthia Dwork

Guy N. Rothblum

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

2009

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

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes.

[BibT_eX]

[DOI]

Venkatesan Guruswami

Christopher Umans

J. ACM, 2009

Proofs of Retrievability via Hardness Amplification.

[BibT_eX]

[DOI]

Yevgeniy Dodis

Daniel Wichs

IACR Cryptol. ePrint Arch., 2009

Composition of Zero-Knowledge Proofs with Efficient Provers.

[BibT_eX]

[DOI]

Eleanor Birrell

IACR Cryptol. ePrint Arch., 2009

Inaccessible Entropy.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 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

2008

Simpler Session-Key Generation from Short Random Passwords.

[BibT_eX]

[DOI]

Minh-Huyen Nguyen

J. Cryptol., 2008

Fairness with an Honest Minority and a Rational Majority.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution.

[BibT_eX]

[DOI]

Madhur Tulsiani

Electron. Colloquium Comput. Complex., 2008

Dense Subsets of Pseudorandom Sets.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2008

Limitations of Hardness vs. Randomness under Uniform Reductions.

[BibT_eX]

[DOI]

Dan Gutfreund

Electron. Colloquium Comput. Complex., 2008

An Equivalence Between Zero Knowledge and Commitments.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Why simple hash functions work: exploiting the entropy in a data stream.

[BibT_eX]

[DOI]

Michael Mitzenmacher

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Tight Bounds for Hashing Block Sources.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2008

The Complexity of Distinguishing Markov Random Fields.

[BibT_eX]

[DOI]

Andrej Bogdanov

Elchanan Mossel

Proceedings of the Approximation, 2008

2007

The unified theory of pseudorandomness: guest column.

[BibT_eX]

[DOI]

SIGACT News, 2007

The hardness of the Expected Decision Depth problem.

[BibT_eX]

[DOI]

Dana Ron

Amir Rosenfeld

Inf. Process. Lett., 2007

Interactive and Noninteractive Zero Knowledge Coincide in the Help Model.

[BibT_eX]

[DOI]

Dragos Florin Ciocan

IACR Cryptol. ePrint Arch., 2007

Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

Pseudorandomness and Average-Case Complexity Via Uniform Reductions.

[BibT_eX]

[DOI]

Comput. Complex., 2007

Special Issue On Worst-case Versus Average-case Complexity Editors' Foreword.

[BibT_eX]

[DOI]

Comput. Complex., 2007

The Complexity of Zero Knowledge.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Amplifying Collision Resistance: A Complexity-Theoretic Treatment.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

2006

Lower bounds for non-black-box zero knowledge.

[BibT_eX]

[DOI]

Boaz Barak

Yehuda Lindell

J. Comput. Syst. Sci., 2006

An Unconditional Study of Computational Zero Knowledge.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2006

Zero Knowledge and Soundness are Symmetric.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2006

Statistical Zero-Knowledge Arguments for NP from Any One-Way Function.

[BibT_eX]

[DOI]

Minh-Huyen Nguyen

Electron. Colloquium Comput. Complex., 2006

Extractors and condensers from univariate polynomials.

[BibT_eX]

[DOI]

Venkatesan Guruswami

Christopher Umans

Electron. Colloquium Comput. Complex., 2006

Random Selection with an Adversarial Majority.

[BibT_eX]

[DOI]

Ronen Gradwohl

David Zuckerman

Electron. Colloquium Comput. Complex., 2006

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

[BibT_eX]

[DOI]

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

Zero knowledge with efficient provers.

[BibT_eX]

[DOI]

Minh-Huyen Nguyen

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

2005

Computational Complexity.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Cryptography and Security, 2005

Derandomization in Cryptography

[BibT_eX]

[DOI]

Boaz Barak

Electron. Colloquium Comput. Complex., 2005

The Round Complexity of Two-Party Random Selection

[BibT_eX]

[DOI]

Saurabh Sanghvi

Electron. Colloquium Comput. Complex., 2005

Concurrent Zero Knowledge without Complexity Assumptions

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2005

Derandomized Squaring of Graphs

[BibT_eX]

[DOI]

Eyal Rozenman

Electron. Colloquium Comput. Complex., 2005

The Computational Complexity of Nash Equilibria in Concisely Represented Games

[BibT_eX]

[DOI]

Grant Schoenebeck

Electron. Colloquium Comput. Complex., 2005

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

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2005

Compression of Samplable Sources.

[BibT_eX]

[DOI]

David Zuckerman

Comput. Complex., 2005

Short PCPs Verifiable in Polylogarithmic Time.

[BibT_eX]

[DOI]

Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005

2004

Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model.

[BibT_eX]

[DOI]

J. Cryptol., 2004

Using Nondeterminism to Amplify Hardness

[BibT_eX]

[DOI]

Alexander Healy

Emanuele Viola

Electron. Colloquium Comput. Complex., 2004

Robust PCPs of Proximity, Shorter PCPs and Applications to Coding

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2004

Notions of Reducibility between Cryptographic Primitives.

[BibT_eX]

[DOI]

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

Probabilistic proof systems - Part I.

[BibT_eX]

[DOI]

Proceedings of the Computational Complexity Theory., 2004

2003

A complete problem for statistical zero knowledge.

[BibT_eX]

[DOI]

J. ACM, 2003

Extractors: optimal up to constant factors.

[BibT_eX]

[DOI]

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

Randomness-efficient low degree tests and short PCPs via epsilon-biased sets.

[BibT_eX]

[DOI]

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

Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More.

[BibT_eX]

[DOI]

Daniele Micciancio

Proceedings of the Advances in Cryptology, 2003

2002

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

[BibT_eX]

[DOI]

Ran Raz

J. Comput. Syst. Sci., 2002

The Power of a Pebble: Exploring and Mapping Directed Graphs.

[BibT_eX]

[DOI]

Inf. Comput., 2002

An Improved Pseudorandom Generator Based on Hardness of Factoring.

[BibT_eX]

[DOI]

Nenad Dedic

Leonid Reyzin

IACR Cryptol. ePrint Arch., 2002

On interactive proofs with a laconic prover.

[BibT_eX]

[DOI]

Comput. Complex., 2002

Randomness conductors and constant-degree lossless expanders.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Randomness Extractors and their Many Guises.

[BibT_eX]

[DOI]

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001

The Complexity of Counting in Sparse, Regular, and Planar Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 2001

Pseudorandom Generators without the XOR Lemma.

[BibT_eX]

[DOI]

Madhu Sudan

J. Comput. Syst. Sci., 2001

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

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2001

Order in Pseudorandomness.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2001

On the (Im)possibility of Obfuscating Programs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2001

2000

Simplified derandomization of BPP using a hitting set generator.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2000

On transformation of interactive proofs that preserve the prover's complexity.

[BibT_eX]

[DOI]

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

Extracting Randomness from Samplable Distributions.

[BibT_eX]

[DOI]

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

1999

Can Statistical Zero Knowledge be made Non-Interactive? or On the Relationship of SZK and NISZK

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1999

Pseudorandom Generators Without the XOR Lemma (Extended Abstract).

[BibT_eX]

[DOI]

Madhu Sudan

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

Verifiable Random Functions.

[BibT_eX]

[DOI]

Silvio Micali

Michael O. Rabin

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

Pseudorandom Generators without the XOR Lemma (Abstract).

[BibT_eX]

[DOI]

Madhu Sudan

Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999

1998

Many-to-one Trapdoor Functions and their Relation to Public-key Cryptosystems.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 1998

Comparing Entropies in Statistical Zero-Knowledge with Applications to the Structure of SZK

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1998

Extracting All the Randomness from a Weakly Random Source

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1998

Checking Polynomial Identities over any Field: Towards a Derandomization?

[BibT_eX]

[DOI]

Daniel Lewin

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

Honest-Verifier Statistical Zero-Knowledge Equals General Statistical Zero-Knowledge.

[BibT_eX]

[DOI]

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

Many-to-One Trapdoor Functions and Their Ralation to Public-Key Cryptosystems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1998

1997

A Complete Promise Problem for Statistical Zero-Knowledge.

[BibT_eX]

[DOI]

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

Manipulating statistical difference.

[BibT_eX]

[DOI]