"I am interested in theoretical computer science. In particular, I am interested in foundations of cryptography and its interplay with computational complexity. I am also interested in adversarial machine learning from a formal perspective. In both of these areas, I am particularly interested in understanding inherent barriers (aka "lower bounds", "impossibility results", or "separations") that might exist against using computational intractability assumptions."
Mohammad Mahmoody, Associate Professor
Research interests include: Cryptography, Adversarial Learning, Computational Complexity
Bio: Mahmoody started his undergraduate studies in Sharif University's Computer Engineering Department in 2000. He started his PhD in Princeton in 2005 and in 2010 joined Cornell as a postdoctoral associate. In 2013 he joined University of Virginia as an assistant professor. In 2014 he received NSF Career Award to work on "Separations in Cryptograhy". In 2019 he became an associate professor of Computer Science.
Awards
NSF CAREER2014
Wu Prize for Excellence2009
Research Interests
Cryptography
Adversarial Learning
Computational Complexity
Selected Publications
Learning and Certification under Instance-targeted Poisoning, UAI 2021 Ji Gao, Amin Karbasi, Mohammad Mahmoody
Is Private Learning Possible with Instance Encoding?, IEEE Symposium on Security and Privacy (Oakland) 2021 Nicholas Carlini, Samuel Deng, Sanjam Garg, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Abhradeep Thakurta, Florian Tramer
The curse of concentration in robust learning: Evasion and poisoning attacks from concentration of measure, AAAI 2019 Dimitrios I Diochnos, Saeed Mahloujifar, Mohammad Mahmoody
Merkle's Key Agreement Protocol is Optimal: An O(n^2)-Query Attack on Any Key Exchange from a Random Oracle, Journal of Cryptology, 2017 Sanjam Garg, Mohammad Mahmoody, Ameer Mohammed
Lower Bounds on Obfuscation from All-or-Nothing Encryption Primitives, CRYPTO 2017 Sanjam Garg, Mohammad Mahmoody, Ameer Mohammed
On the Impossibility of Cryptography with Tamperable Randomness, Algorithmica 2017 Mohammad Mahmoody, Per Austrin, Kai-Min Chung, Rafael Pass, and Karn Seth.
Publicly Verifiable Proofs of Sequential Work, ITCS 2013 Mohammad Mahmoody, Tal Moran, Salil Vadhan
Courses Taught
Computational Complexity (Undergrad)Spring 2014
Cryptography (Grad)Fall 2014
Topics in Cryptography [Seminar] (Grad and Undergrad)Spring 2015
Algortihms (Grad)Fall 2015
Foundations of Cryptography (Undergrad)Fall 2016
Theory of Computation (Grad)Spring 2017
Discrete Mathematics (Undergrad)Fall 2017
Topics in Cryptography (Grad and Undergrad)Spring 2018
