Adam D. Smith
Ph.D. (MIT), 2004
Assistant Professor
Computer Science and Engineering
Department Pennsylvania
State University, University
Park
I am part of the Theory of
Computation and the Systems and
Internet Infrastructure Security (SIIS) groups at Penn State. If
you are interested in cryptography or theoretical computer science,
consider attending the theory seminar
(or at least sign up for the mailing list). If you are interested in
the CSE graduate program, please look at http://www.cse.psu.edu/academics/graduate/
for information on admission and a description of the
program. Research assistantships are available for strong candidates
interested in working in cryptography and theory.
My research studies cryptography and privacy and their
connections to diverse fields such as information theory,
combinatorics, quantum mechanics and statistics. Recently, I've focused on a few specific topics:
- Privacy-preserving publication of statistical data
- Cryptography based on noisy secrets ("fuzzy cryptography")
- Efficient two- and multi-party protocols for tasks such as agreement, commitment and secure function evaluation.
- Quantum cryptography, and quantum information theory
Here is a more detailed, but still high-level, description: PDF.
During Fall 2006, before coming to Penn State, I was Securing
Cyberspace at UCLA's IPAM. Previously, I was a
post-doc at the Weizmann
Institute in Rehovot, Israel, hosted by Moni Naor. Before
that, I did a Ph.D. in the Computer
Science and AI Lab at MIT, under the supervision of Madhu Sudan.
The picture above was taken in Olympic National Park, Washington (click for a picture of Maya and me)
|
Teaching
Contact information
- Email:
- Office telephone: +1-814-863-0076
Fax: +1-814-865-3176
- Mailing adress:
338K IST building, College of Engineering
Department of Computer Science and Engineering
Pennsylvania State University
University Park, PA 16802
Professional Information:
- Curriculum vitae (updated Sep.'07):
PDF
- Program committee member for CRYPTO 2005, TCC 2006, CT-RSA 2007, EC'07 (Electronic
Commerce), CRYPTO 2007, PPDM@ICML,
QIP 2008,
TQC 2008,
WWW 2008 (Security & Privacy track),
SCN 2008, CRYPTO 2008 ,
SODA 2009,
CRYPTO 2009 .
Life:
|
Survey/Tutorial Presentations
Publications and Research
- What Can We Learn Privately?
- Authors: Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith
- In FOCS 2008
-
Composition Attacks and Auxiliary Information in Data Privacy
- Authors: Srivatsava Ranjit Ganta, Shiva Prasad
Kasiviswanathan and Adam Smith
- In KDD 2008
- Scalable Multiparty Computation with
Nearly Optimal Work and Resilience
- Authors: Ivan Damgaard, Yuval Ishai , Mikkel Kroigaard,
Jesper Buus Nielsen and Adam Smith
- IN CRYPTO 2008
- Efficient Two Party and Multi Party Computation Against
Covert Adversaries.
- Authors: Vipul Goyal, Payman Mohassel and Adam Smith
- In Eurocrypt 2007
- Strong Lower Bounds for Approximating
Distribution Support Size and the Distinct Elements Problem.
- Authors: Sofya Raskhodnikova, Dana Ron, Amir Shpilka and Adam Smith.
- In Symposium on the Foundations of Computer Science (FOCS) 2007 .
- Conference version: PDF
- The results in this paper appeared previously as part of
Electronic Colloquium on Communication Complexity Technical
Report TR05-125
(with additional co-author Ronitt Rubinfeld).
- Sublinear Algorithms for
Approximating String Compressibility
- Authors: Sofya Raskhodnikova, Dana Ron, Ronnitt Rubinfeld and
Adam Smith.
- In RANDOM 2007, Princeton, NJ, August 2007.
- Conference version: pdf
- Full version: pdf
- The results in this paper appeared previously as part of
Electronic Colloquium on Communication Complexity Technical
Report TR05-125
(with additional co-author Amir Shpilka).
- Smooth Sensitivity and Sampling in Private Data Analysis
- Scrambling Adversarial Errors Using Few Random Bits
- Author: Adam Smith
- In SODA 2007.
- Available as IACR ePrint Report 2006/020.
- Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority
- Authors: Michael Ben-Or, Claude Crepeau, Daniel Gottesman, Avinatan Hassidim, and Adam Smith
- In FOCS 2006
- Tight Bounds for
Unconditional Authentication Protocols in the Manual Channel and
Shared Key Models
- Robust Fuzzy Extractors and Authenticated Key Agreement
from Close Secrets
- Calibrating Noise to Sensitivity in Private Data Analysis
-
Correcting Errors Without Leaking Partial Information
- Authors: Yevgeniy Dodis and Adam Smith
- In STOC 2005, Baltimore, MD, May 2005.
- Conference version: PDF, PS
- Seminar talk: ppt
- Approximate Quantum Error Correcting Codes and Verifiable Secret Sharing
- Secure
Remote Authentication Using Biometric Data
- Towards
Privacy in Public Databases
- Entropic Security
and the Encryption of High Entropy Messages
- Maintaining Secrecy When Information Leakage is Unavoidable
- Ph.D. Thesis, MIT, August 2004.
- Supervisor: Professor Madhu Sudan
- Small
Pseudo-Random Families of Matrices: Derandomizing Approximate Quantum
Encryption.
-
Efficient Proofs of Consistency for Generalized Queries on a Committed
Database.
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data.
- List-Decoding of
Linear Functions and Analysis of a Two-Round Zero-Knowledge
Argument.
- Round
Efficiency of Multi-Party Computation with a Dishonest Majority
- Lower Bounds for Collusion-Secure
Fingerprinting Codes
- Authentication of Quantum
Messages,
- Detectable Byzantine
Agreement Tolerating Faulty Majorities (from scratch),
- Quantum Multi-party
Computation,
- Quantum Multi-party
Computation
- General
Entanglement Purification Procedures,
- March Madness is
(NP-)Hard.
- Mutually Independent
Commitment
- Efficient and
Non-interactive Non-malleable Commitment,
- On Perfect and Adaptive
Security in Exposure-Resilient Cryptography
- Authors:
Yevgeniy Dodis, Amit Sahai and Adam
Smith.
- In Proc. of Eurocrypt 2001, Springer LNCS
2045, pp. 301-324, May 2001.
- Conference talk: PDF
- My books: An
Inquiry into the Nature and Causes of the Wealth of Nations,
(Strahan, Cadell & Co., London, 1776) and The Theory
of Moral Sentiments (Edinburgh, 1759).
- Quantum Secret Sharing for
General Access Structures
- Author: Adam Smith.
- A note describing some results from my undergraduate
research project.
- Unpublished. Available as quant-ph/0001087.
- Technical report on multiparty computation, with Anton Stiglic
(postscript),
McGill University, Montreal, 1998.
|