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