Mohammad Mahmoody

Cited by

	All	Since 2019
Citations	2100	1510
h-index	25	20
i10-index	48	42

320

160

240

20102011201220132014201520162017201820192020202120222023202412 32 48 46 50 53 88 81 143 152 227 315 269 286 259

Public access

View all

33 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Saeed MahloujifarFAIR, MetaVerified email at meta.com
Sanjam GargUniversity of California, BerkeleyVerified email at berkeley.edu
Somesh JhaLubar Chair of Computer Science, University of WisconsinVerified email at cs.wisc.edu
Kai-Min ChungInstitute of Information Science, Academia SinicaVerified email at iis.sinica.edu.tw
Dimitris DiochnosUniversity of Oklahoma, School of Computer ScienceVerified email at math.uic.edu
Tal MoranIDC HerzliyaVerified email at idc.ac.il
Salil VadhanVicky Joseph Professor of Computer Science and Applied Mathematics, Harvard UniversityVerified email at g.harvard.edu
Mohammad HajiabadiAssistant Professor, David R. Cheriton School of Computer Science, University of WaterlooVerified email at uwaterloo.ca
Boaz BarakHarvard UniversityVerified email at boazbarak.org
Soheil NematihajiGraduate student, University of VirginiaVerified email at virginia.edu
Abhradeep Guha ThakurtaGoogle Research - Brain TeamVerified email at google.com
Ahmadreza RahimiMax Planck Institute for Security and PrivacyVerified email at mpi-sp.org
Amit SahaiSymantec Chair Professor of Computer Science; Professor of Mathematics (by courtesy), UCLAVerified email at cs.ucla.edu
Yuval IshaiTechnionVerified email at cs.technion.ac.il
Per AustrinAssociate Professor in Computer Science, KTH Royal Institute of TechnologyVerified email at kth.se
Omid EtesamiResearcher, Institute for Research in Fundamental Sciences (IPM)Verified email at ipm.ir
Karn SethGoogle LLCVerified email at google.com
Tal MalkinProfessor of Computer Science, Columbia UniversityVerified email at columbia.edu
Dana Dachman-SoledAssociate Professor, Department of Electrical and Computer Engineering, University of MarylandVerified email at umd.edu
Vipul GoyalNTT ResearchVerified email at vipulgoyal.org

Mohammad Mahmoody

Associate Professor, University of Virginia

Verified email at virginia.edu - Homepage

Foundations of Cryptography Computational Complexity Adversarially Robust Learning


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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 (01), 4536-4543, 2019	160	2019
Publicly verifiable proofs of sequential work M Mahmoody, T Moran, S Vadhan Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013	136	2013
Time-lock puzzles in the random oracle model M Mahmoody, T Moran, S Vadhan Advances in Cryptology–CRYPTO 2011: 31st Annual Cryptology Conference, Santa …, 2011	127	2011
Merkle puzzles are optimal—an -query attack on any key exchange from a random oracle B Barak, M Mahmoody Advances in Cryptology-CRYPTO 2009, 374-390, 2009	113	2009
Is private learning possible with instance encoding? N Carlini, S Deng, S Garg, S Jha, S Mahloujifar, M Mahmoody, A Thakurta, ... 2021 IEEE Symposium on Security and Privacy (SP), 410-427, 2021	90	2021
Universal Multi-Party Poisoning Attacks S Mahloujifar, M Mahmoody, A Mohammed International Conference on Machine Learning, 4274-4283, 2019	87*	2019
Adversarial risk and robustness: General definitions and implications for the uniform distribution D Diochnos, S Mahloujifar, M Mahmoody Advances in Neural Information Processing Systems 31, 2018	87	2018
Registration-based encryption: removing private-key generator from IBE S Garg, M Hajiabadi, M Mahmoody, A Rahimi Theory of Cryptography: 16th International Conference, TCC 2018, Panaji …, 2018	75	2018
Interactive locking, zero-knowledge PCPs, and unconditional cryptography V Goyal, Y Ishai, M Mahmoody, A Sahai Advances in Cryptology–CRYPTO 2010: 30th Annual Cryptology Conference, Santa …, 2010	73	2010
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	66	2011
Lower bounds on signatures from symmetric primitives B Barak, M Mahmoody 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 680-688, 2007	58	2007
On the impossibility of cryptography with tamperable randomness P Austrin, KM Chung, M Mahmoody, R Pass, K Seth Advances in Cryptology–CRYPTO 2014: 34th Annual Cryptology Conference, Santa …, 2014	55	2014
Registration-based encryption from standard assumptions S Garg, M Hajiabadi, M Mahmoody, A Rahimi, S Sekar IACR international workshop on public key cryptography, 63-93, 2019	53	2019
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	47	2012
Can Adversarially Robust Learning Leverage Computational Hardness? S Mahloujifar, M Mahmoody Algorithmic Learning Theory, 581-609, 2019	44	2019
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	36	2014
Learning under -Tampering Attacks S Mahloujifar, DI Diochnos, M Mahmoody Algorithmic Learning Theory, 572-596, 2018	34	2018
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	33	2013
On efficient zero-knowledge PCPs Y Ishai, M Mahmoody, A Sahai Theory of Cryptography: 9th Theory of Cryptography Conference, TCC 2012 …, 2012	32	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	32	2010

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors