Adam D. Smith

According to our database1, Adam D. Smith authored at least 133 papers between 1999 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Distributed Differential Privacy via Shuffling.
IACR Cryptology ePrint Archive, 2019

Manipulation Attacks in Local Differential Privacy.
CoRR, 2019

Guaranteed Validity for Empirical Approaches to Adaptive Data Analysis.
CoRR, 2019

The structure of optimal private tests for simple hypotheses.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

From Soft Classifiers to Hard Decisions: How fair can we be?
Proceedings of the Conference on Fairness, Accountability, and Transparency, 2019

Distributed Differential Privacy via Shuffling.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

2018
Turning HATE Into LOVE: Homomorphic Ad Hoc Threshold Encryption for Scalable MPC.
IACR Cryptology ePrint Archive, 2018

The Structure of Optimal Private Tests for Simple Hypotheses.
CoRR, 2018

Private Algorithms Can Always Be Extended.
CoRR, 2018

Revealing Network Structure, Confidentially: Improved Rates for Node-Private Graphon Estimation.
CoRR, 2018

From Soft Classifiers to Hard Decisions: How fair can we be?
CoRR, 2018

Distributed Differential Privacy via Mixnets.
CoRR, 2018

The Limits of Post-Selection Generalization.
CoRR, 2018

Graph Oracle Models, Lower Bounds, and Gaps for Parallel Stochastic Optimization.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

The Limits of Post-Selection Generalization.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Revealing Network Structure, Confidentially: Improved Rates for Node-Private Graphon Estimation.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
Instantiability of RSA-OAEP Under Chosen-Plaintext Attack.
J. Cryptology, 2017

Information, Privacy and Stability in Adaptive Data Analysis.
CoRR, 2017

Is Interaction Necessary for Distributed Private Learning?
Proceedings of the 2017 IEEE Symposium on Security and Privacy, 2017

2016
Differentially Private Analysis of Graphs.
Encyclopedia of Algorithms, 2016

Calibrating Noise to Sensitivity in Private Data Analysis.
J. Priv. Confidentiality, 2016

Optimal Rate Code Constructions for Computationally Simple Channels.
J. ACM, 2016

Max-Information, Differential Privacy, and Post-Selection Hypothesis Testing.
CoRR, 2016

When is Nontrivial Estimation Possible for Graphons and Stochastic Block Models?
CoRR, 2016

Algorithmic stability for adaptive data analysis.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Max-Information, Differential Privacy, and Post-selection Hypothesis Testing.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

Lipschitz Extensions for Node-Private Graph Statistics and the Generalized Exponential Mechanism.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

Reusable Fuzzy Extractors for Low-Entropy Distributions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

When Are Fuzzy Extractors Possible?
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015
Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs.
J. Cryptology, 2015

On the Regularity of Lossy RSA: Improved Bounds and Applications to Padding-Based Encryption.
IACR Cryptology ePrint Archive, 2015

Classical Cryptographic Protocols in a Quantum World.
IACR Cryptology ePrint Archive, 2015

Efficient Lipschitz Extensions for High-Dimensional Graph Statistics and Node Private Degree Distributions.
CoRR, 2015

Classical Cryptographic Protocols in a Quantum World.
CoRR, 2015

Private Graphon Estimation for Sparse Graphs.
CoRR, 2015

Local, Private, Efficient Protocols for Succinct Histograms.
CoRR, 2015

Algorithmic Stability for Adaptive Data Analysis.
CoRR, 2015

On the Regularity of Lossy RSA - Improved Bounds and Applications to Padding-Based Encryption.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Local, Private, Efficient Protocols for Succinct Histograms.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Private Graphon Estimation for Sparse Graphs.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Privacy-Preserving Public Information for Sequential Games.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

Robust Traceability from Trace Amounts.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014
Private Analysis of Graph Structure.
ACM Trans. Database Syst., 2014

Where are Fuzzy Extractors Possible?
IACR Cryptology ePrint Archive, 2014

Privacy-Preserving Public Information for Sequential Games.
CoRR, 2014

Private Empirical Risk Minimization, Revisited.
CoRR, 2014

Causal Erasure Channels.
CoRR, 2014

Causal Erasure Channels.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Private Empirical Risk Minimization: Efficient Algorithms and Tight Error Bounds.
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

2013
Near-linear time, Leakage-resilient Key Evolution Schemes from Expander Graphs.
IACR Cryptology ePrint Archive, 2013

Sublinear Algorithms for Approximating String Compressibility.
Algorithmica, 2013

Analyzing Graphs with Node Differential Privacy.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

The Power of Linear Reconstruction Attacks.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

(Nearly) Optimal Algorithms for Private Online Learning in Full-information and Bandit Settings.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

Coupled-Worlds Privacy: Exploiting Adversarial Uncertainty in Statistical Data Privacy.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Regularity of Lossy RSA on Subdomains and Its Applications.
Proceedings of the Advances in Cryptology, 2013

Differentially Private Feature Selection via Stability Arguments, and the Robustness of the Lasso.
Proceedings of the COLT 2013, 2013

2012
Robust Fuzzy Extractors and Authenticated Key Agreement From Close Secrets.
IEEE Trans. Information Theory, 2012

Private Convex Optimization for Empirical Risk Minimization with Applications to High-dimensional Regression.
Proceedings of the COLT 2012, 2012

The Power of Linear Reconstruction Attacks
CoRR, 2012

2011
Leftover Hashing Against Quantum Side Information.
IEEE Trans. Information Theory, 2011

