Adam D. Smith

发表

Defending Against Attacks on Main Memory Persistence

Patrick D. McDaniel, William Enck, Kevin R. B. Butler, 2008, 2008 Annual Computer Security Applications Conference (ACSAC).

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

Christian Borgs, Jennifer T. Chayes, Adam D. Smith, 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority

Avinatan Hassidim, Adam D. Smith, Michael Ben-Or, 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

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

Ran Canetti, Adam D. Smith, Nishanth Dikkala, 2018, FAT.

Instantiability of RSA-OAEP Under Chosen-Plaintext Attack

Adam O'Neill, Eike Kiltz, Adam D. Smith, 2010, Journal of Cryptology.

On the Regularity of Lossy RSA - Improved Bounds and Applications to Padding-Based Encryption

Ye Zhang, Adam D. Smith, 2015, TCC.

Near-linear time, Leakage-resilient Key Evolution Schemes from Expander Graphs

Ye Zhang, Adam D. Smith, 2013, IACR Cryptol. ePrint Arch..

Mutually Independent Commitments

Silvio Micali, Adam D. Smith, Anna Lysyanskaya, 2001, ASIACRYPT.

Coupled-Worlds Privacy: Exploiting Adversarial Uncertainty in Statistical Data Privacy

Jonathan Katz, Raef Bassily, Adam D. Smith, 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument

Luca Trevisan, Cynthia Dwork, Adam D. Smith, 2004, TCC.

Is Interaction Necessary for Distributed Private Learning?

Adam D. Smith, Abhradeep Thakurta, Jalaj Upadhyay, 2017, 2017 IEEE Symposium on Security and Privacy (SP).

What Can Cryptography Do for Coding Theory?

Adam D. Smith, 2009, ICITS.

The structure of optimal private tests for simple hypotheses

Adam D. Smith, Jonathan Ullman, Clément L. Canonne, 2018, STOC.

Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes

Adam D. Smith, 2007, SODA '07.

Privacy-Preserving Public Information for Sequential Games

Avrim Blum, Adam D. Smith, Ankit Sharma, 2014, ITCS.

Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem

Dana Ron, Sofya Raskhodnikova, Adam D. Smith, 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

Privacy-preserving statistical estimation with optimal convergence rates

Adam D. Smith, Adam D. Smith, 2011, STOC '11.

Local, Private, Efficient Protocols for Succinct Histograms

Raef Bassily, Adam D. Smith, Raef Bassily, 2015, STOC.

Asymptotically Optimal and Private Statistical Estimation

Adam D. Smith, Adam D. Smith, 2009, CANS.

Private Empirical Risk Minimization, Revisited pdf

Raef Bassily, Adam D. Smith, Abhradeep Thakurta, 2014, ArXiv.

Toward Privacy in Public Databases

Hoeteck Wee, Cynthia Dwork, Adam D. Smith, 2005, TCC.

Discovering frequent patterns in sensitive data

Adam D. Smith, Srivatsan Laxman, Abhradeep Thakurta, 2010, KDD.

Sublinear Algorithms for Approximating String Compressibility

Ronitt Rubinfeld, Dana Ron, Sofya Raskhodnikova, 2007, Algorithmica.

Composition attacks and auxiliary information in data privacy pdf

Adam D. Smith, Shiva Prasad Kasiviswanathan, Srivatsava Ranjit Ganta, 2008, KDD.

Classical Cryptographic Protocols in a Quantum World pdf

Adam D. Smith, Fang Song, Sean Hallgren, 2011, IACR Cryptol. ePrint Arch..

Secure multi-party quantum computation

Adam D. Smith, Claude Crépeau, Daniel Gottesman, 2002, STOC '02.

Distributed Differential Privacy via Mixnets pdf

Adam D. Smith, Jonathan Ullman, Albert Cheu, 2018, ArXiv.

Authentication of quantum messages

Adam D. Smith, Howard Barnum, Claude Crépeau, 2001, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets

Jonathan Katz, Yevgeniy Dodis, Adam D. Smith, 2006, CRYPTO.

Efficient Two Party and Multi Party Computation Against Covert Adversaries

Adam D. Smith, Vipul Goyal, Payman Mohassel, 2008, EUROCRYPT.

Sublinear Algorithms for Approximating String Compressibility and the Distribution Support Size

Ronitt Rubinfeld, Dana Ron, Sofya Raskhodnikova, 2005, Electron. Colloquium Comput. Complex..

Composability and On-Line Deniability of Authentication

Jonathan Katz, Yevgeniy Dodis, Adam D. Smith, 2009, TCC.

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

