Mohammad Mahmoody has helped prove the impossibility of cryptography using tamperable randomness and the lower bounds on the computational assumptions behind code obfuscation, along with other findings. Current research includes investigating the computational complexity of NP-hard security, cryptographic efficiency, and the power of computational assumptions in cryptography.