The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of Adam Smith Adam D. Smith ( http://dblp.L3S.de/Authors/Adam_Smith )

URL (Homepage):  http://www.cse.psu.edu/~asmith  Author page on DBLP  Author page in RDF  Community of Adam Smith in ASPL-2

Publication years (Num. hits)
1999-2003 (15) 2004-2006 (22) 2007-2008 (17) 2009-2011 (20)
Publication types (Num. hits)
article(33) inproceedings(41)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 30 occurrences of 27 keywords

Results
Found 74 publication records. Showing 74 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Eike Kiltz, Adam O'Neill, Adam Smith Instantiability of RSA-OAEP under Chosen-Plaintext Attack. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2011 DBLP  BibTeX  RDF
1Vishesh Karwa, Sofya Raskhodnikova, Adam Smith, Grigory Yaroslavtsev Private Analysis of Graph Structure. Search on Bibsonomy PVLDB The full citation details ... 2011 DBLP  BibTeX  RDF
1Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith What Can We Learn Privately? Search on Bibsonomy SIAM J. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Marco Tomamichel, Christian Schaffner, Adam Smith, Renato Renner Leftover Hashing Against Quantum Side Information. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Sean Hallgren, Adam Smith, Fang Song Classical Cryptographic Protocols in a Quantum World. Search on Bibsonomy CRYPTO The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Adam Smith Privacy-preserving statistical estimation with optimal convergence rates. Search on Bibsonomy STOC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Venkatesan Guruswami, Adam Smith Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Yevgeniy Dodis, Bhavana Kanukurthi, Jonathan Katz, Leonid Reyzin, Adam Smith Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2010 DBLP  BibTeX  RDF
1Jonathan Katz, Ji Sun Shin, Adam Smith Parallel and Concurrent Security of the HB and HB+ Protocols. Search on Bibsonomy J. Cryptology The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Venkatesan Guruswami, Adam Smith Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Marco Tomamichel, Renato Renner, Christian Schaffner, Adam Smith Leftover Hashing against quantum side information. Search on Bibsonomy ISIT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Eike Kiltz, Adam O'Neill, Adam Smith Instantiability of RSA-OAEP under Chosen-Plaintext Attack. Search on Bibsonomy CRYPTO The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Venkatesan Guruswami, Adam Smith Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate. Search on Bibsonomy FOCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Shiva Prasad Kasiviswanathan, Mark Rudelson, Adam Smith, Jonathan Ullman The price of privately releasing contingency tables and the spectra of random matrices with correlated rows. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF reconstruction attacks, data privacy, differential privacy, random matrices
1Raghav Bhaskar, Srivatsan Laxman, Adam Smith, Abhradeep Thakurta Discovering frequent patterns in sensitive data. Search on Bibsonomy KDD The full citation details ... 2010 DBLP  DOI  BibTeX  RDF exponential mechanism, privacy, frequent itemsets, frequent patterns, differential privacy
1Venkatesan Guruswami, Adam Smith Explicit Capacity-achieving Codes for Worst-Case Additive Errors Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Sofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam Smith Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Adam Smith What Can Cryptography Do for Coding Theory? Search on Bibsonomy ICITS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Adam Smith Asymptotically Optimal and Private Statistical Estimation. Search on Bibsonomy CANS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Yevgeniy Dodis, Jonathan Katz, Adam Smith, Shabsi Walfish Composability and On-Line Deniability of Authentication. Search on Bibsonomy TCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Shiva Prasad Kasiviswanathan, Adam Smith A Note on Differential Privacy: Defining Resistance to Arbitrary Side Information. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2008 DBLP  BibTeX  RDF
1Shiva Prasad Kasiviswanathan, Adam Smith A Note on Differential Privacy: Defining Resistance to Arbitrary Side Information Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Srivatsava Ranjit Ganta, Shiva Prasad Kasiviswanathan, Adam Smith Composition Attacks and Auxiliary Information in Data Privacy Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith What Can We Learn Privately? Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Adam Smith Efficient, Differentially Private Point Estimators Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, Adam Smith Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Moni Naor, Gil Segev, Adam Smith Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1William Enck, Kevin R. B. Butler, Thomas Richardson, Patrick Drew McDaniel, Adam Smith Defending Against Attacks on Main Memory Persistence. Search on Bibsonomy ACSAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Vipul Goyal, Payman Mohassel, Adam Smith Efficient Two Party and Multi Party Computation Against Covert Adversaries. Search on Bibsonomy EUROCRYPT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Ivan Damgård, Yuval Ishai, Mikkel Krøigaard, Jesper Buus Nielsen, Adam Smith Scalable Multiparty Computation with Nearly Optimal Work and Resilience. Search on Bibsonomy CRYPTO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith What Can We Learn Privately? Search on Bibsonomy FOCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Srivatsava Ranjit Ganta, Shiva Prasad Kasiviswanathan, Adam Smith Composition attacks and auxiliary information in data privacy. Search on Bibsonomy KDD The full citation details ... 2008 DBLP  DOI  BibTeX  RDF adversarial attacks, privacy, anonymization
1Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam Smith Sublinear Algorithms for Approximating String Compressibility Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1Adam Smith Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes. Search on Bibsonomy SODA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam Smith Sublinear Algorithms for Approximating String Compressibility. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Sofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam Smith Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem. Search on Bibsonomy FOCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Kobbi Nissim, Sofya Raskhodnikova, Adam Smith Smooth sensitivity and sampling in private data analysis. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF output perturbation, clustering, sensitivity, privacy preserving data mining, private data analysis
1Sofya Raskhodnikova, Adam Smith A Note on Adaptivity in Testing Properties of Bounded Degree Graphs. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2006 DBLP  BibTeX  RDF
1Moni Naor, Gil Segev, Adam Smith Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2006 DBLP  BibTeX  RDF
1Adam Smith Scrambling Adversarial Errors Using Few Random Bits, Optimal Information Reconciliation, and Better Private Codes. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2006 DBLP  BibTeX  RDF
1Jonathan Katz, Adam Smith Analyzing the HB and HB+ Protocols in the "Large Error" Case. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2006 DBLP  BibTeX  RDF
1Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, Adam Smith Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
1Cynthia Dwork, Frank McSherry, Kobbi Nissim, Adam Smith Calibrating Noise to Sensitivity in Private Data Analysis. Search on Bibsonomy TCC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Moni Naor, Gil Segev, Adam Smith Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. Search on Bibsonomy CRYPTO The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Yevgeniy Dodis, Jonathan Katz, Leonid Reyzin, Adam Smith Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets. Search on Bibsonomy CRYPTO The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Michael Ben-Or, Claude Crépeau, Daniel Gottesman, Avinatan Hassidim, Adam Smith Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority. Search on Bibsonomy FOCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Amir Shpilka, Adam Smith Sublinear Algorithms for Approximating String Compressibility and the Distribution Support Size Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2005 DBLP  BibTeX  RDF
1Claude Crépeau, Daniel Gottesman, Adam Smith Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
1Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafail Ostrovsky, Adam Smith Secure Remote Authentication Using Biometric Data. Search on Bibsonomy EUROCRYPT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Claude Crépeau, Daniel Gottesman, Adam Smith Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes. Search on Bibsonomy EUROCRYPT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Yevgeniy Dodis, Adam Smith Entropic Security and the Encryption of High Entropy Messages. Search on Bibsonomy TCC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Shuchi Chawla, Cynthia Dwork, Frank McSherry, Adam Smith, Hoeteck Wee Toward Privacy in Public Databases. Search on Bibsonomy TCC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Yevgeniy Dodis, Adam Smith Correcting errors without leaking partial information. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF entropic security, cryptography, error-correcting codes, randomness extractors, code obfuscation, bounded storage model, information reconciliation
1Yevgeniy Dodis, Adam Smith Entropic Security and the Encryption of High Entropy Messages. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2004 DBLP  BibTeX  RDF
1Rafail Ostrovsky, Charles Rackoff, Adam Smith Efficient Consistency Proofs for Generalized Queries on a Committed Database. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2004 DBLP  BibTeX  RDF
1Rafail Ostrovsky, Charles Rackoff, Adam Smith Efficient Consistency Proofs for Generalized Queries on a Committed Database. Search on Bibsonomy ICALP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Yevgeniy Dodis, Leonid Reyzin, Adam Smith Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data. Search on Bibsonomy EUROCRYPT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Cynthia Dwork, Ronen Shaltiel, Adam Smith, Luca Trevisan List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument. Search on Bibsonomy TCC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Andris Ambainis, Adam Smith Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, Adam Smith Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2003 DBLP  BibTeX  RDF
1Chris Peikert, Abhi Shelat, Adam Smith Lower bounds for collusion-secure fingerprinting. Search on Bibsonomy SODA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Jonathan Katz, Rafail Ostrovsky, Adam Smith Round Efficiency of Multi-party Computation with a Dishonest Majority. Search on Bibsonomy EUROCRYPT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam Smith, Alain Tapp Authentication of Quantum Messages. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2002 DBLP  BibTeX  RDF
1Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam Smith, Alain Tapp Authentication of Quantum Messages Search on Bibsonomy CoRR The full citation details ... 2002 DBLP  BibTeX  RDF
1Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, Adam Smith Detectable byzantine agreement secure against faulty majorities. Search on Bibsonomy PODC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF quantum signatures, broadcast, public-key infrastructure, byzantine agreement, multi-party computation
1Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam Smith, Alain Tapp Authentication of Quantum Messages. Search on Bibsonomy FOCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Authentication, quantum information
1Andris Ambainis, Adam Smith, Ke Yang Extracting Quantum Entanglement. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Entanglement Purification, General Error Models, Purity-Testing, Quantum Cryptography
1Claude Crépeau, Daniel Gottesman, Adam Smith Secure multi-party quantum computation. Search on Bibsonomy STOC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF distributed computing, quantum cryptography, secure function evaluation, multi-party protocols
1Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam Smith Efficient and Non-Interactive Non-Malleable Commitment. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2001 DBLP  BibTeX  RDF
1Moses Liskov, Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Adam Smith Mutually Independent Commitments. Search on Bibsonomy ASIACRYPT The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam Smith Efficient and Non-interactive Non-malleable Commitment. Search on Bibsonomy EUROCRYPT The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Yevgeniy Dodis, Amit Sahai, Adam Smith On Perfect and Adaptive Security in Exposure-Resilient Cryptography. Search on Bibsonomy EUROCRYPT The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Suzanne Cohen, John Fereira, Angela Horne, Bob Kibbee, Holly Mistlebauer, Adam Smith MyLibrary: Personalized Electronic Services in the Cornell University Library. Search on Bibsonomy D-Lib Magazine The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Adam Smith, Anton Stiglic Multiparty computation unconditionally secure against Q^2 adversary structures Search on Bibsonomy CoRR The full citation details ... 1999 DBLP  BibTeX  RDF
Displaying result #1 - #74 of 74 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.