| 2025 | ISAAC | New Algorithmic Directions in Optimal Transport and Applications for Product Spaces. | Salman Beigi, Omid Etesami, Mohammad Mahmoody, Amir Najafi |
| 2023 | ASIACRYPT | On the (Im)possibility of Time-Lock Puzzles in the Quantum Random Oracle Model. | Abtin Afshar, Kai-Min Chung, Yao-Ching Hsieh, Yao-Ting Lin, Mohammad Mahmoody |
| 2023 | CCS | Experimenting with Zero-Knowledge Proofs of Training. | Sanjam Garg, Aarushi Goel, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Guru-Vamsi Policharla, Mingyuan Wang |
| 2023 | EuroCrypt | Fine-Grained Non-interactive Key-Exchange: Constructions and Lower Bounds. | Abtin Afshar, Geoffroy Couteau, Mohammad Mahmoody, Elahe Sadeghi |
| 2023 | EuroCrypt | Black-Box Separations for Non-interactive Classical Commitments in a Quantum World. | Kai-Min Chung, Yao-Ting Lin, Mohammad Mahmoody |
| 2023 | TCC | Lower Bounds on Assumptions Behind Registration-Based Encryption. | Mohammad Hajiabadi, Mohammad Mahmoody, Wei Qi, Sara Sarfaraz |
| 2022 | CRYPTO | On the Impossibility of Key Agreements from Quantum Random Oracles. | Per Austrin, Hao Chung, Kai-Min Chung, Shiuan Fu, Yao-Ting Lin, Mohammad Mahmoody |
| 2022 | TCC | Lower Bounds for the Number of Decryption Updates in Registration-Based Encryption. | Mohammad Mahmoody, Wei Qi, Ahmadreza Rahimi |
| 2021 | UAI | Learning and certification under instance-targeted poisoning. | Ji Gao, Amin Karbasi, Mohammad Mahmoody |
| 2021 | SP | Is Private Learning Possible with Instance Encoding? | Nicholas Carlini, Samuel Deng, Sanjam Garg, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Abhradeep Thakurta, Florian Tramr |
| 2021 | TCC | Polynomial-Time Targeted Attacks on Coin Tossing for Any Number of Corruptions. | Omid Etesami, Ji Gao, Saeed Mahloujifar, Mohammad Mahmoody |
| 2020 | ALT | Adversarially Robust Learning Could Leverage Computational Hardness. | Sanjam Garg, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody |
| 2020 | ICALP | Can Verifiable Delay Functions Be Based on Random Oracles? | Mohammad Mahmoody, Caleb Smith, David J. Wu |
| 2020 | ICMLA | Lower Bounds for Adversarially Robust PAC Learning under Evasion and Hybrid Attacks. | Dimitrios I. Diochnos, Saeed Mahloujifar, Mohammad Mahmoody |
| 2020 | ISAIM | Lower Bounds for Adversarially Robust PAC Learning. | Dimitrios I. Diochnos, Saeed Mahloujifar, Mohammad Mahmoody |
| 2020 | SODA | Computational Concentration of Measure: Optimal Bounds, Reductions, and More. | Omid Etesami, Saeed Mahloujifar, Mohammad Mahmoody |
| 2019 | AAAI | The Curse of Concentration in Robust Learning: Evasion and Poisoning Attacks from Concentration of Measure. | Saeed Mahloujifar, Dimitrios I. Diochnos, Mohammad Mahmoody |
| 2019 | ALT | Can Adversarially Robust Learning LeverageComputational Hardness? | Saeed Mahloujifar, Mohammad Mahmoody |
| 2019 | ICML | Data Poisoning Attacks in Multi-Party Learning. | Saeed Mahloujifar, Mohammad Mahmoody, Ameer Mohammed |
| 2019 | PKC | Registration-Based Encryption from Standard Assumptions. | Sanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody, Ahmadreza Rahimi, Sruthi Sekar |
| 2018 | ALT | Learning under $p$-Tampering Attacks. | Saeed Mahloujifar, Dimitrios I. Diochnos, Mohammad Mahmoody |
| 2018 | CRYPTO | Limits on the Power of Garbling Techniques for Public-Key Encryption. | Sanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody, Ameer Mohammed |
| 2018 | CRYPTO | On the Round Complexity of OT Extension. | Sanjam Garg, Mohammad Mahmoody, Daniel Masny, Izaak Meckler |
| 2018 | ISAIM | Learning under p-Tampering Attacks. | Saeed Mahloujifar, Dimitrios I. Diochnos, Mohammad Mahmoody |
| 2018 | TCC | Registration-Based Encryption: Removing Private-Key Generator from IBE. | Sanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody, Ahmadreza Rahimi |
| 2017 | CRYPTO | Lower Bounds on Obfuscation from All-or-Nothing Encryption Primitives. | Sanjam Garg, Mohammad Mahmoody, Ameer Mohammed |
| 2017 | TCC | When Does Functional Encryption Imply Obfuscation? | Sanjam Garg, Mohammad Mahmoody, Ameer Mohammed |
| 2017 | TCC | Blockwise p-Tampering Attacks on Cryptographic Primitives, Extractors, and Learners. | Saeed Mahloujifar, Mohammad Mahmoody |
| 2016 | EuroCrypt | On the Power of Hierarchical Identity-Based Encryption. | Mohammad Mahmoody, Ameer Mohammed |
| 2016 | TCC | On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models. | Mohammad Mahmoody, Ameer Mohammed, Soheil Nematihaji |
| 2016 | TCC | Lower Bounds on Assumptions Behind Indistinguishability Obfuscation. | Mohammad Mahmoody, Ameer Mohammed, Soheil Nematihaji, Rafael Pass, Abhi Shelat |
| 2014 | CRYPTO | On the Impossibility of Cryptography with Tamperable Randomness. | Per Austrin, Kai-Min Chung, Mohammad Mahmoody, Rafael Pass, Karn Seth |
| 2014 | TCC | Can Optimally-Fair Coin Tossing Be Based on One-Way Functions? | Dana Dachman-Soled, Mohammad Mahmoody, Tal Malkin |
| 2014 | TCC | On the Power of Public-Key Encryption in Secure Computation. | Mohammad Mahmoody, Hemanta K. Maji, Manoj Prabhakaran |
| 2013 | TCC | Languages with Efficient Zero-Knowledge PCPs are in SZK. | Mohammad Mahmoody, David Xiao |
| 2012 | CRYPTO | The Curious Case of Non-Interactive Commitments - On the Power of Black-Box vs. Non-Black-Box Use of Primitives. | Mohammad Mahmoody, Rafael Pass |
| 2012 | TCC | On Black-Box Reductions between Predicate Encryption Schemes. | Vipul Goyal, Virendra Kumar, Satyanarayana V. Lokam, Mohammad Mahmoody |
| 2012 | TCC | On Efficient Zero-Knowledge PCPs. | Yuval Ishai, Mohammad Mahmoody, Amit Sahai |
| 2011 | CRYPTO | Time-Lock Puzzles in the Random Oracle Model. | Mohammad Mahmoody, Tal Moran, Salil P. Vadhan |
| 2011 | TCC | On the Black-Box Complexity of Optimally-Fair Coin Tossing. | Dana Dachman-Soled, Yehuda Lindell, Mohammad Mahmoody, Tal Malkin |
| 2010 | CRYPTO | Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography. | Vipul Goyal, Yuval Ishai, Mohammad Mahmoody, Amit Sahai |