Photo of Adam Smith

Adam Smith

Adjunct Professor Of Computer Science And Engineering

Department(s):

  • School of Electrical Engineering and Computer Science

Research Areas:

Interest Areas:

Cryptography, data privacy, quantum computing.

 
 

 

Education

  • B.Sc., Mathematics and Computer Science, McGill University, 1999
  • S.M., Computer Science, Massachusetts Institute of Technology, 2001
  • Ph D, Computer Science, Massachusetts Institute of Technology, 2004

Publications

Book

  • Martin Hirt and Adam D Smith, 2016, Theory of Cryptography, 14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016, Proceedings, Springer Verlag

Book, Chapter

  • Y. Dodis, L. Reyzin and Adam D Smith, 2007, Fuzzy Extractors, Springer-Verlag London, pp. 79-99

Journal Article

  • E. Kiltz, A. O’Neill and Adam D Smith, 2016, "Instantiability of RSA-OAEP Under Chosen-Plaintext Attack", Journal of Cryptology
  • V. Guruswami and Adam D Smith, 2016, "Optimal rate code constructions for computationally simple channels", Journal of the ACM, 63, (4)
  • Raef Bassily, Kobbi Nissim, Adam D Smith, Thomas Steinke, Uri Stemmer and Jonathan Ullman, 2015, "Algorithmic Stability for Adaptive Data Analysis", CoRR, abs/1511.02513
  • Sean Hallgren, Adam D Smith and Fang Song, 2015, "Classical Cryptographic Protocols in a Quantum World", CoRR, abs/1507.01625
  • Sofya Raskhodnikova and Adam D Smith, 2015, "Efficient Lipschitz Extensions for High-Dimensional Graph Statisticsand Node Private Degree Distributions", CoRR, abs/1504.07912
  • Raef Bassily and Adam D Smith, 2015, "Local, Private, Efficient Protocols for Succinct Histograms", CoRR, abs/1504.04686
  • Raef Bassily, Adam D Smith, Thomas Steinke and Jonathan Ullman, 2015, "More General Queries and Less Generalization Error in Adaptive DataAnalysis", CoRR, abs/1503.04843
  • Adam D Smith and Ye Zhang, 2015, "On the Regularity of Lossy RSA: Improved Bounds and Applicationsto Padding-Based Encryption", IACR Cryptology ePrint Archive, 2015, pp. 27
  • Christian Borgs, Jennifer T. Chayes and Adam D Smith, 2015, "Private Graphon Estimation for Sparse Graphs", CoRR, abs/1506.06162
  • Craig Gentry, Jens Groth, Yuval Ishai, Chris Peikert, Amit Sahai and Adam D Smith, 2015, "Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs", Journal of Cryptology, 28, (4), pp. 820–843
  • Vishesh Karwa, Sofya Raskhodnikova, Adam D Smith and Grigory Yaroslavtsev, 2014, "Private Analysis of Graph Structure", ACM Transactions on Database Systems, 39, (3), pp. 22
  • Shiva Prasad Kasiviswanathan and Adam D Smith, 2014, "On the 'Semantics' of Differential Privacy: A Bayesian Formulation", Journal of Privacy and Confidentiality, 6, (1), pp. 1-16
  • Adam D Smith and Ye Zhang, 2013, "Near-linear time, Leakage-resilient Key Evolution Schemes from ExpanderGraphs", IACR Cryptology ePrint Archive, 2013, pp. 864
  • Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld and Adam D Smith, 2013, "Sublinear Algorithms for Approximating String Compressibility", Algorithmica, 65, (3), pp. 685–709
  • Yevgeniy Dodis, Bhavana Kanukurthi, Jonathan Katz, Leonid Reyzin and Adam D Smith, 2012, "Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets", IEEE Transactions on Information Theory, 58, (9), pp. 6207–6222
  • Daniel Kifer, Adam D Smith and Abhradeep Thakurta, 2012, "Private Convex Optimization for Empirical Risk Minimization with Applicationsto High-dimensional Regression", Journal of Machine Learning Research, 23, pp. 25.1–25.40
  • Marco Tomamichel, Renato Renner, Christian Schaffner and Adam D Smith, 2011, "Leftover Hashing against quantum side information", IEEE Transactions on Information Theory, 57, (8), pp. 5524-5535
  • Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova and Adam D Smith, 2011, "What Can We Learn Privately?", SIAM Journal on Computing, 40, (3), pp. 793–826
  • Jonathan Katz, Ji Sun Shin and Adam D Smith, 2010, "Parallel and Concurrent Security of the HB and HB+Protocols", Journal of Cryptology, 23, (3), pp. 402–421
  • Sofya Raskhodnikova, Dana Ron, Amir Shpilka and Adam D Smith, 2009, "Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem", SIAM Journal on Computing, 39, (3), pp. 813–842
  • Moni Naor, Gil Segev and Adam D Smith, 2008, "Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models", IEEE Transactions on Information Theory, 54, (6), pp. 2408–2425
  • Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin and Adam D Smith, 2008, "Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data", SIAM Journal on Computing, 38, (1), pp. 97–139
  • Shiva Prasad Kasiviswanathan and Adam D Smith, 2008, "A Note on Differential Privacy: Defining Resistance to Arbitrary SideInformation", IACR Cryptology ePrint Archive, 2008, pp. 144
  • Sofya Raskhodnikova and Adam D Smith, 2006, "A Note on Adaptivity in Testing Properties of Bounded Degree Graphs", Electronic Colloquium on Computational Complexity (ECCC), 13, (089)
  • Jonathan Katz and Adam D Smith, 2006, "Analyzing the HB and HB+ Protocols in the "Large Error" Case", IACR Cryptology ePrint Archive, 2006, pp. 326
  • Adam D Smith, 2006, "Scrambling Adversarial Errors Using Few Random Bits, Optimal InformationReconciliation, and Better Private Codes", IACR Cryptology ePrint Archive, 2006, pp. 20
  • Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Amir Shpilka and Adam D Smith, 2005, "Sublinear Algorithms for Approximating String Compressibility andthe Distribution Support Size", Electronic Colloquium on Computational Complexity (ECCC), (125)
  • Yevgeniy Dodis and Adam D Smith, 2004, "Entropic Security and the Encryption of High Entropy Messages", IACR Cryptology ePrint Archive, 2004, pp. 219
  • Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin and Adam D Smith, 2003, "Fuzzy Extractors: How to Generate Strong Keys from Biometrics andOther Noisy Data", IACR Cryptology ePrint Archive, 2003, pp. 235
  • Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam D Smith and Alain Tapp, 2002, "Authentication of Quantum Messages", IACR Cryptology ePrint Archive, 2002, pp. 82
  • Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky and Adam D Smith, 2001, "Efficient and Non-Interactive Non-Malleable Commitment", IACR Cryptology ePrint Archive, 2001, pp. 32
  • V. Guruswami and Adam D Smith, , "Optimal-Rate Code Constructions for Computationally Simple Channels.", Journal of the ACM

