2009 | ||
---|---|---|
48 | EE | Yevgeniy Dodis, Jonathan Katz, Adam Smith, Shabsi Walfish: Composability and On-Line Deniability of Authentication. TCC 2009: 146-162 |
2008 | ||
47 | EE | Ivan Damgård, Yuval Ishai, Mikkel Krøigaard, Jesper Buus Nielsen, Adam Smith: Scalable Multiparty Computation with Nearly Optimal Work and Resilience. CRYPTO 2008: 241-261 |
46 | EE | Vipul Goyal, Payman Mohassel, Adam Smith: Efficient Two Party and Multi Party Computation Against Covert Adversaries. EUROCRYPT 2008: 289-306 |
45 | EE | Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith: What Can We Learn Privately? FOCS 2008: 531-540 |
44 | EE | Srivatsava Ranjit Ganta, Shiva Prasad Kasiviswanathan, Adam Smith: Composition attacks and auxiliary information in data privacy. KDD 2008: 265-273 |
43 | EE | Zachary Pousman, Mario Romero, Adam Smith, Michael Mateas: Living with tableau machine: a longitudinal investigation of a curious domestic intelligence. UbiComp 2008: 370-379 |
42 | EE | Srivatsava Ranjit Ganta, Shiva Prasad Kasiviswanathan, Adam Smith: Composition Attacks and Auxiliary Information in Data Privacy CoRR abs/0803.0032: (2008) |
41 | EE | Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith: What Can We Learn Privately? CoRR abs/0803.0924: (2008) |
40 | EE | Shiva Prasad Kasiviswanathan, Adam Smith: A Note on Differential Privacy: Defining Resistance to Arbitrary Side Information CoRR abs/0803.3946: (2008) |
39 | EE | Adam Smith: Efficient, Differentially Private Point Estimators CoRR abs/0809.4794: (2008) |
38 | EE | Moni Naor, Gil Segev, Adam Smith: Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. IEEE Transactions on Information Theory 54(6): 2408-2425 (2008) |
37 | EE | Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, Adam Smith: Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data. SIAM J. Comput. 38(1): 97-139 (2008) |
2007 | ||
36 | EE | Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam Smith: Sublinear Algorithms for Approximating String Compressibility. APPROX-RANDOM 2007: 609-623 |
35 | EE | Sofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam Smith: Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem. FOCS 2007: 559-569 |
34 | EE | Adam Smith: Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes. SODA 2007: 395-404 |
33 | EE | Kobbi Nissim, Sofya Raskhodnikova, Adam Smith: Smooth sensitivity and sampling in private data analysis. STOC 2007: 75-84 |
32 | EE | Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam Smith: Sublinear Algorithms for Approximating String Compressibility CoRR abs/0706.1084: (2007) |
2006 | ||
31 | EE | Moni Naor, Gil Segev, Adam Smith: Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. CRYPTO 2006: 214-231 |
30 | EE | Yevgeniy Dodis, Jonathan Katz, Leonid Reyzin, Adam Smith: Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets. CRYPTO 2006: 232-250 |
29 | EE | Michael Ben-Or, Claude Crépeau, Daniel Gottesman, Avinatan Hassidim, Adam Smith: Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority. FOCS 2006: 249-260 |
28 | EE | Cynthia Dwork, Frank McSherry, Kobbi Nissim, Adam Smith: Calibrating Noise to Sensitivity in Private Data Analysis. TCC 2006: 265-284 |
27 | EE | Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, Adam Smith: Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data CoRR abs/cs/0602007: (2006) |
26 | EE | Sofya Raskhodnikova, Adam Smith: A Note on Adaptivity in Testing Properties of Bounded Degree Graphs. Electronic Colloquium on Computational Complexity (ECCC) 13(089): (2006) |
2005 | ||
25 | EE | Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafail Ostrovsky, Adam Smith: Secure Remote Authentication Using Biometric Data. EUROCRYPT 2005: 147-163 |
24 | EE | Claude Crépeau, Daniel Gottesman, Adam Smith: Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes. EUROCRYPT 2005: 285-301 |
23 | EE | Yevgeniy Dodis, Adam Smith: Correcting errors without leaking partial information. STOC 2005: 654-663 |
22 | EE | Shuchi Chawla, Cynthia Dwork, Frank McSherry, Adam Smith, Hoeteck Wee: Toward Privacy in Public Databases. TCC 2005: 363-385 |
21 | EE | Yevgeniy Dodis, Adam Smith: Entropic Security and the Encryption of High Entropy Messages. TCC 2005: 556-577 |
20 | EE | Claude Crépeau, Daniel Gottesman, Adam Smith: Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes CoRR abs/quant-ph/0503139: (2005) |
19 | EE | Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Amir Shpilka, Adam Smith: Sublinear Algorithms for Approximating String Compressibility and the Distribution Support Size Electronic Colloquium on Computational Complexity (ECCC)(125): (2005) |
2004 | ||
18 | EE | Andris Ambainis, Adam Smith: Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption. APPROX-RANDOM 2004: 249-260 |
17 | EE | Yevgeniy Dodis, Leonid Reyzin, Adam Smith: Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data. EUROCRYPT 2004: 523-540 |
16 | EE | Rafail Ostrovsky, Charles Rackoff, Adam Smith: Efficient Consistency Proofs for Generalized Queries on a Committed Database. ICALP 2004: 1041-1053 |
15 | Adam Smith, Hari Balakrishnan, Michel Goraczko, Nissanka B. Priyantha: Tracking Moving Devices with the Cricket Location System. MobiSys 2004 | |
14 | EE | Cynthia Dwork, Ronen Shaltiel, Adam Smith, Luca Trevisan: List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument. TCC 2004: 101-120 |
2003 | ||
13 | EE | Jonathan Katz, Rafail Ostrovsky, Adam Smith: Round Efficiency of Multi-party Computation with a Dishonest Majority. EUROCRYPT 2003: 578-595 |
12 | EE | Chris Peikert, Abhi Shelat, Adam Smith: Lower bounds for collusion-secure fingerprinting. SODA 2003: 472-479 |
2002 | ||
11 | EE | Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam Smith, Alain Tapp: Authentication of Quantum Messages. FOCS 2002: 449-458 |
10 | EE | Andris Ambainis, Adam Smith, Ke Yang: Extracting Quantum Entanglement. IEEE Conference on Computational Complexity 2002: 103-112 |
9 | EE | Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, Adam Smith: Detectable byzantine agreement secure against faulty majorities. PODC 2002: 118-126 |
8 | EE | Claude Crépeau, Daniel Gottesman, Adam Smith: Secure multi-party quantum computation. STOC 2002: 643-652 |
7 | EE | Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam Smith, Alain Tapp: Authentication of Quantum Messages CoRR quant-ph/0205128: (2002) |
2001 | ||
6 | EE | Moses Liskov, Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Adam Smith: Mutually Independent Commitments. ASIACRYPT 2001: 385-401 |
5 | EE | Yevgeniy Dodis, Amit Sahai, Adam Smith: On Perfect and Adaptive Security in Exposure-Resilient Cryptography. EUROCRYPT 2001: 301-324 |
4 | EE | Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam Smith: Efficient and Non-interactive Non-malleable Commitment. EUROCRYPT 2001: 40-59 |
2000 | ||
3 | Adam Smith, Subhash Suri: Rectangular Tiling in Multidimensional Arrays. J. Algorithms 37(2): 451-467 (2000) | |
1999 | ||
2 | EE | Adam Smith, Subhash Suri: Rectangular Tiling in Multi-dimensional Arrays. SODA 1999: 786-794 |
1 | EE | Adam Smith, Anton Stiglic: Multiparty computation unconditionally secure against Q^2 adversary structures CoRR cs.CR/9902010: (1999) |