What Can We Learn Privately?
SIAM J. Comput., 2011

Private Analysis of Graph Structure.
PVLDB, 2011

Instantiability of RSA-OAEP under Chosen-Plaintext Attack.
IACR Cryptology ePrint Archive, 2011

Privacy-preserving statistical estimation with optimal convergence rates.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Classical Cryptographic Protocols in a Quantum World.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2010
Differential Privacy for Statistics: What we Know and What we Want to Learn.
J. Priv. Confidentiality, 2010

Parallel and Concurrent Security of the HB and HB+ Protocols.
J. Cryptology, 2010

Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets.
IACR Cryptology ePrint Archive, 2010

Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate.
Electronic Colloquium on Computational Complexity (ECCC), 2010

Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate
CoRR, 2010

The price of privately releasing contingency tables and the spectra of random matrices with correlated rows.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Discovering frequent patterns in sensitive data.
Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2010

Leftover Hashing against quantum side information.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Instantiability of RSA-OAEP under Chosen-Plaintext Attack.
Proceedings of the Advances in Cryptology, 2010

2009
Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem.
SIAM J. Comput., 2009

Composability and On-Line Deniability of Authentication.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

What Can Cryptography Do for Coding Theory?
Proceedings of the Information Theoretic Security, 4th International Conference, 2009

Asymptotically Optimal and Private Statistical Estimation.
Proceedings of the Cryptology and Network Security, 8th International Conference, 2009

2008
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models.
IEEE Trans. Information Theory, 2008

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data.
SIAM J. Comput., 2008

Efficient, Differentially Private Point Estimators
CoRR, 2008

A Note on Differential Privacy: Defining Resistance to Arbitrary Side Information
CoRR, 2008

What Can We Learn Privately?
CoRR, 2008

Composition Attacks and Auxiliary Information in Data Privacy
CoRR, 2008

Composition attacks and auxiliary information in data privacy.
Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2008

What Can We Learn Privately?
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

Efficient Two Party and Multi Party Computation Against Covert Adversaries.
Proceedings of the Advances in Cryptology, 2008

Scalable Multiparty Computation with Nearly Optimal Work and Resilience.
Proceedings of the Advances in Cryptology, 2008

Defending Against Attacks on Main Memory Persistence.
Proceedings of the Twenty-Fourth Annual Computer Security Applications Conference, 2008

2007
Sublinear Algorithms for Approximating String Compressibility
CoRR, 2007

Smooth sensitivity and sampling in private data analysis.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

Sublinear Algorithms for Approximating String Compressibility.
Proceedings of the Approximation, 2007

2006
Scrambling Adversarial Errors Using Few Random Bits, Optimal Information Reconciliation, and Better Private Codes.
IACR Cryptology ePrint Archive, 2006

Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models.
IACR Cryptology ePrint Archive, 2006

Analyzing the HB and HB+ Protocols in the "Large Error" Case.
IACR Cryptology ePrint Archive, 2006

A Note on Adaptivity in Testing Properties of Bounded Degree Graphs.
Electronic Colloquium on Computational Complexity (ECCC), 2006

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
CoRR, 2006

Calibrating Noise to Sensitivity in Private Data Analysis.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models.
Proceedings of the Advances in Cryptology, 2006

Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets.
Proceedings of the Advances in Cryptology, 2006

2005
Sublinear Algorithms for Approximating String Compressibility and the Distribution Support Size
Electronic Colloquium on Computational Complexity (ECCC), 2005

Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes
CoRR, 2005

Entropic Security and the Encryption of High Entropy Messages.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Toward Privacy in Public Databases.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Correcting errors without leaking partial information.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes.
Proceedings of the Advances in Cryptology, 2005

Secure Remote Authentication Using Biometric Data.
Proceedings of the Advances in Cryptology, 2005

2004
Maintaining secrecy when information leakage is unavoidable.
PhD thesis, 2004

Efficient Consistency Proofs for Generalized Queries on a Committed Database.
IACR Cryptology ePrint Archive, 2004

Entropic Security and the Encryption of High Entropy Messages.
IACR Cryptology ePrint Archive, 2004

List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument.
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

Efficient Consistency Proofs for Generalized Queries on a Committed Database.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data.
Proceedings of the Advances in Cryptology, 2004

Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption.
Proceedings of the Approximation, 2004

2003
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data.
IACR Cryptology ePrint Archive, 2003

Lower bounds for collusion-secure fingerprinting.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Round Efficiency of Multi-party Computation with a Dishonest Majority.
Proceedings of the Advances in Cryptology, 2003

2002
Authentication of Quantum Messages.
IACR Cryptology ePrint Archive, 2002

Authentication of Quantum Messages
CoRR, 2002

Secure multi-party quantum computation.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Detectable byzantine agreement secure against faulty majorities.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Authentication of Quantum Messages.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

Extracting Quantum Entanglement.
Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002

2001
Efficient and Non-Interactive Non-Malleable Commitment.
IACR Cryptology ePrint Archive, 2001

On Perfect and Adaptive Security in Exposure-Resilient Cryptography.
Proceedings of the Advances in Cryptology, 2001

Efficient and Non-interactive Non-malleable Commitment.
Proceedings of the Advances in Cryptology, 2001

Mutually Independent Commitments.
Proceedings of the Advances in Cryptology, 2001

1999
Multiparty computation unconditionally secure against Q^2 adversary structures
CoRR, 1999


  Loading...