Conference Proceeding

  • S. Raskhodnikova and Adam D Smith, 2016, "Lipschitz Extensions for Node-Private Graph Statistics and the Generalized Exponential Mechanism", 2016-December
  • R. Rogers, A. Roth, Adam D Smith and O. Thakkar, 2016, "Max-Information, Differential Privacy, and Post-selection Hypothesis Testing", IEEE Computer Society, 2016-December
  • R. Bassily, T. Steinke, K. Nissim, U. Stemmer, Adam D Smith and J. Ullman, 2016, "Algorithmic stability for adaptive data analysis", Association for Computing Machinery, 19-21
  • Ran Canetti, Benjamin Fuller, Omer Paneth, Leonid Reyzin and Adam D Smith, 2016, "Reusable Fuzzy Extractors for Low-Entropy Distributions", Springer Verlag, pp. 29
  • B. Fuller, L. Reyzin and Adam D Smith, 2016, "When are fuzzy extractors possible?", Springer Verlag, 10031 LNCS
  • C. Borgs, J. Chayes and Adam D Smith, 2015, "Private Graphon Estimation for Sparse Graphs"
  • C. Dwork, T. Steinke, Adam D Smith, J. Ullman and S. Vadhan, 2015, "Robust Traceability from Trace Amounts"
  • R. Bassily and Adam D Smith, 2015, "Local, Private, Efficient Protocols for Succinct Histograms", ACM, pp. 127-135
  • Adam D Smith and Ye Zhang, 2015, "On the Regularity of Lossy RSA - Improved Bounds and Applicationsto Padding-Based Encryption", Springer, pp. 609–628
  • Avrim Blum, Jamie Morgenstern, Ankit Sharma and Adam D Smith, 2015, "Privacy-Preserving Public Information for Sequential Games", ACM, pp. 173–180
  • Raef Bassily, Adam D Smith and Abhradeep Thakurta, 2014, "Private Empirical Risk Minimization: Efficient Algorithms and Tight Error Bounds", IEEE Computer Society, pp. 464–473
  • Raef Bassily and Adam D Smith, 2014, "Causal Erasure Channels", SIAM, pp. 1844–1857
  • Abhradeep Guha Thakurta and Adam D Smith, 2013, "(Nearly) Optimal Algorithms for Private Online Learning in Full-information and Bandit Settings", pp. 2733–2741
  • Raef Bassily, Adam Groce, Jonathan Katz and Adam D Smith, 2013, "Coupled-Worlds Privacy: Exploiting Adversarial Uncertainty in Statistical Data Privacy", IEEE Computer Society, pp. 439–448
  • Abhradeep Thakurta and Adam D Smith, 2013, "Differentially Private Feature Selection via Stability Arguments and the Robustness of the Lasso", JMLR.org, 30, pp. 819–850
  • Mark Lewko, Adam O’Neill and Adam D Smith, 2013, "Regularity of Lossy RSA on Subdomains and Its Applications", Springer, 7881, pp. 55–75
  • Shiva Prasad Kasiviswanathan, Kobbi Nissim, Sofya Raskhodnikova and Adam D Smith, 2013, "Analyzing Graphs with Node Differential Privacy", pp. 457–476
  • Shiva Prasad Kasiviswanathan, Mark Rudelson and Adam D Smith, 2013, "The Power of Linear Reconstruction Attacks", SIAM, pp. 1415–1433
  • Daniel Kifer, Adam D Smith and Abhradeep Thakurta, 2012, "Private Convex Optimization for Empirical Risk Minimization with Applications to High-dimensional Regression", JMLR.org, 23, pp. 25.1–25.40
  • Vishesh Karwa, Sofya Raskhodnikova, Adam D Smith and Grigory Yaroslavtsev, 2011, "Private Analysis of Graph Structure", 4, (11), pp. 1146–1157
  • Sean Hallgren, Adam D Smith and Fang Song, 2011, "Classical Cryptographic Protocols in a Quantum World", Springer, 6841, pp. 411–428
  • Adam D Smith, 2011, "Privacy-preserving statistical estimation with optimal convergence rates", ACM, pp. 813–822
  • Venkatesan Guruswami and Adam D Smith, 2010, "Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate", pp. 723-732
  • Eike Kiltz, Adam O’Neill and Adam D Smith, 2010, "Instantiability of RSA-OAEP under Chosen-Plaintext Attack", 6223, pp. 295-313
  • Raghav Bhaskar, Srivatsan Laxman, Adam D Smith and Abhradeep Thakurta, 2010, "Discovering frequent patterns in sensitive data", ACM, pp. 503–512
  • Marco Tomamichel, Renato Renner, Christian Schaffner and Adam D Smith, 2010, "Leftover Hashing against quantum side information", IEEE, pp. 2703–2707
  • Shiva Prasad Kasiviswanathan, Mark Rudelson, Adam D Smith and Jonathan Ullman, 2010, "The price of privately releasing contingency tables and the spectra of random matrices with correlated rows", ACM, pp. 775–784
  • Adam D Smith, 2009, "Integrating Differential Privacy with Statistical Theory"
  • Yevgeniy Dodis, Jonathan Katz, Adam D Smith and Shabsi Walfish, 2009, "Composability and On-Line Deniability of Authentication", pp. 146–162
  • William Enck, Kevin R. B. Butler, Thomas Richardson, Patrick D McDaniel and Adam D Smith, 2008, "Defending Against Attacks on Main Memory Persistence", pp. 65–74
  • Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova and Adam D Smith, 2008, "What Can We Learn Privately?", pp. 531–540
  • Srivatsava Ranjit Ganta, Shiva Prasad Kasiviswanathan and Adam D Smith, 2008, "Composition attacks and auxiliary information in data privacy", pp. 265–273
  • Ivan Damgård, Yuval Ishai, Mikkel Krøigaard, Jesper Buus Nielsen and Adam D Smith, 2008, "Scalable Multiparty Computation with Nearly Optimal Work and Resilience", pp. 241–261
  • C. Dwork and Adam D Smith, 2008, "Differential Privacy and Statistics: What We Know and What We Want to Learn"
  • Vipul Goyal, Payman Mohassel and Adam D Smith, 2008, "Efficient Two Party and Multi Party Computation Against Covert Adversaries", pp. 289–306
  • Sofya Raskhodnikova, Dana Ron, Amir Shpilka and Adam D Smith, 2007, "Strong Lower Bounds for Approximating Distribution Support Size andthe Distinct Elements Problem", pp. 559–569
  • Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld and Adam D Smith, 2007, "Sublinear Algorithms for Approximating String Compressibility", pp. 609-623
  • Kobbi Nissim, Sofya Raskhodnikova and Adam D Smith, 2007, "Smooth sensitivity and sampling in private data analysis", pp. 75–84
  • Adam D Smith, 2007, "Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes", pp. 395–404
  • Michael Ben-Or, Claude Crépeau, Daniel Gottesman, Avinatan Hassidim and Adam D Smith, 2006, "Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority", pp. 249–260
  • Yevgeniy Dodis, Jonathan Katz, Leonid Reyzin and Adam D Smith, 2006, "Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets", pp. 232–250
  • Moni Naor, Gil Segev and Adam D Smith, 2006, "Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models", pp. 214-231
  • Cynthia Dwork, Frank McSherry, Kobbi Nissim and Adam D Smith, 2006, "Calibrating Noise to Sensitivity in Private Data Analysis", pp. 265–284
  • Claude Crépeau, Daniel Gottesman and Adam D Smith, 2005, "Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes", pp. 285–301
  • Yevgeniy Dodis and Adam D Smith, 2005, "Correcting errors without leaking partial information", pp. 654–663
  • Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafail Ostrovsky and Adam D Smith, 2005, "Secure Remote Authentication Using Biometric Data", pp. 147–163
  • Shuchi Chawla, Cynthia Dwork, Frank McSherry, Adam D Smith and Hoeteck Wee, 2005, "Toward Privacy in Public Databases", pp. 363–385
  • Yevgeniy Dodis and Adam D Smith, 2005, "Entropic Security and the Encryption of High Entropy Messages", pp. 556–577
  • Andris Ambainis and Adam D Smith, 2004, "Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption", pp. 249–260
  • Rafail Ostrovsky, Charles Rackoff and Adam D Smith, 2004, "Efficient Consistency Proofs for Generalized Queries on a Committed Database", pp. 1041-1053
  • Yevgeniy Dodis, Leonid Reyzin and Adam D Smith, 2004, "Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data", pp. 523–540
  • Cynthia Dwork, Ronen Shaltiel, Adam D Smith and Luca Trevisan, 2004, "List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument", pp. 101–120
  • Jonathan Katz, Rafail Ostrovsky and Adam D Smith, 2003, "Round Efficiency of Multi-party Computation with a Dishonest Majority", pp. 578–595
  • Chris Peikert, Abhi Shelat and Adam D Smith, 2003, "Lower bounds for collusion-secure fingerprinting", pp. 472–479
  • Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam D Smith and Alain Tapp, 2002, "Authentication of Quantum Messages", pp. 449–458
  • Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein and Adam D Smith, 2002, "Detectable byzantine agreement secure against faulty majorities", pp. 118–126
  • Andris Ambainis, Adam D Smith and Ke Yang, 2002, "Extracting Quantum Entanglement", pp. 103–112
  • Claude Crépeau, Daniel Gottesman and Adam D Smith, 2002, "Secure multi-party quantum computation", pp. 643–652
  • Moses Liskov, Anna Lysyanskaya, Silvio Micali, Leonid Reyzin and Adam D Smith, 2001, "Mutually Independent Commitments", pp. 385–401
  • Yevgeniy Dodis, Amit Sahai and Adam D Smith, 2001, "On Perfect and Adaptive Security in Exposure-Resilient Cryptography", pp. 301–324
  • Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky and Adam D Smith, 2001, "Efficient and Non-interactive Non-malleable Commitment", pp. 40–59

Other

  • Adam D Smith, 2009, "A Cryptographer’s-eye View of Privacy in Statistical Databases", pp. 1
  • Adam D Smith, 2009, "What Can Cryptography Do for Coding Theory?", pp. 158

Research Projects

Honors and Awards

  • 2017 Gödel Prize, European Association for Theoretical Computer Science (EATCS) and the Special Interest Group on Algorithms and Computation Theory of the Association for Computing Machinery (ACM SIGACT), April 2017

Service

Service to Penn State:

Service to External Organizations:

 


 

About

The School of Electrical Engineering and Computer Science was created in the spring of 2015 to allow greater access to courses offered by both departments for undergraduate and graduate students in exciting collaborative research in fields.

We offer B.S. degrees in electrical engineering, computer science, computer engineering and data science and graduate degrees (master's degrees and Ph.D.'s) in electrical engineering and computer science and engineering. EECS focuses on the convergence of technologies and disciplines to meet today’s industrial demands.

School of Electrical Engineering and Computer Science

The Pennsylvania State University

207 Electrical Engineering West

University Park, PA 16802

814-863-6740

Department of Computer Science and Engineering

814-865-9505

Department of Electrical Engineering

814-865-7667