Adam D. Smith
#20,735
Most Influential Person Now
Computer scientist
Adam D. Smith's AcademicInfluence.com Rankings
Adam D. Smithcomputer-science Degrees
Computer Science
#1367
World Rank
#1414
Historical Rank
Database
#425
World Rank
#445
Historical Rank
Download Badge
Computer Science
Adam D. Smith's Degrees
- PhD Computer Science Stanford University
Similar Degrees You Can Earn
Why Is Adam D. Smith Influential?
(Suggest an Edit or Addition)According to Wikipedia, Adam D. Smith is a computer scientist at Boston University, where he is a founding member of the Faculty of Computing & Data Sciences. His areas of research include cryptography and information privacy. He is known, along with Cynthia Dwork, Frank McSherry, and Kobbi Nissim, as one of the co-inventors of differential privacy, for which he won the 2017 Gödel Prize.
Adam D. Smith's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Calibrating Noise to Sensitivity in Private Data Analysis (2006) (6218)
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data (2004) (2697)
- What Can We Learn Privately? (2008) (1029)
- Smooth sensitivity and sampling in private data analysis (2007) (985)
- Private Empirical Risk Minimization: Efficient Algorithms and Tight Error Bounds (2014) (722)
- Composition attacks and auxiliary information in data privacy (2008) (397)
- Local, Private, Efficient Protocols for Succinct Histograms (2015) (350)
- Toward Privacy in Public Databases (2005) (319)
- Authentication of quantum messages (2001) (309)
- Analyzing Graphs with Node Differential Privacy (2013) (306)
- Differential Privacy for Statistics: What we Know and What we Want to Learn (2010) (289)
- Private Convex Empirical Risk Minimization and High-dimensional Regression (2012) (284)
- Privacy-preserving statistical estimation with optimal convergence rates (2011) (270)
- Discovering frequent patterns in sensitive data (2010) (256)
- Secure Remote Authentication Using Biometric Data (2005) (255)
- Parallel and Concurrent Security of the HB and HB+ Protocols (2006) (240)
- Distributed Differential Privacy via Shuffling (2018) (231)
- Algorithmic stability for adaptive data analysis (2015) (227)
- Robust Fuzzy Extractors and Authenticated Key Agreement From Close Secrets (2006) (217)
- Private Analysis of Graph Structure (2014) (201)
- Exposed! A Survey of Attacks on Private Data (2017) (175)
- Correcting errors without leaking partial information (2005) (174)
- Leftover Hashing against quantum side information (2010) (167)
- Differentially Private Feature Selection via Stability Arguments, and the Robustness of the Lasso (2013) (144)
- Robust Traceability from Trace Amounts (2015) (135)
- Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem (2007) (132)
- Secure multi-party quantum computation (2002) (129)
- On the 'Semantics' of Differential Privacy: A Bayesian Formulation (2008) (128)
- Is Interaction Necessary for Distributed Private Learning? (2017) (126)
- Efficient and Non-interactive Non-malleable Commitment (2001) (121)
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience (2008) (118)
- Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority (2006) (114)
- (Nearly) Optimal Algorithms for Private Online Learning in Full-information and Bandit Settings (2013) (110)
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows (2010) (110)
- Efficient Two Party and Multi Party Computation Against Covert Adversaries (2008) (107)
- Entropic Security and the Encryption of High Entropy Messages (2005) (104)
- A Note on Differential Privacy: Defining Resistance to Arbitrary Side Information (2008) (102)
- Round Efficiency of Multi-party Computation with a Dishonest Majority (2003) (97)
- Leftover Hashing Against Quantum Side Information (2010) (93)
- Reusable Fuzzy Extractors for Low-Entropy Distributions (2016) (93)
- On Perfect and Adaptive Security in Exposure-Resilient Cryptography (2001) (92)
- Coupled-Worlds Privacy: Exploiting Adversarial Uncertainty in Statistical Data Privacy (2013) (86)
- Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption (2004) (85)
- Efficient, Differentially Private Point Estimators (2008) (79)
- Max-Information, Differential Privacy, and Post-selection Hypothesis Testing (2016) (74)
- Detectable byzantine agreement secure against faulty majorities (2002) (70)
- Composability and On-Line Deniability of Authentication (2009) (70)
- Private Graphon Estimation for Sparse Graphs (2015) (68)
- Classical Cryptographic Protocols in a Quantum World (2011) (68)
- Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs (2015) (66)
- Instantiability of RSA-OAEP Under Chosen-Plaintext Attack (2010) (62)
- Private Convex Optimization for Empirical Risk Minimization with Applications to High-dimensional Regression (2012) (62)
- Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate (2010) (60)
- Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes (2007) (53)
- Lipschitz Extensions for Node-Private Graph Statistics and the Generalized Exponential Mechanism (2016) (53)
- Efficient Consistency Proofs for Generalized Queries on a Committed Database (2004) (53)
- The structure of optimal private tests for simple hypotheses (2018) (52)
- Quantum secret sharing for general access structures (2000) (51)
- Private Empirical Risk Minimization, Revisited (2014) (48)
- The Power of Linear Reconstruction Attacks (2012) (46)
- When is memorization of irrelevant training data necessary for high-accuracy learning? (2020) (45)
- Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes (2005) (45)
- Lower bounds for collusion-secure fingerprinting (2003) (45)
- Manipulation Attacks in Local Differential Privacy (2019) (43)
- When Are Fuzzy Extractors Possible? (2016) (41)
- Efficient Lipschitz Extensions for High-Dimensional Graph Statistics and Node Private Degree Distributions (2015) (39)
- Analyzing the HB and HB+ Protocols in the "Large Error" Case (2006) (38)
- Optimal Rate Code Constructions for Computationally Simple Channels (2010) (38)
- From Soft Classifiers to Hard Decisions: How fair can we be? (2018) (35)
- Defending Against Attacks on Main Memory Persistence (2008) (35)
- Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models (2006) (35)
- Cryptography and the Economics of Supervisory Information: Balancing Transparency and Confidentiality (2013) (33)
- Maintaining secrecy when information leakage is unavoidable (2004) (33)
- A Note on Adaptivity in Testing Properties of Bounded Degree Graphs (2006) (32)
- Fuzzy Extractors ∗ (2007) (29)
- Sublinear Algorithms for Approximating String Compressibility (2007) (29)
- Private analysis of graph structure (2011) (28)
- Revealing Network Structure, Confidentially: Improved Rates for Node-Private Graphon Estimation (2018) (28)
- Covariance-Aware Private Mean Estimation Without Private Covariance Estimation (2021) (25)
- Algorithm Design and Analysis (2008) (25)
- Differentially private model selection with penalized and constrained likelihood (2016) (22)
- Multi-party Quantum Computation (2001) (22)
- Differentially Private Simple Linear Regression (2020) (22)
- Fuzzy Extractors and Cryptography, or How to Use Your Fingerprints (2003) (21)
- Distributed Differential Privacy via Mixnets (2018) (21)
- The Limits of Post-Selection Generalization (2018) (19)
- The Flajolet-Martin Sketch Itself Preserves Differential Privacy: Private Counting with Minimal Space (2020) (18)
- Fuzzy Extractors A Brief Survey of Results from 2004 to 2006 (2008) (18)
- Causal Erasure Channels (2014) (17)
- Noninteractive Locally Private Learning of Linear Models via Polynomial Approximations (2018) (17)
- Mutually Independent Commitments (2001) (16)
- Secure Multi-party Quantum Computing (2002) (16)
- Rectangular Tiling in Multidimensional Arrays (2000) (15)
- Rectangular tiling in multi-dimensional arrays (1999) (15)
- Differentially Private Analysis of Graphs (2016) (14)
- Turning HATE Into LOVE: Homomorphic Ad Hoc Threshold Encryption for Scalable MPC (2018) (13)
- More General Queries and Less Generalization Error in Adaptive Data Analysis (2015) (13)
- Differentially Private Model Selection via Stability Arguments and the Robustness of the Lasso (2013) (13)
- Privacy-Preserving Public Information for Sequential Games (2014) (12)
- Empirical Risk Minimization in the Non-interactive Local Model of Differential Privacy (2020) (11)
- Extracting quantum entanglement (general entanglement purification protocols) (2001) (11)
- Regularity of Lossy RSA on Subdomains and Its Applications (2013) (10)
- Special Issue on Statistical and Learning-Theoretic Challenges in Data Privacy (2012) (10)
- Secure Remote Authentication Using Biometrics (2005) (10)
- Efficient Consistency Proofs on a Committed Database (2003) (10)
- Guaranteed Validity for Empirical Approaches to Adaptive Data Analysis (2019) (10)
- Information, Privacy and Stability in Adaptive Data Analysis (2017) (9)
- Near-linear time, Leakage-resilient Key Evolution Schemes from Expander Graphs (2013) (9)
- Turning HATE into LOVE: Compact Homomorphic Ad Hoc Threshold Encryption for Scalable MPC (2021) (8)
- Explicit Capacity-achieving Codes for Worst-Case Additive Errors (2009) (8)
- List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument (2004) (7)
- Multiparty computation unconditionally secure against Q^2 adversary structures (1999) (7)
- Quantum message authentication codes (2001) (7)
- Non-parametric Differentially Private Confidence Intervals for the Median (2021) (7)
- Asymptotically Optimal and Private Statistical Estimation (2009) (6)
- On the Regularity of Lossy RSA - Improved Bounds and Applications to Padding-Based Encryption (2015) (6)
- Sublinear Algorithms for Approximating String Compressibility and the Distribution Support Size (2005) (4)
- Extracting Quantum Entanglement (2002) (4)
- Differentially Private Survey Research (2020) (4)
- Differentially Private Empirical Risk Minimization in Non-interactive Local Model via Polynomial of Inner Product Approximation (2018) (3)
- Private Algorithms Can Always Be Extended (2018) (3)
- When is Nontrivial Estimation Possible for Graphons and Stochastic Block Models? (2016) (3)
- Learning Rotations (2008) (3)
- Strong Memory Lower Bounds for Learning Natural Models (2022) (3)
- Learning Rotations Online (2010) (2)
- Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs (2014) (2)
- Differentially Private Sampling from Distributions (2022) (2)
- Proceedings of the 6th international conference on Information Theoretic Security (2012) (2)
- Approximate quantum error-correcting codes (1)
- Theory of Cryptography (2016) (1)
- Sublinear Algorithms for Approximating String Compressibility (2012) (1)
- Instance-Optimal Differentially Private Estimation (2022) (1)
- Information Theoretic Security (2012) (1)
- Reusable Fuzzy Extractors via Digital Lockers (2015) (1)
- Instantiability of RSA-OAEP Under Chosen-Plaintext Attack (2016) (1)
- Fast, Sample-Efficient, Affine-Invariant Private Mean and Covariance Estimation for Subgaussian Distributions (2023) (1)
- Curious Machines: Active Learning with Structured Instances Table of Contents (2008) (1)
- Node-Differentially Private Estimation of the Number of Connected Components (2023) (0)
- Ulllted States Patent ( 10 ) Patent N 0 . : US 7 , 680 , 749 B 1 (2013) (0)
- Lecture 11 : Privacy and Adaptive Analysis (2017) (0)
- Multi-party Quantum Computation Multi-party Quantum Computation (2001) (0)
- Lecture 7 – 10 : Stability and Adaptive Analysis (2017) (0)
- What Can Cryptography Do for Coding Theory? (2009) (0)
- Learning Transformations Between Directed Subspaces Online (2007) (0)
- Theory of Cryptography (2016) (0)
- Control, Confidentiality, and the Right to be Forgotten (2022) (0)
- Information theoretic security : 6th International Conference, ICITS 2012, Montreal, QC, Canada, August 15-17, 2012 : proceedings (2012) (0)
- Lecture 2 : Uniform Convergence and Optimization (2017) (0)
- The Algorithmic Foundations of Adaptive Data Analysis November 15 , 2020 Lecture 11 : Privacy and Adaptive Analysis (2020) (0)
- Differentially Private Confidence Intervals for Proportions under Stratified Random Sampling (2023) (0)
- Solutions Midterm Exam 2 Solutions Problem (2010) (0)
- Andris Ambainis Derandomizing Approximate Quantum Encryption (2005) (0)
- The Algorithmic Foundations of Adaptive Data Analysis May 9 , 2018 Lecture 20 : Lower Bounds via Tracing (2018) (0)
- Basic Definitions 2 . 1 Predictability , Min-Entropy , Statistical Distance , Extraction (2008) (0)
- Preface to the fourth IEEE workshop on privacy aspects of data mining (2013) (0)
- Derandomizing Approximate Quantum Encryption Derandomizing Approximate Quantum Encryption (2005) (0)
- Research Interests 1 Models and Protocols for New Applications (2006) (0)
- ST ] 3 0 O ct 2 01 8 Private Algorithms Can be Always Extended (2018) (0)
- Triangle Counting with Local Edge Differential Privacy (2023) (0)
- Related Work Our “ Guess and Check ” ( GnC ) framework draws inspiration from the Thresholdout method of Dwork (2019) (0)
This paper list is powered by the following services:
Other Resources About Adam D. Smith
What Schools Are Affiliated With Adam D. Smith?
Adam D. Smith is affiliated with the following schools:
