Mohammad Mahmoody

Geciteerd door

	Alles	Sinds 2015
Citaties	954	733
h-index	17	16
i10-index	34	28

200

100

150

20082009201020112012201320142015201620172018201920204 6 14 34 52 44 55 44 94 85 151 168 190

Medeauteurs

Saeed MahloujifarPrinceton UniversityGeverifieerd e-mailadres voor princeton.edu
Sanjam GargUniversity of California, BerkeleyGeverifieerd e-mailadres voor berkeley.edu
Dimitris DiochnosUniversity of Oklahoma, School of Computer ScienceGeverifieerd e-mailadres voor math.uic.edu
Boaz BarakHarvard UniversityGeverifieerd e-mailadres voor boazbarak.org
Tal MoranIDC HerzliyaGeverifieerd e-mailadres voor idc.ac.il
Salil VadhanVicky Joseph Professor of Computer Science and Applied Mathematics, Harvard UniversityGeverifieerd e-mailadres voor g.harvard.edu
Kai-Min ChungInstitute of Information Science, Academia SinicaGeverifieerd e-mailadres voor iis.sinica.edu.tw
Soheil NematihajiGraduate student, University of VirginiaGeverifieerd e-mailadres voor virginia.edu
Amit SahaiSymantec Chair Professor of Computer Science, UCLA; Director of Center for Encrypted FunctionalitiesGeverifieerd e-mailadres voor cs.ucla.edu
Yuval IshaiGeverifieerd e-mailadres voor cs.technion.ac.il
Manoj PrabhakaranComputer Science and Engineering, IIT BombayGeverifieerd e-mailadres voor cse.iitb.ac.in
Hemanta K. MajiDepartment of Computer Science, Purdue UniversityGeverifieerd e-mailadres voor purdue.edu
Omid EtesamiResearcher, Institute for Research in Fundamental Sciences (IPM)Geverifieerd e-mailadres voor ipm.ir
Vipul GoyalCarnegie Mellon UniversityGeverifieerd e-mailadres voor cs.cmu.edu
Per AustrinAssociate Professor in Computer Science, KTH Royal Institute of TechnologyGeverifieerd e-mailadres voor kth.se
Karn SethGoogle LLCGeverifieerd e-mailadres voor google.com
Tal MalkinAssociate Professor of Computer Science, Columbia UniversityGeverifieerd e-mailadres voor columbia.edu
Dana Dachman-SoledAssociate Professor, Department of Electrical and Computer Engineering, University of MarylandGeverifieerd e-mailadres voor umd.edu
Hamid MahiniUniversity of MarylandGeverifieerd e-mailadres voor cs.umd.edu
Saieed AkbariProfessor of Mathematics, Sharif University of TechnologyGeverifieerd e-mailadres voor sharif.edu

Mohammad Mahmoody

Associate Professor, University of Virginia

Geverifieerd e-mailadres voor virginia.edu - Homepage

Foundations of Cryptography Computational Complexity Adversarially Robust Learning


Titel Sorteren op citaties Sorteren op jaar Sorteren op titel	Geciteerd door Geciteerd door	Jaar
Merkle puzzles are optimal—an O(n^2)-query attack on any key exchange from a random oracle B Barak, M Mahmoody-Ghidary Advances in Cryptology-CRYPTO 2009, 374-390, 2009	74	2009
Interactive locking, zero-knowledge PCPs, and unconditional cryptography V Goyal, Y Ishai, M Mahmoody, A Sahai Annual Cryptology Conference, 173-190, 2010	65	2010
Publicly verifiable proofs of sequential work M Mahmoody, T Moran, S Vadhan Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013	62	2013
Time-lock puzzles in the random oracle model M Mahmoody, T Moran, S Vadhan Annual Cryptology Conference, 39-50, 2011	61	2011
The curse of concentration in robust learning: Evasion and poisoning attacks from concentration of measure S Mahloujifar, DI Diochnos, M Mahmoody Proceedings of the AAAI Conference on Artificial Intelligence 33, 4536-4543, 2019	60	2019
Lower bounds on signatures from symmetric primitives B Barak, M Mahmoody-Ghidary 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 680-688, 2007	48	2007
On the black-box complexity of optimally-fair coin tossing D Dachman-Soled, Y Lindell, M Mahmoody, T Malkin Theory of Cryptography Conference, 450-467, 2011	47	2011
On the impossibility of cryptography with tamperable randomness P Austrin, KM Chung, M Mahmoody, R Pass, K Seth Annual Cryptology Conference, 462-479, 2014	37	2014
The curious case of non-interactive commitments–on the power of black-box vs. non-black-box use of primitives M Mahmoody, R Pass Annual Cryptology Conference, 701-718, 2012	28	2012
On the power of randomized reductions and the checkability of SAT M Mahmoody, D Xiao 2010 IEEE 25th Annual Conference on Computational Complexity, 64-75, 2010	27	2010
Adversarial risk and robustness: General definitions and implications for the uniform distribution D Diochnos, S Mahloujifar, M Mahmoody Advances in Neural Information Processing Systems, 10359-10368, 2018	22	2018
Can optimally-fair coin tossing be based on one-way functions? D Dachman-Soled, M Mahmoody, T Malkin Theory of Cryptography Conference, 217-239, 2014	22	2014
On efficient zero-knowledge PCPs Y Ishai, M Mahmoody, A Sahai Theory of Cryptography Conference, 151-168, 2012	22	2012
Can Adversarially Robust Learning LeverageComputational Hardness? S Mahloujifar, M Mahmoody Algorithmic Learning Theory, 581-609, 2019	19	2019
A new sampling protocol and applications to basing cryptographic primitives on the hardness of NP I Haitner, M Mahmoody, D Xiao 2010 IEEE 25th Annual Conference on Computational Complexity, 76-87, 2010	19	2010
On rainbow cycles in edge colored complete graphs S Akbari, O Etesami, H Mahini, M Mahmoody Australasian Journal of Combinatorics 37, 33, 2007	19	2007
On the power of nonuniformity in proofs of security KM Chung, H Lin, M Mahmoody, R Pass Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013	18	2013
Lower bounds on assumptions behind indistinguishability obfuscation M Mahmoody, A Mohammed, S Nematihaji, R Pass, A Shelat Theory of Cryptography Conference, 49-66, 2016	17	2016
Blockwise p-Tampering Attacks on Cryptographic Primitives, Extractors, and Learners S Mahloujifar, M Mahmoody Theory of Cryptography Conference, 245-279, 2017	16	2017
Learning under -Tampering Attacks S Mahloujifar, DI Diochnos, M Mahmoody Algorithmic Learning Theory, 572-596, 2018	15	2018

Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.

Artikelen 1–20

Citaties per jaar

Dubbele citaties

Samengevoegde citaties

Medeauteurs toevoegenMedeauteurs

PDF uploaden

Deze auteur volgen

Geciteerd door

Medeauteurs