Rafail Ostrovsky, Yevgeniy Dodis, Adam D. Smith, 2004, SIAM J. Comput..

Algorithmic stability for adaptive data analysis

Raef Bassily, Thomas Steinke, Adam D. Smith, 2015, STOC.

Robust Traceability from Trace Amounts

Thomas Steinke, Cynthia Dwork, Adam D. Smith, 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

Efficient and Non-interactive Non-malleable Commitment

Rafail Ostrovsky, Jonathan Katz, Giovanni Di Crescenzo, 2001, EUROCRYPT.

Calibrating Noise to Sensitivity in Private Data Analysis

Cynthia Dwork, Adam D. Smith, Kobbi Nissim, 2006, TCC.

What Can We Learn Privately?

Sofya Raskhodnikova, Adam D. Smith, Kobbi Nissim, 2008, FOCS.

The Flajolet-Martin Sketch Itself Preserves Differential Privacy: Private Counting with Minimal Space

Adam D. Smith, Shuang Song, Abhradeep Thakurta, 2020, NeurIPS.

Private Convex Optimization for Empirical Risk Minimization with Applications to High-dimensional Regression

Daniel Kifer, Adam D. Smith, Abhradeep Thakurta, 2012, COLT.

Entropic Security and the Encryption of High Entropy Messages

Yevgeniy Dodis, Adam D. Smith, Adam D. Smith, 2005, TCC.

Differentially Private Empirical Risk Minimization: Efficient Algorithms and Tight Error Bounds

Raef Bassily, Adam D. Smith, Abhradeep Thakurta, 2014, 1405.7085.

What Can We Learn Privately?

Sofya Raskhodnikova, Adam D. Smith, Kobbi Nissim, 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

Quantum secret sharing for general access structures

Adam D. Smith, 2000 .

Regularity of Lossy RSA on Subdomains and Its Applications

Adam O'Neill, Adam D. Smith, Mark Lewko, 2013, EUROCRYPT.

Private Algorithms Can Always Be Extended pdf

Christian Borgs, Jennifer T. Chayes, Adam D. Smith, 2018, ArXiv.

Distributed Differential Privacy via Shuffling

Adam D. Smith, Jonathan Ullman, Albert Cheu, 2018, IACR Cryptol. ePrint Arch..

Secure Remote Authentication Using Biometric Data

Rafail Ostrovsky, Jonathan Katz, Xavier Boyen, 2005, EUROCRYPT.

The Power of Linear Reconstruction Attacks pdf

Adam D. Smith, Shiva Prasad Kasiviswanathan, Mark Rudelson, 2012, SODA.

Round Efficiency of Multi-party Computation with a Dishonest Majority

Rafail Ostrovsky, Jonathan Katz, Adam D. Smith, 2003, EUROCRYPT.

Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs

Yuval Ishai, Craig Gentry, Amit Sahai, 2015, Journal of Cryptology.

(Nearly) Optimal Algorithms for Private Online Learning in Full-information and Bandit Settings

Adam D. Smith, Abhradeep Thakurta, Adam D. Smith, 2013, NIPS.

Smooth sensitivity and sampling in private data analysis

Sofya Raskhodnikova, Adam D. Smith, Kobbi Nissim, 2007, STOC '07.

Causal Erasure Channels pdf

Raef Bassily, Adam D. Smith, Raef Bassily, 2014, SODA.

Multiparty computation unconditionally secure against Q^2 adversary structures

Adam D. Smith, Anton Stiglic, Adam D. Smith, 1999, ArXiv.

Reusable Fuzzy Extractors for Low-Entropy Distributions

Omer Paneth, Ran Canetti, Adam D. Smith, 2021, J. Cryptol..

Instantiability of RSA-OAEP under Chosen-Plaintext Attack

Eike Kiltz, Adam D. Smith, Adam O'Neill, 2010, CRYPTO.

When is Nontrivial Estimation Possible for Graphons and Stochastic Block Models? pdf

Adam D. Smith, Audra McMillan, 2016, ArXiv.

Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption

Andris Ambainis, Adam D. Smith, Adam D. Smith, 2004, APPROX-RANDOM.

Efficient Lipschitz Extensions for High-Dimensional Graph Statistics and Node Private Degree Distributions pdf

Sofya Raskhodnikova, Adam D. Smith, Adam D. Smith, 2015, ArXiv.

On Perfect and Adaptive Security in Exposure-Resilient Cryptography

Amit Sahai, Yevgeniy Dodis, Adam D. Smith, 2001, EUROCRYPT.

