The SCEAS System
| |||||||

## Search the dblp DataBase
Adam Smith:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Andris Ambainis, Adam Smith
**Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2004, pp:249-260 [Conf] - Moses Liskov, Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Adam Smith
**Mutually Independent Commitments.**[Citation Graph (0, 0)][DBLP] ASIACRYPT, 2001, pp:385-401 [Conf] - Andris Ambainis, Adam Smith, Ke Yang
**Extracting Quantum Entanglement.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:103-112 [Conf] - Moni Naor, Gil Segev, Adam Smith
**Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2006, pp:214-231 [Conf] - Yevgeniy Dodis, Jonathan Katz, Leonid Reyzin, Adam Smith
**Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2006, pp:232-250 [Conf] - Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafail Ostrovsky, Adam Smith
**Secure Remote Authentication Using Biometric Data.**[Citation Graph (0, 0)][DBLP] EUROCRYPT, 2005, pp:147-163 [Conf] - Claude Crépeau, Daniel Gottesman, Adam Smith
**Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes.**[Citation Graph (0, 0)][DBLP] EUROCRYPT, 2005, pp:285-301 [Conf] - Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam Smith
**Efficient and Non-interactive Non-malleable Commitment.**[Citation Graph (0, 0)][DBLP] EUROCRYPT, 2001, pp:40-59 [Conf] - Yevgeniy Dodis, Leonid Reyzin, Adam Smith
**Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data.**[Citation Graph (0, 0)][DBLP] EUROCRYPT, 2004, pp:523-540 [Conf] - Yevgeniy Dodis, Amit Sahai, Adam Smith
**On Perfect and Adaptive Security in Exposure-Resilient Cryptography.**[Citation Graph (0, 0)][DBLP] EUROCRYPT, 2001, pp:301-324 [Conf] - Jonathan Katz, Rafail Ostrovsky, Adam Smith
**Round Efficiency of Multi-party Computation with a Dishonest Majority.**[Citation Graph (0, 0)][DBLP] EUROCRYPT, 2003, pp:578-595 [Conf] - Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam Smith, Alain Tapp
**Authentication of Quantum Messages.**[Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:449-458 [Conf] - Michael Ben-Or, Claude Crépeau, Daniel Gottesman, Avinatan Hassidim, Adam Smith
**Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority.**[Citation Graph (0, 0)][DBLP] FOCS, 2006, pp:249-260 [Conf] - Rafail Ostrovsky, Charles Rackoff, Adam Smith
**Efficient Consistency Proofs for Generalized Queries on a Committed Database.**[Citation Graph (0, 0)][DBLP] ICALP, 2004, pp:1041-1053 [Conf] - Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, Adam Smith
**Detectable byzantine agreement secure against faulty majorities.**[Citation Graph (0, 0)][DBLP] PODC, 2002, pp:118-126 [Conf] - Chris Peikert, Abhi Shelat, Adam Smith
**Lower bounds for collusion-secure fingerprinting.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:472-479 [Conf] - Claude Crépeau, Daniel Gottesman, Adam Smith
**Secure multi-party quantum computation.**[Citation Graph (0, 0)][DBLP] STOC, 2002, pp:643-652 [Conf] - Yevgeniy Dodis, Adam Smith
**Correcting errors without leaking partial information.**[Citation Graph (0, 0)][DBLP] STOC, 2005, pp:654-663 [Conf] - Shuchi Chawla, Cynthia Dwork, Frank McSherry, Adam Smith, Hoeteck Wee
**Toward Privacy in Public Databases.**[Citation Graph (0, 0)][DBLP] TCC, 2005, pp:363-385 [Conf] - Yevgeniy Dodis, Adam Smith
**Entropic Security and the Encryption of High Entropy Messages.**[Citation Graph (0, 0)][DBLP] TCC, 2005, pp:556-577 [Conf] - Cynthia Dwork, Frank McSherry, Kobbi Nissim, Adam Smith
**Calibrating Noise to Sensitivity in Private Data Analysis.**[Citation Graph (0, 0)][DBLP] TCC, 2006, pp:265-284 [Conf] - Cynthia Dwork, Ronen Shaltiel, Adam Smith, Luca Trevisan
**List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument.**[Citation Graph (0, 0)][DBLP] TCC, 2004, pp:101-120 [Conf] - Adam Smith, Anton Stiglic
**Multiparty computation unconditionally secure against Q^2 adversary structures**[Citation Graph (0, 0)][DBLP] CoRR, 1999, v:0, n:, pp:- [Journal] - Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam Smith, Alain Tapp
**Authentication of Quantum Messages**[Citation Graph (0, 0)][DBLP] CoRR, 2002, v:0, n:, pp:- [Journal] - Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Amir Shpilka, Adam Smith
**Sublinear Algorithms for Approximating String Compressibility and the Distribution Support Size**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:125, pp:- [Journal] - Adam Smith, Subhash Suri
**Rectangular Tiling in Multidimensional Arrays.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2000, v:37, n:2, pp:451-467 [Journal] - Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam Smith
**Sublinear Algorithms for Approximating String Compressibility.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2007, pp:609-623 [Conf] - Adam Smith
**Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes.**[Citation Graph (0, 0)][DBLP] SODA, 2007, pp:395-404 [Conf] - Kobbi Nissim, Sofya Raskhodnikova, Adam Smith
**Smooth sensitivity and sampling in private data analysis.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:75-84 [Conf] - Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam Smith
**Sublinear Algorithms for Approximating String Compressibility**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] - Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, Adam Smith
**Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Claude Crépeau, Daniel Gottesman, Adam Smith
**Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes**[Citation Graph (0, 0)][DBLP] CoRR, 2005, v:0, n:, pp:- [Journal] **Defending Against Attacks on Main Memory Persistence.**[Citation Graph (, )][DBLP]**Asymptotically Optimal and Private Statistical Estimation.**[Citation Graph (, )][DBLP]**Scalable Multiparty Computation with Nearly Optimal Work and Resilience.**[Citation Graph (, )][DBLP]**Instantiability of RSA-OAEP under Chosen-Plaintext Attack.**[Citation Graph (, )][DBLP]**Efficient Two Party and Multi Party Computation Against Covert Adversaries.**[Citation Graph (, )][DBLP]**Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem.**[Citation Graph (, )][DBLP]**What Can We Learn Privately?**[Citation Graph (, )][DBLP]**Composition attacks and auxiliary information in data privacy.**[Citation Graph (, )][DBLP]**Discovering frequent patterns in sensitive data.**[Citation Graph (, )][DBLP]**The price of privately releasing contingency tables and the spectra of random matrices with correlated rows.**[Citation Graph (, )][DBLP]**Composability and On-Line Deniability of Authentication.**[Citation Graph (, )][DBLP]**What Can Cryptography Do for Coding Theory?**[Citation Graph (, )][DBLP]**Composition Attacks and Auxiliary Information in Data Privacy**[Citation Graph (, )][DBLP]**What Can We Learn Privately?**[Citation Graph (, )][DBLP]**A Note on Differential Privacy: Defining Resistance to Arbitrary Side Information**[Citation Graph (, )][DBLP]**Efficient, Differentially Private Point Estimators**[Citation Graph (, )][DBLP]**Explicit Capacity-achieving Codes for Worst-Case Additive Errors**[Citation Graph (, )][DBLP]**Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate**[Citation Graph (, )][DBLP]**A Note on Adaptivity in Testing Properties of Bounded Degree Graphs.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |