Adam D. Smith - RankMe

180 papers A* 56A 7B 9Journal 92Unranked 11

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Local Node Differential Privacy. CoRR Sofya Raskhodnikova, Adam D. Smith, Connor Wagaman, Anatoly Zavyalov
2026	J	`jnl`	Node-Differentially Private Estimation of the Number of Connected Components. ACM Trans. Algorithms Iden Kalemaj, Sofya Raskhodnikova, Adam D. Smith, Charalampos E. Tsourakakis
2025	J	`jnl`	Beyond the Worst Case: Extending Differential Privacy Guarantees to Realistic Adversaries. CoRR Marika Swanberg, Meenatchi Sundaram Muthu Selva Annamalai, Jamie Hayes, Borja Balle, Adam D. Smith
2025	J	`jnl`	The Sample Complexity of Membership Inference and Privacy Auditing. CoRR Mahdi Haghifam, Adam D. Smith, Jonathan R. Ullman
2025	J	`jnl`	Triangle Counting With Local Edge Differential Privacy. Random Struct. Algorithms Talya Eden, Quanquan C. Liu, Sofya Raskhodnikova, Adam D. Smith
2024	J	`jnl`	Privacy in Metalearning and Multitask Learning: Modeling and Separations. CoRR Maryam Aliakbarpour, Konstantina Bairaktari, Adam D. Smith, Marika Swanberg, Jonathan R. Ullman
2023	A	`ed.`	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, Atlanta, Georgia, USA, September 11-13, 2023 APPROX/RANDOM Nicole Megow, Adam D. Smith
2023	A*	`conf`	Control, Confidentiality, and the Right to be Forgotten. CCS Aloni Cohen, Adam D. Smith, Marika Swanberg, Prashant Nalini Vasudevan
2023	J	`jnl`	Counting Distinct Elements in the Turnstile Model with Differential Privacy under Continual Observation. CoRR Palak Jain, Iden Kalemaj, Sofya Raskhodnikova, Satchit Sivakumar, Adam D. Smith
2023	J	`jnl`	Fast, Sample-Efficient, Affine-Invariant Private Mean and Covariance Estimation for Subgaussian Distributions. CoRR Gavin Brown, Samuel B. Hopkins, Adam D. Smith
2023	A*	`conf`	Node-Differentially Private Estimation of the Number of Connected Components. PODS Iden Kalemaj, Sofya Raskhodnikova, Adam D. Smith, Charalampos E. Tsourakakis
2023	J	`jnl`	Node-Differentially Private Estimation of the Number of Connected Components. CoRR Iden Kalemaj, Sofya Raskhodnikova, Adam D. Smith, Charalampos E. Tsourakakis
2023	A*	`conf`	The Price of Differential Privacy under Continual Observation. ICML Palak Jain, Sofya Raskhodnikova, Satchit Sivakumar, Adam D. Smith
2023	J	`jnl`	Triangle Counting with Local Edge Differential Privacy. CoRR Talya Eden, Quanquan C. Liu, Sofya Raskhodnikova, Adam D. Smith
2022	J	`jnl`	Differentially Private Sampling from Distributions. CoRR Sofya Raskhodnikova, Satchit Sivakumar, Adam D. Smith, Marika Swanberg
2022	J	`jnl`	Differentially Private Simple Linear Regression. Proc. Priv. Enhancing Technol. Daniel Alabi, Audra McMillan, Jayshree Sarathy, Adam D. Smith, Salil P. Vadhan
2022	J	`jnl`	Fully Adaptive Composition for Gaussian Differential Privacy. CoRR Adam D. Smith, Abhradeep Thakurta
2022	A*	`conf`	Improved Differential Privacy for SGD via Optimal Private Linear Operators on Adaptive Streams. NeurIPS Sergey Denisov, H. Brendan McMahan, John Rush, Adam D. Smith, Abhradeep Guha Thakurta
2022	J	`jnl`	Instance-Optimal Differentially Private Estimation. CoRR Audra McMillan, Adam D. Smith, Jonathan R. Ullman
2022	A*	`conf`	Strong Memory Lower Bounds for Learning Natural Models. COLT Gavin Brown, Mark Bun, Adam D. Smith
2022	J	`jnl`	Strong Memory Lower Bounds for Learning Natural Models. CoRR Gavin Brown, Mark Bun, Adam D. Smith
2021	J	`jnl`	Algorithmic Stability for Adaptive Data Analysis. SIAM J. Comput. Raef Bassily, Kobbi Nissim, Adam D. Smith, Thomas Steinke, Uri Stemmer, Jonathan R. Ullman
2021	A*	`conf`	Covariance-Aware Private Mean Estimation Without Private Covariance Estimation. NeurIPS Gavin Brown, Marco Gaboardi, Adam D. Smith, Jonathan R. Ullman, Lydia Zakynthinou
2021	J	`jnl`	Covariance-Aware Private Mean Estimation Without Private Covariance Estimation. CoRR Gavin Brown, Marco Gaboardi, Adam D. Smith, Jonathan R. Ullman, Lydia Zakynthinou
2021	A*	`conf`	Differentially Private Model Personalization. NeurIPS Prateek Jain, John Rush, Adam D. Smith, Shuang Song, Abhradeep Guha Thakurta
2021	A*	`conf`	Differentially Private Sampling from Distributions. NeurIPS Sofya Raskhodnikova, Satchit Sivakumar, Adam D. Smith, Marika Swanberg
2021	A*	`conf`	Manipulation Attacks in Local Differential Privacy. SP Albert Cheu, Adam D. Smith, Jonathan R. Ullman
2021	J	`jnl`	Manipulation Attacks in Local Differential Privacy. J. Priv. Confidentiality Albert Cheu, Adam D. Smith, Jonathan R. Ullman
2021	J	`jnl`	Non-parametric Differentially Private Confidence Intervals for the Median. CoRR Jörg Drechsler, Ira Globus-Harris, Audra McMillan, Jayshree Sarathy, Adam D. Smith
2021	J	`jnl`	Reusable Fuzzy Extractors for Low-Entropy Distributions. J. Cryptol. Ran Canetti, Benjamin Fuller, Omer Paneth, Leonid Reyzin, Adam D. Smith
2021	—	`conf`	Turning HATE into LOVE: Compact Homomorphic Ad Hoc Threshold Encryption for Scalable MPC. CSCML Leonid Reyzin, Adam D. Smith, Sophia Yakoubov
2021	A*	`conf`	When is memorization of irrelevant training data necessary for high-accuracy learning? STOC Gavin Brown, Mark Bun, Vitaly Feldman, Adam D. Smith, Kunal Talwar
2020	A	`ed.`	1st Conference on Information-Theoretic Cryptography, ITC 2020, Boston, MA, USA, June 17-19, 2020 ITC Yael Tauman Kalai, Adam D. Smith, Daniel Wichs
2020	J	`jnl`	Differentially Private Simple Linear Regression. CoRR Daniel Alabi, Audra McMillan, Jayshree Sarathy, Adam D. Smith, Salil P. Vadhan
2020	J	`jnl`	Empirical Risk Minimization in the Non-interactive Local Model of Differential Privacy. CoRR Di Wang, Marco Gaboardi, Adam D. Smith, Jinhui Xu
2020	J	`jnl`	Empirical Risk Minimization in the Non-interactive Local Model of Differential Privacy. J. Mach. Learn. Res. Di Wang, Marco Gaboardi, Adam D. Smith, Jinhui Xu
2020	A	`conf`	Guaranteed Validity for Empirical Approaches to Adaptive Data Analysis. AISTATS Ryan Rogers, Aaron Roth, Adam D. Smith, Nathan Srebro, Om Thakkar, Blake E. Woodworth
2020	A*	`conf`	The Flajolet-Martin Sketch Itself Preserves Differential Privacy: Private Counting with Minimal Space. NeurIPS Adam D. Smith, Shuang Song, Abhradeep Thakurta
2020	J	`jnl`	When Are Fuzzy Extractors Possible? IEEE Trans. Inf. Theory Benjamin Fuller, Leonid Reyzin, Adam D. Smith
2020	J	`jnl`	When is Memorization of Irrelevant Training Data Necessary for High-Accuracy Learning? CoRR Gavin Brown, Mark Bun, Vitaly Feldman, Adam D. Smith, Kunal Talwar
2019	—	`conf`	Distributed Differential Privacy via Shuffling. EUROCRYPT (1) Albert Cheu, Adam D. Smith, Jonathan R. Ullman, David Zeber, Maxim Zhilyaev
2019	J	`jnl`	Distributed Differential Privacy via Shuffling. IACR Cryptol. ePrint Arch. Albert Cheu, Adam D. Smith, Jonathan R. Ullman, David Zeber, Maxim Zhilyaev
2019	—	`conf`	From Soft Classifiers to Hard Decisions: How fair can we be? FAT Ran Canetti, Aloni Cohen, Nishanth Dikkala, Govind Ramnarayan, Sarah Scheffler, Adam D. Smith
2019	J	`jnl`	Guaranteed Validity for Empirical Approaches to Adaptive Data Analysis. CoRR Ryan Rogers, Aaron Roth, Adam D. Smith, Nathan Srebro, Om Thakkar, Blake E. Woodworth
2019	J	`jnl`	Manipulation Attacks in Local Differential Privacy. CoRR Albert Cheu, Adam D. Smith, Jonathan R. Ullman
2019	B	`conf`	Noninteractive Locally Private Learning of Linear Models via Polynomial Approximations. ALT Di Wang, Adam D. Smith, Jinhui Xu
2019	A*	`conf`	The structure of optimal private tests for simple hypotheses. STOC Clément L. Canonne, Gautam Kamath, Audra McMillan, Adam D. Smith, Jonathan R. Ullman
2018	J	`jnl`	Differentially Private Empirical Risk Minimization in Non-interactive Local Model via Polynomial of Inner Product Approximation. CoRR Di Wang, Adam D. Smith, Jinhui Xu
2018	J	`jnl`	Distributed Differential Privacy via Mixnets. CoRR Albert Cheu, Adam D. Smith, Jonathan R. Ullman, David Zeber, Maxim Zhilyaev
2018	J	`jnl`	From Soft Classifiers to Hard Decisions: How fair can we be? CoRR Ran Canetti, Aloni Cohen, Nishanth Dikkala, Govind Ramnarayan, Sarah Scheffler, Adam D. Smith
2018	A*	`conf`	Graph Oracle Models, Lower Bounds, and Gaps for Parallel Stochastic Optimization. NeurIPS Blake E. Woodworth, Jialei Wang, Adam D. Smith, Brendan McMahan, Nati Srebro
2018	J	`jnl`	Private Algorithms Can Always Be Extended. CoRR Christian Borgs, Jennifer T. Chayes, Adam D. Smith, Ilias Zadik
2018	A*	`conf`	Revealing Network Structure, Confidentially: Improved Rates for Node-Private Graphon Estimation. FOCS Christian Borgs, Jennifer T. Chayes, Adam D. Smith, Ilias Zadik
2018	J	`jnl`	Revealing Network Structure, Confidentially: Improved Rates for Node-Private Graphon Estimation. CoRR Christian Borgs, Jennifer T. Chayes, Adam D. Smith, Ilias Zadik
2018	A*	`conf`	The Limits of Post-Selection Generalization. NeurIPS Jonathan R. Ullman, Adam D. Smith, Kobbi Nissim, Uri Stemmer, Thomas Steinke
2018	J	`jnl`	The Limits of Post-Selection Generalization. CoRR Kobbi Nissim, Adam D. Smith, Thomas Steinke, Uri Stemmer, Jonathan R. Ullman
2018	J	`jnl`	The Structure of Optimal Private Tests for Simple Hypotheses. CoRR Clément L. Canonne, Gautam Kamath, Audra McMillan, Adam D. Smith, Jonathan R. Ullman
2018	J	`jnl`	Turning HATE Into LOVE: Homomorphic Ad Hoc Threshold Encryption for Scalable MPC. IACR Cryptol. ePrint Arch. Leonid Reyzin, Adam D. Smith, Sophia Yakoubov
2017	J	`jnl`	Information, Privacy and Stability in Adaptive Data Analysis. CoRR Adam D. Smith
2017	J	`jnl`	Instantiability of RSA-OAEP Under Chosen-Plaintext Attack. J. Cryptol. Eike Kiltz, Adam O'Neill, Adam D. Smith
2017	A*	`conf`	Is Interaction Necessary for Distributed Private Learning? IEEE Symposium on Security and Privacy Adam D. Smith, Abhradeep Thakurta, Jalaj Upadhyay
2016	A*	`conf`	Algorithmic stability for adaptive data analysis. STOC Raef Bassily, Kobbi Nissim, Adam D. Smith, Thomas Steinke, Uri Stemmer, Jonathan R. Ullman
2016	J	`jnl`	Calibrating Noise to Sensitivity in Private Data Analysis. J. Priv. Confidentiality Cynthia Dwork, Frank McSherry, Kobbi Nissim, Adam D. Smith
2016	—	`ch.`	Differentially Private Analysis of Graphs. Encyclopedia of Algorithms Sofya Raskhodnikova, Adam D. Smith
2016	A*	`conf`	Lipschitz Extensions for Node-Private Graph Statistics and the Generalized Exponential Mechanism. FOCS Sofya Raskhodnikova, Adam D. Smith
2016	J	`jnl`	Max-Information, Differential Privacy, and Post-Selection Hypothesis Testing. CoRR Ryan M. Rogers, Aaron Roth, Adam D. Smith, Om Thakkar
2016	A*	`conf`	Max-Information, Differential Privacy, and Post-selection Hypothesis Testing. FOCS Ryan M. Rogers, Aaron Roth, Adam D. Smith, Om Thakkar
2016	J	`jnl`	Optimal Rate Code Constructions for Computationally Simple Channels. J. ACM Venkatesan Guruswami, Adam D. Smith
2016	—	`conf`	Reusable Fuzzy Extractors for Low-Entropy Distributions. EUROCRYPT (1) Ran Canetti, Benjamin Fuller, Omer Paneth, Leonid Reyzin, Adam D. Smith
2016	—	`ed.`	Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part I TCC (B1) Martin Hirt, Adam D. Smith
2016	—	`ed.`	Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II TCC (B2) Martin Hirt, Adam D. Smith
2016	—	`conf`	When Are Fuzzy Extractors Possible? ASIACRYPT (1) Benjamin Fuller, Leonid Reyzin, Adam D. Smith
2016	J	`jnl`	When is Nontrivial Estimation Possible for Graphons and Stochastic Block Models? CoRR Audra McMillan, Adam D. Smith
2015	J	`jnl`	Algorithmic Stability for Adaptive Data Analysis. CoRR Raef Bassily, Kobbi Nissim, Adam D. Smith, Thomas Steinke, Uri Stemmer, Jonathan R. Ullman
2015	J	`jnl`	Classical Cryptographic Protocols in a Quantum World. CoRR Sean Hallgren, Adam D. Smith, Fang Song
2015	J	`jnl`	Classical Cryptographic Protocols in a Quantum World. IACR Cryptol. ePrint Arch. Sean Hallgren, Adam D. Smith, Fang Song
2015	J	`jnl`	Efficient Lipschitz Extensions for High-Dimensional Graph Statistics and Node Private Degree Distributions. CoRR Sofya Raskhodnikova, Adam D. Smith
2015	A*	`conf`	Local, Private, Efficient Protocols for Succinct Histograms. STOC Raef Bassily, Adam D. Smith
2015	J	`jnl`	Local, Private, Efficient Protocols for Succinct Histograms. CoRR Raef Bassily, Adam D. Smith
2015	—	`conf`	On the Regularity of Lossy RSA - Improved Bounds and Applications to Padding-Based Encryption. TCC (1) Adam D. Smith, Ye Zhang
2015	J	`jnl`	On the Regularity of Lossy RSA: Improved Bounds and Applications to Padding-Based Encryption. IACR Cryptol. ePrint Arch. Adam D. Smith, Ye Zhang
2015	A	`conf`	Privacy-Preserving Public Information for Sequential Games. ITCS Avrim Blum, Jamie Morgenstern, Ankit Sharma, Adam D. Smith
2015	—	`conf`	Private Graphon Estimation for Sparse Graphs. NIPS Christian Borgs, Jennifer T. Chayes, Adam D. Smith
2015	J	`jnl`	Private Graphon Estimation for Sparse Graphs. CoRR Christian Borgs, Jennifer T. Chayes, Adam D. Smith
2015	A*	`conf`	Robust Traceability from Trace Amounts. FOCS Cynthia Dwork, Adam D. Smith, Thomas Steinke, Jonathan R. Ullman, Salil P. Vadhan
2015	J	`jnl`	Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs. J. Cryptol. Craig Gentry, Jens Groth, Yuval Ishai, Chris Peikert, Amit Sahai, Adam D. Smith
2014	A*	`conf`	Causal Erasure Channels. SODA Raef Bassily, Adam D. Smith
2014	J	`jnl`	Causal Erasure Channels. CoRR Raef Bassily, Adam D. Smith
2014	J	`jnl`	On the 'Semantics' of Differential Privacy: A Bayesian Formulation. J. Priv. Confidentiality Shiva Prasad Kasiviswanathan, Adam D. Smith
2014	J	`jnl`	Privacy-Preserving Public Information for Sequential Games. CoRR Avrim Blum, Jamie Morgenstern, Ankit Sharma, Adam D. Smith
2014	J	`jnl`	Private Analysis of Graph Structure. ACM Trans. Database Syst. Vishesh Karwa, Sofya Raskhodnikova, Adam D. Smith, Grigory Yaroslavtsev
2014	J	`jnl`	Private Empirical Risk Minimization, Revisited. CoRR Raef Bassily, Adam D. Smith, Abhradeep Thakurta
2014	A*	`conf`	Private Empirical Risk Minimization: Efficient Algorithms and Tight Error Bounds. FOCS Raef Bassily, Adam D. Smith, Abhradeep Thakurta
2014	J	`jnl`	Where are Fuzzy Extractors Possible? IACR Cryptol. ePrint Arch. Benjamin Fuller, Adam D. Smith, Leonid Reyzin
2013	—	`conf`	(Nearly) Optimal Algorithms for Private Online Learning in Full-information and Bandit Settings. NIPS Abhradeep Guha Thakurta, Adam D. Smith
2013	B	`conf`	Analyzing Graphs with Node Differential Privacy. TCC Shiva Prasad Kasiviswanathan, Kobbi Nissim, Sofya Raskhodnikova, Adam D. Smith
2013	A*	`conf`	Coupled-Worlds Privacy: Exploiting Adversarial Uncertainty in Statistical Data Privacy. FOCS Raef Bassily, Adam Groce, Jonathan Katz, Adam D. Smith
2013	A*	`conf`	Differentially Private Feature Selection via Stability Arguments, and the Robustness of the Lasso. COLT Abhradeep Thakurta, Adam D. Smith
2013	J	`jnl`	Near-linear time, Leakage-resilient Key Evolution Schemes from Expander Graphs. IACR Cryptol. ePrint Arch. Adam D. Smith, Ye Zhang
2013	A*	`conf`	Regularity of Lossy RSA on Subdomains and Its Applications. EUROCRYPT Mark Lewko, Adam O'Neill, Adam D. Smith
2013	J	`jnl`	Sublinear Algorithms for Approximating String Compressibility. Algorithmica Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam D. Smith
2013	A*	`conf`	The Power of Linear Reconstruction Attacks. SODA Shiva Prasad Kasiviswanathan, Mark Rudelson, Adam D. Smith
2012	—	`ed.`	Information Theoretic Security - 6th International Conference, ICITS 2012, Montreal, QC, Canada, August 15-17, 2012. Proceedings ICITS Adam D. Smith
2012	A*	`conf`	Private Convex Optimization for Empirical Risk Minimization with Applications to High-dimensional Regression. COLT Daniel Kifer, Adam D. Smith, Abhradeep Thakurta
2012	J	`jnl`	Robust Fuzzy Extractors and Authenticated Key Agreement From Close Secrets. IEEE Trans. Inf. Theory Yevgeniy Dodis, Bhavana Kanukurthi, Jonathan Katz, Leonid Reyzin, Adam D. Smith
2012	J	`jnl`	Special Issue on Statistical and Learning-Theoretic Challenges in Data Privacy. J. Priv. Confidentiality Aleksandra B. Slavkovic, Adam D. Smith
2012	J	`jnl`	The Power of Linear Reconstruction Attacks CoRR Shiva Prasad Kasiviswanathan, Mark Rudelson, Adam D. Smith
2011	A*	`conf`	Classical Cryptographic Protocols in a Quantum World. CRYPTO Sean Hallgren, Adam D. Smith, Fang Song
2011	J	`jnl`	Instantiability of RSA-OAEP under Chosen-Plaintext Attack. IACR Cryptol. ePrint Arch. Eike Kiltz, Adam O'Neill, Adam D. Smith
2011	J	`jnl`	Leftover Hashing Against Quantum Side Information. IEEE Trans. Inf. Theory Marco Tomamichel, Christian Schaffner, Adam D. Smith, Renato Renner
2011	A*	`conf`	Privacy-preserving statistical estimation with optimal convergence rates. STOC Adam D. Smith
2011	J	`jnl`	Private Analysis of Graph Structure. Proc. VLDB Endow. Vishesh Karwa, Sofya Raskhodnikova, Adam D. Smith, Grigory Yaroslavtsev
2011	J	`jnl`	What Can We Learn Privately? SIAM J. Comput. Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam D. Smith
2010	J	`jnl`	Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate CoRR Venkatesan Guruswami, Adam D. Smith
2010	A*	`conf`	Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate. FOCS Venkatesan Guruswami, Adam D. Smith
2010	J	`jnl`	Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate. Electron. Colloquium Comput. Complex. Venkatesan Guruswami, Adam D. Smith
2010	J	`jnl`	Differential Privacy for Statistics: What we Know and What we Want to Learn. J. Priv. Confidentiality Cynthia Dwork, Adam D. Smith
2010	A*	`conf`	Discovering frequent patterns in sensitive data. KDD Raghav Bhaskar, Srivatsan Laxman, Adam D. Smith, Abhradeep Thakurta
2010	A*	`conf`	Instantiability of RSA-OAEP under Chosen-Plaintext Attack. CRYPTO Eike Kiltz, Adam O'Neill, Adam D. Smith
2010	B	`conf`	Leftover Hashing against quantum side information. ISIT Marco Tomamichel, Renato Renner, Christian Schaffner, Adam D. Smith
2010	J	`jnl`	Parallel and Concurrent Security of the HB and HB J. Cryptol. Jonathan Katz, Ji Sun Shin, Adam D. Smith
2010	J	`jnl`	Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets. IACR Cryptol. ePrint Arch. Yevgeniy Dodis, Bhavana Kanukurthi, Jonathan Katz, Leonid Reyzin, Adam D. Smith
2010	A*	`conf`	The price of privately releasing contingency tables and the spectra of random matrices with correlated rows. STOC Shiva Prasad Kasiviswanathan, Mark Rudelson, Adam D. Smith, Jonathan R. Ullman
2009	B	`conf`	Asymptotically Optimal and Private Statistical Estimation. CANS Adam D. Smith
2009	B	`conf`	Composability and On-Line Deniability of Authentication. TCC Yevgeniy Dodis, Jonathan Katz, Adam D. Smith, Shabsi Walfish
2009	J	`jnl`	Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem. SIAM J. Comput. Sofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam D. Smith
2009	—	`conf`	What Can Cryptography Do for Coding Theory? ICITS Adam D. Smith
2008	J	`jnl`	A Note on Differential Privacy: Defining Resistance to Arbitrary Side Information CoRR Shiva Prasad Kasiviswanathan, Adam D. Smith
2008	J	`jnl`	Composition Attacks and Auxiliary Information in Data Privacy CoRR Srivatsava Ranjit Ganta, Shiva Prasad Kasiviswanathan, Adam D. Smith
2008	A*	`conf`	Composition attacks and auxiliary information in data privacy. KDD Srivatsava Ranjit Ganta, Shiva Prasad Kasiviswanathan, Adam D. Smith
2008	A	`conf`	Defending Against Attacks on Main Memory Persistence. ACSAC William Enck, Kevin R. B. Butler, Thomas Richardson, Patrick D. McDaniel, Adam D. Smith
2008	A*	`conf`	Efficient Two Party and Multi Party Computation Against Covert Adversaries. EUROCRYPT Vipul Goyal, Payman Mohassel, Adam D. Smith
2008	J	`jnl`	Efficient, Differentially Private Point Estimators CoRR Adam D. Smith
2008	J	`jnl`	Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data. SIAM J. Comput. Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, Adam D. Smith
2008	A*	`conf`	Scalable Multiparty Computation with Nearly Optimal Work and Resilience. CRYPTO Ivan Damgård, Yuval Ishai, Mikkel Krøigaard, Jesper Buus Nielsen, Adam D. Smith
2008	J	`jnl`	Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. IEEE Trans. Inf. Theory Moni Naor, Gil Segev, Adam D. Smith
2008	A*	`conf`	What Can We Learn Privately? FOCS Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam D. Smith
2008	J	`jnl`	What Can We Learn Privately? CoRR Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam D. Smith
2007	A*	`conf`	Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes. SODA Adam D. Smith
2007	A*	`conf`	Smooth sensitivity and sampling in private data analysis. STOC Kobbi Nissim, Sofya Raskhodnikova, Adam D. Smith
2007	A*	`conf`	Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem. FOCS Sofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam D. Smith
2007	J	`jnl`	Sublinear Algorithms for Approximating String Compressibility CoRR Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam D. Smith
2007	—	`conf`	Sublinear Algorithms for Approximating String Compressibility. APPROX-RANDOM Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam D. Smith
2006	J	`jnl`	A Note on Adaptivity in Testing Properties of Bounded Degree Graphs. Electron. Colloquium Comput. Complex. Sofya Raskhodnikova, Adam D. Smith
2006	J	`jnl`	Analyzing the HB and HB+ Protocols in the "Large Error" Case. IACR Cryptol. ePrint Arch. Jonathan Katz, Adam D. Smith
2006	B	`conf`	Calibrating Noise to Sensitivity in Private Data Analysis. TCC Cynthia Dwork, Frank McSherry, Kobbi Nissim, Adam D. Smith
2006	J	`jnl`	Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data CoRR Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, Adam D. Smith
2006	A*	`conf`	Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets. CRYPTO Yevgeniy Dodis, Jonathan Katz, Leonid Reyzin, Adam D. Smith
2006	J	`jnl`	Scrambling Adversarial Errors Using Few Random Bits, Optimal Information Reconciliation, and Better Private Codes. IACR Cryptol. ePrint Arch. Adam D. Smith
2006	A*	`conf`	Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority. FOCS Michael Ben-Or, Claude Crépeau, Daniel Gottesman, Avinatan Hassidim, Adam D. Smith
2006	A*	`conf`	Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. CRYPTO Moni Naor, Gil Segev, Adam D. Smith
2006	J	`jnl`	Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. IACR Cryptol. ePrint Arch. Moni Naor, Gil Segev, Adam D. Smith
2005	J	`jnl`	Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes CoRR Claude Crépeau, Daniel Gottesman, Adam D. Smith
2005	A*	`conf`	Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes. EUROCRYPT Claude Crépeau, Daniel Gottesman, Adam D. Smith
2005	A*	`conf`	Correcting errors without leaking partial information. STOC Yevgeniy Dodis, Adam D. Smith
2005	B	`conf`	Entropic Security and the Encryption of High Entropy Messages. TCC Yevgeniy Dodis, Adam D. Smith
2005	A*	`conf`	Secure Remote Authentication Using Biometric Data. EUROCRYPT Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafail Ostrovsky, Adam D. Smith
2005	J	`jnl`	Sublinear Algorithms for Approximating String Compressibility and the Distribution Support Size Electron. Colloquium Comput. Complex. Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Amir Shpilka, Adam D. Smith
2005	B	`conf`	Toward Privacy in Public Databases. TCC Shuchi Chawla, Cynthia Dwork, Frank McSherry, Adam D. Smith, Hoeteck Wee
2004	A*	`conf`	Efficient Consistency Proofs for Generalized Queries on a Committed Database. ICALP Rafail Ostrovsky, Charles Rackoff, Adam D. Smith
2004	J	`jnl`	Efficient Consistency Proofs for Generalized Queries on a Committed Database. IACR Cryptol. ePrint Arch. Rafail Ostrovsky, Charles Rackoff, Adam D. Smith
2004	J	`jnl`	Entropic Security and the Encryption of High Entropy Messages. IACR Cryptol. ePrint Arch. Yevgeniy Dodis, Adam D. Smith
2004	A*	`conf`	Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data. EUROCRYPT Yevgeniy Dodis, Leonid Reyzin, Adam D. Smith
2004	B	`conf`	List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument. TCC Cynthia Dwork, Ronen Shaltiel, Adam D. Smith, Luca Trevisan
2004	—	`—`	Maintaining secrecy when information leakage is unavoidable. Adam D. Smith
2004	—	`conf`	Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption. APPROX-RANDOM Andris Ambainis, Adam D. Smith
2003	J	`jnl`	Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data. IACR Cryptol. ePrint Arch. Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, Adam D. Smith
2003	A*	`conf`	Lower bounds for collusion-secure fingerprinting. SODA Chris Peikert, Abhi Shelat, Adam D. Smith
2003	A*	`conf`	Round Efficiency of Multi-party Computation with a Dishonest Majority. EUROCRYPT Jonathan Katz, Rafail Ostrovsky, Adam D. Smith
2002	J	`jnl`	Authentication of Quantum Messages CoRR Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam D. Smith, Alain Tapp
2002	A*	`conf`	Authentication of Quantum Messages. FOCS Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam D. Smith, Alain Tapp
2002	J	`jnl`	Authentication of Quantum Messages. IACR Cryptol. ePrint Arch. Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam D. Smith, Alain Tapp
2002	A*	`conf`	Detectable byzantine agreement secure against faulty majorities. PODC Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, Adam D. Smith
2002	A	`conf`	Extracting Quantum Entanglement. CCC Andris Ambainis, Adam D. Smith, Ke Yang
2002	A*	`conf`	Secure multi-party quantum computation. STOC Claude Crépeau, Daniel Gottesman, Adam D. Smith
2001	J	`jnl`	Efficient and Non-Interactive Non-Malleable Commitment. IACR Cryptol. ePrint Arch. Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam D. Smith
2001	A*	`conf`	Efficient and Non-interactive Non-malleable Commitment. EUROCRYPT Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam D. Smith
2001	A	`conf`	Mutually Independent Commitments. ASIACRYPT Moses D. Liskov, Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Adam D. Smith
2001	A*	`conf`	On Perfect and Adaptive Security in Exposure-Resilient Cryptography. EUROCRYPT Yevgeniy Dodis, Amit Sahai, Adam D. Smith
1999	J	`jnl`	Multiparty computation unconditionally secure against Q^2 adversary structures CoRR Adam D. Smith, Anton Stiglic