Analyzing the HB and HB+ Protocols in the "Large Error" Case

Jonathan Katz, Adam D. Smith, Jonathan Katz, 2006, IACR Cryptol. ePrint Arch..

Robust Fuzzy Extractors and Authenticated Key Agreement From Close Secrets

Jonathan Katz, Yevgeniy Dodis, Adam D. Smith, 2006, IEEE Transactions on Information Theory.

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

Yevgeniy Dodis, Adam D. Smith, Leonid Reyzin, 2004, EUROCRYPT.

The price of privately releasing contingency tables and the spectra of random matrices with correlated rows

Adam D. Smith, Jonathan Ullman, Shiva Prasad Kasiviswanathan, 2010, STOC '10.

Efficient Consistency Proofs for Generalized Queries on a Committed Database

Rafail Ostrovsky, Adam D. Smith, Charles Rackoff, 2004, ICALP.

Reusable Fuzzy Extractors for Low-Entropy Distributions

Omer Paneth, Ran Canetti, Adam D. Smith, 2016, Journal of Cryptology.

Private Graphon Estimation for Sparse Graphs

Christian Borgs, Jennifer T. Chayes, Adam D. Smith, 2015, NIPS.

Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes

Adam D. Smith, Claude Crépeau, Daniel Gottesman, 2005, EUROCRYPT.

Efficient, Differentially Private Point Estimators pdf

Adam D. Smith, Adam D. Smith, 2008, ArXiv.

A Note on Adaptivity in Testing Properties of Bounded Degree Graphs

Sofya Raskhodnikova, Adam D. Smith, 2006, Electron. Colloquium Comput. Complex..

Differentially Private Analysis of Graphs

Sofya Raskhodnikova, Adam D. Smith, Adam D. Smith, 2016, Encyclopedia of Algorithms.

Scalable Multiparty Computation with Nearly Optimal Work and Resilience

Yuval Ishai, Ivan Damgård, Adam D. Smith, 2008, CRYPTO.

Lipschitz Extensions for Node-Private Graph Statistics and the Generalized Exponential Mechanism

Sofya Raskhodnikova, Adam D. Smith, Adam D. Smith, 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

Turning HATE Into LOVE: Homomorphic Ad Hoc Threshold Encryption for Scalable MPC

Adam D. Smith, Leonid Reyzin, Sophia Yakoubov, 2018, IACR Cryptol. ePrint Arch..

Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models

Moni Naor, Adam D. Smith, Gil Segev, 2006, CRYPTO.

Max-Information, Differential Privacy, and Post-selection Hypothesis Testing

Aaron Roth, Adam D. Smith, Ryan M. Rogers, 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

Lower bounds for collusion-secure fingerprinting

Abhi Shelat, Adam D. Smith, Chris Peikert, 2003, SODA '03.

Information, Privacy and Stability in Adaptive Data Analysis pdf

Adam D. Smith, Adam D. Smith, 2017, ArXiv.

Sublinear Algorithms for Approximating String Compressibility

Ronitt Rubinfeld, Dana Ron, Sofya Raskhodnikova, 2007, APPROX-RANDOM.

Private Analysis of Graph Structure

Sofya Raskhodnikova, Grigory Yaroslavtsev, Adam D. Smith, 2014, TODS.

Leftover Hashing Against Quantum Side Information

Adam D. Smith, Christian Schaffner, Marco Tomamichel, 2011, IEEE Transactions on Information Theory.

Correcting errors without leaking partial information

Yevgeniy Dodis, Adam D. Smith, Adam D. Smith, 2005, STOC '05.

Differentially Private Feature Selection via Stability Arguments, and the Robustness of the Lasso

Adam D. Smith, Abhradeep Thakurta, Adam D. Smith, 2013, COLT.

Detectable byzantine agreement secure against faulty majorities

Matthias Fitzi, Adam D. Smith, Martin Hirt, 2002, PODC '02.

Classical Cryptographic Protocols in a Quantum World

Adam D. Smith, Fang Song, Sean Hallgren, 2011, CRYPTO.

Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem

Dana Ron, Sofya Raskhodnikova, Adam D. Smith, 2009, SIAM J. Comput..

Maintaining secrecy when information leakage is unavoidable

Adam D. Smith, Adam D. Smith, 2004 .

Analyzing Graphs with Node Differential Privacy

Sofya Raskhodnikova, Adam D. Smith, Kobbi Nissim, 2013, TCC.

Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models

Moni Naor, Adam D. Smith, Gil Segev, 2006, IEEE Transactions on Information Theory.