Adam Smith

Citeras av

	Alla	Sedan 2015
Citat	16653	10736
h-index	51	42
i10-index	91	80

2500

1250

625

1875

2004200520062007200820092010201120122013201420152016201720182019202065 151 206 261 392 438 613 614 869 1011 1089 1202 1473 1752 1799 2409 2099

Medförfattare

Yevgeniy DodisProfessor, New York UniversityVerifierad e-postadress på cs.nyu.edu
Leonid ReyzinAssociate Professor of Computer Science, Boston UniversityVerifierad e-postadress på cs.bu.edu
Kobbi NissimDept. of Computer Science (Georgetown) & Center for Research on Computation and Society (Harvard)Verifierad e-postadress på georgetown.edu
Cynthia DworkMicrosoft ResearchVerifierad e-postadress på microsoft.com
Sofya RaskhodnikovaBoston UniversityVerifierad e-postadress på bu.edu
Rafail OstrovskyProfessor of Computer Science and Professor of Mathematics, UCLAVerifierad e-postadress på cs.ucla.edu
Jonathan KatzProfessor of Computer Science, University of MarylandVerifierad e-postadress på cs.umd.edu
Frank McSherryMaterialize, Inc.Verifierad e-postadress på materialize.io
Shiva KasiviswanathanAmazon Machine LearningVerifierad e-postadress på amazon.com
Jonathan UllmanAssistant Professor of Computer Science, Northeastern UniversityVerifierad e-postadress på ccs.neu.edu
Abhradeep Guha ThakurtaAssistant Professor, University of California Santa CruzVerifierad e-postadress på ucsc.edu
Raef BassilyAssistant Professor, Computer Science & Engineering, The Ohio State UniversityVerifierad e-postadress på osu.edu
Daniel GottesmanPerimeter Institute for Theoretical PhysicsVerifierad e-postadress på perimeterinstitute.ca
Claude CrépeauMcGill UniversityVerifierad e-postadress på cs.mcgill.ca
Thomas SteinkeGoogle Research, Brain TeamVerifierad e-postadress på google.com
Homin K. LeeDatadogVerifierad e-postadress på columbia.edu
Dana RonTel Aviv UniversityVerifierad e-postadress på tau.ac.il
Chris PeikertAssociate Professor, Computer Science and Engineering, University of MichiganVerifierad e-postadress på alum.mit.edu
Shuchi ChawlaUniversity of Wisconsin - MadisonVerifierad e-postadress på cs.wisc.edu
Benjamin FullerUniversity of ConnecticutVerifierad e-postadress på uconn.edu

Adam Smith

Professor of Computer Science, Boston University

Verifierad e-postadress på bu.edu - Startsida

Data privacy cryptography machine learning algorithms information theory


Titel Sortera efter citat Sortera efter år Sortera efter titel	Citeras av Citeras av	År
Calibrating noise to sensitivity in private data analysis C Dwork, F McSherry, K Nissim, A Smith Theory of cryptography conference, 265-284, 2006	4246	2006
Fuzzy extractors: How to generate strong keys from biometrics and other noisy data Y Dodis, L Reyzin, A Smith International conference on the theory and applications of cryptographic …, 2004	3162*	2004
Smooth sensitivity and sampling in private data analysis K Nissim, S Raskhodnikova, A Smith Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007	813	2007
What can we learn privately? SP Kasiviswanathan, HK Lee, K Nissim, S Raskhodnikova, A Smith Foundations of Computer Science, 2008. FOCS'08. IEEE 49th Annual IEEE …, 2008	613	2008
Composition attacks and auxiliary information in data privacy SR Ganta, SP Kasiviswanathan, A Smith Proceeding of the 14th ACM SIGKDD international conference on Knowledge …, 2008	370	2008
Private empirical risk minimization: Efficient algorithms and tight error bounds R Bassily, A Smith, A Thakurta 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 464-473, 2014	338	2014
Toward privacy in public databases S Chawla, C Dwork, F McSherry, A Smith, H Wee Theory of Cryptography Conference, 363-385, 2005	318	2005
Secure remote authentication using biometric data X Boyen, Y Dodis, J Katz, R Ostrovsky, A Smith annual international conference on the theory and applications of …, 2005	284	2005
Authentication of quantum messages H Barnum, C Crépeau, D Gottesman, A Smith, A Tapp The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002 …, 2002	280	2002
Robust fuzzy extractors and authenticated key agreement from close secrets Y Dodis, J Katz, L Reyzin, A Smith Advances in Cryptology-CRYPTO 2006, 232-250, 2006	254*	2006
Discovering frequent patterns in sensitive data R Bhaskar, S Laxman, A Smith, A Thakurta Proceedings of the 16th ACM SIGKDD international conference on Knowledge …, 2010	240	2010
Differential privacy for statistics: What we know and what we want to learn C Dwork, A Smith Journal of Privacy and Confidentiality 1 (2), 2010	240	2010
Local, private, efficient protocols for succinct histograms R Bassily, A Smith Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015	235	2015
Private convex empirical risk minimization and high-dimensional regression D Kifer, A Smith, A Thakurta Conference on Learning Theory, 25.1-25.40, 2012	233	2012
Correcting errors without leaking partial information Y Dodis, A Smith Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005	196	2005
Privacy-preserving statistical estimation with optimal convergence rates A Smith Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011	195	2011
Analyzing graphs with node differential privacy SP Kasiviswanathan, K Nissim, S Raskhodnikova, A Smith Theory of Cryptography Conference, 457-476, 2013	194	2013
Leftover hashing against quantum side information M Tomamichel, C Schaffner, A Smith, R Renner IEEE Transactions on Information Theory 57 (8), 5524-5535, 2011	192	2011
Private analysis of graph structure V Karwa, S Raskhodnikova, A Smith, G Yaroslavtsev Proceedings of the VLDB Endowment 4 (11), 1146-1157, 2011	179	2011
On the Semantics' of Differential Privacy: A Bayesian Formulation SP Kasiviswanathan, A Smith arXiv preprint arXiv:0803.3946, 2008	169*	2008

Systemet kan inte utföra åtgärden just nu. Försök igen senare.

Artiklar 1–20

Citat per år

Dubblettcitat

Sammanfogade citat

Lägg till medförfattareMedförfattare

Ladda upp PDF

Följ den här författaren

Citeras av

Medförfattare