Transversals in long rectangular arrays. - Saeed Akbari; Omid Etesami; H. Mahini; Mohammad Mahmoody; Arash Sharifi (Discret. Math., 2006)

On rainbow cycles in edge colored complete graphs. - Saieed Akbari; Omid Etesami; H. Mahini; Mohammad Mahmoody (Australas. J Comb., 2007)

Load sensitive topology control: Towards minimum energy consumption in dense ad hoc sensor networks. - Amir Nayyeri; Sajjad Zarifzadeh; Nasser Yazdani; Mohammad Mahmoody-Ghidary (Comput. Networks, 2008)

Merkle Puzzles are Optimal. - Boaz Barak; Mohammad Mahmoody-Ghidary (IACR Cryptol. ePrint Arch., 2008)

Lower Bounds on Signatures From Symmetric Primitives. - Boaz Barak; Mohammad Mahmoody-Ghidary (IACR Cryptol. ePrint Arch., 2008)

Merkle Puzzles Are Optimal - An O(n2)-Query Attack on Any Key Exchange from a Random Oracle. - Boaz Barak; Mohammad Mahmoody-Ghidary (CRYPTO, 2009)

On the Power of Randomized Reductions and the Checkability of SAT. - Mohammad Mahmoody; David Xiao (Electron. Colloquium Comput. Complex., 2009)

Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography. - Vipul Goyal; Yuval Ishai; Mohammad Mahmoody; Amit Sahai (Electron. Colloquium Comput. Complex., 2010)

A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP. - Iftach Haitner; Mohammad Mahmoody; David Xiao (Electron. Colloquium Comput. Complex., 2010)

Time-Lock Puzzles in the Random Oracle Model. - Mohammad Mahmoody; Tal Moran; Salil P. Vadhan (CRYPTO, 2011)

On the Black-Box Complexity of Optimally-Fair Coin Tossing. - Dana Dachman-Soled; Yehuda Lindell; Mohammad Mahmoody; Tal Malkin (TCC, 2011)

Non-Interactive Time-Stamping and Proofs of Work in the Random Oracle Model. - Mohammad Mahmoody; Tal Moran; Salil P. Vadhan (IACR Cryptol. ePrint Arch., 2011)

The Curious Case of Non-Interactive Commitments - On the Power of Black-Box vs. Non-Black-Box Use of Primitives. - Mohammad Mahmoody; Rafael Pass (CRYPTO, 2012)

On Black-Box Reductions between Predicate Encryption Schemes. - Vipul Goyal; Virendra Kumar; Satyanarayana V. Lokam; Mohammad Mahmoody (TCC, 2012)

On Efficient Zero-Knowledge PCPs. - Yuval Ishai; Mohammad Mahmoody; Amit Sahai (TCC, 2012)

Limits of Random Oracles in Secure Computation. - Mohammad Mahmoody; Hemanta K. Maji; Manoj Prabhakaran 001 (Electron. Colloquium Comput. Complex., 2012)

Languages with Efficient Zero-Knowledge PCPs are in SZK. - Mohammad Mahmoody; David Xiao (Electron. Colloquium Comput. Complex., 2012)

Unprovable Security of Two-Message Zero Knowledge. - Kai-Min Chung; Edward Lui; Mohammad Mahmoody; Rafael Pass (IACR Cryptol. ePrint Arch., 2012)

The Curious Case of Non-Interactive Commitments. - Mohammad Mahmoody; Rafael Pass (IACR Cryptol. ePrint Arch., 2012)

Languages with Efficient Zero-Knowledge PCP's are in SZK. - Mohammad Mahmoody; David Xiao (IACR Cryptol. ePrint Arch., 2012)

On the power of nonuniformity in proofs of security. - Kai-Min Chung; Huijia Lin; Mohammad Mahmoody; Rafael Pass (ITCS, 2013)

Publicly verifiable proofs of sequential work. - Mohammad Mahmoody; Tal Moran; Salil P. Vadhan (ITCS, 2013)

On the Power of Public-key Encryption in Secure Computation. - Mohammad Mahmoody; Hemanta K. Maji; Manoj Prabhakaran 001 (Electron. Colloquium Comput. Complex., 2013)

On the (Im)Possibility of Tamper-Resilient Cryptography: Using Fourier Analysis in Computer Viruses. - Per Austrin; Kai-Min Chung; Mohammad Mahmoody; Rafael Pass; Karn Seth (IACR Cryptol. ePrint Arch., 2013)

Can Optimally-Fair Coin Tossing Be Based on One-Way Functions? - Dana Dachman-Soled; Mohammad Mahmoody; Tal Malkin (TCC, 2014)

On the Power of Hierarchical Identity-Based Encryption. - Mohammad Mahmoody; Ameer Mohammed (IACR Cryptol. ePrint Arch., 2015)

More on Impossibility of Virtual Black-Box Obfuscation in Idealized Models. - Mohammad Mahmoody; Ameer Mohammed; Soheil Nematihaji (IACR Cryptol. ePrint Arch., 2015)

Lower Bounds on Assumptions behind Indistinguishability Obfuscation. - Mohammad Mahmoody; Ameer Mohammed; Soheil Nematihaji; Rafael Pass; Abhi Shelat (IACR Cryptol. ePrint Arch., 2015)

On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models. - Mohammad Mahmoody; Ameer Mohammed; Soheil Nematihaji (TCC (A1), 2016)

A Note on Black-Box Complexity of Indistinguishability Obfuscation. - Mohammad Mahmoody; Ameer Mohammed; Soheil Nematihaji; Rafael Pass; Abhi Shelat (IACR Cryptol. ePrint Arch., 2016)

On the Impossibility of Cryptography with Tamperable Randomness. - Per Austrin; Kai-Min Chung; Mohammad Mahmoody; Rafael Pass; Karn Seth (Algorithmica, 2017)

Lower Bounds on Obfuscation from All-or-Nothing Encryption Primitives. - Sanjam Garg; Mohammad Mahmoody; Ameer Mohammed (IACR Cryptol. ePrint Arch., 2017)

When does Functional Encryption Imply Obfuscation? - Sanjam Garg; Mohammad Mahmoody; Ameer Mohammed (IACR Cryptol. ePrint Arch., 2017)

On the Round Complexity of OT Extension. - Sanjam Garg; Mohammad Mahmoody; Daniel Masny; Izaak Meckler (IACR Cryptol. ePrint Arch., 2017)

Blockwise p-Tampering Attacks on Cryptographic Primitives, Extractors, and Learners. - Saeed Mahloujifar; Mohammad Mahmoody (IACR Cryptol. ePrint Arch., 2017)

Merkle's Key Agreement Protocol is Optimal: An O(n2) Attack on Any Key Agreement from Random Oracles. - Boaz Barak; Mohammad Mahmoody-Ghidary (J. Cryptol., 2017)

Learning under $p$-Tampering Attacks. - Saeed Mahloujifar; Dimitrios I. Diochnos; Mohammad Mahmoody (ALT, 2018)

Adversarial Risk and Robustness: General Definitions and Implications for the Uniform Distribution. - Dimitrios I. Diochnos; Saeed Mahloujifar; Mohammad Mahmoody (NeurIPS, 2018)

Can Adversarially Robust Learning Leverage Computational Hardness? - Saeed Mahloujifar; Mohammad Mahmoody (CoRR, 2018)

Optimizing Trees for Static Searchable Encryption. - Mohammad Etemad; Mohammad Mahmoody; David Evans 001 (IACR Cryptol. ePrint Arch., 2018)

Limits on the Power of Garbling Techniques for Public-Key Encryption. - Sanjam Garg; Mohammad Hajiabadi; Mohammad Mahmoody; Ameer Mohammed (IACR Cryptol. ePrint Arch., 2018)

Registration-Based Encryption: Removing Private-Key Generator from IBE. - Sanjam Garg; Mohammad Hajiabadi; Mohammad Mahmoody; Ahmadreza Rahimi (IACR Cryptol. ePrint Arch., 2018)

Registration-Based Encryption from Standard Assumptions. - Sanjam Garg; Mohammad Hajiabadi; Mohammad Mahmoody; Ahmadreza Rahimi; Sruthi Sekar (IACR Cryptol. ePrint Arch., 2018)

Multi-party Poisoning through Generalized p-Tampering. - Saeed Mahloujifar; Mohammad Mahmoody; Ameer Mohammed (IACR Cryptol. ePrint Arch., 2018)

The Curse of Concentration in Robust Learning: Evasion and Poisoning Attacks from Concentration of Measure. - Saeed Mahloujifar; Dimitrios I. Diochnos; Mohammad Mahmoody (AAAI, 2019)

Can Adversarially Robust Learning LeverageComputational Hardness? - Saeed Mahloujifar; Mohammad Mahmoody (ALT, 2019)

Data Poisoning Attacks in Multi-Party Learning. - Saeed Mahloujifar; Mohammad Mahmoody; Ameer Mohammed (ICML, 2019)

Empirically Measuring Concentration: Fundamental Limits on Intrinsic Robustness. - Saeed Mahloujifar; Xiao Zhang 016; Mohammad Mahmoody; David Evans 001 (NeurIPS, 2019)

A Note on the (Im)possibility of Verifiable Delay Functions in the Random Oracle Model. - Mohammad Mahmoody; Caleb Smith; David J. Wu 001 (IACR Cryptol. ePrint Arch., 2019)

Adversarially Robust Learning Could Leverage Computational Hardness. - Sanjam Garg; Somesh Jha; Saeed Mahloujifar; Mohammad Mahmoody (ALT, 2020)

Can Verifiable Delay Functions Be Based on Random Oracles? - Mohammad Mahmoody; Caleb Smith; David J. Wu 001 (ICALP, 2020)

Lower Bounds for Adversarially Robust PAC Learning under Evasion and Hybrid Attacks. - Dimitrios I. Diochnos; Saeed Mahloujifar; Mohammad Mahmoody (ICMLA, 2020)

Lower Bounds for Adversarially Robust PAC Learning. - Dimitrios I. Diochnos; Saeed Mahloujifar; Mohammad Mahmoody (ISAIM, 2020)

Computational Concentration of Measure: Optimal Bounds, Reductions, and More. - Omid Etesami; Saeed Mahloujifar; Mohammad Mahmoody (SODA, 2020)

Learning under p-tampering poisoning attacks. - Saeed Mahloujifar; Dimitrios I. Diochnos; Mohammad Mahmoody (Ann. Math. Artif. Intell., 2020)

Obliviousness Makes Poisoning Adversaries Weaker. - Sanjam Garg; Somesh Jha; Saeed Mahloujifar; Mohammad Mahmoody; Abhradeep Thakurta (CoRR, 2020)

An Attack on InstaHide: Is Private Learning Possible with Instance Encoding? - Nicholas Carlini; Samuel Deng; Sanjam Garg; Somesh Jha; Saeed Mahloujifar; Mohammad Mahmoody; Shuang Song 001; Abhradeep Thakurta; Florian Tramèr (CoRR, 2020)

A Separation Result Between Data-oblivious and Data-aware Poisoning Attacks. - Samuel Deng; Sanjam Garg; Somesh Jha; Saeed Mahloujifar; Mohammad Mahmoody; Abhradeep Guha Thakurta (NeurIPS, 2021)

Is Private Learning Possible with Instance Encoding? - Nicholas Carlini; Samuel Deng; Sanjam Garg; Somesh Jha; Saeed Mahloujifar; Mohammad Mahmoody; Abhradeep Thakurta; Florian Tramèr (SP, 2021)

Learning and certification under instance-targeted poisoning. - Ji Gao; Amin Karbasi; Mohammad Mahmoody (UAI, 2021)

NeuraCrypt is not private. - Nicholas Carlini; Sanjam Garg; Somesh Jha; Saeed Mahloujifar; Mohammad Mahmoody; Florian Tramèr (CoRR, 2021)

Black-Box Uselessness: Composing Separations in Cryptography. - Geoffroy Couteau; Pooya Farshim; Mohammad Mahmoody (IACR Cryptol. ePrint Arch., 2021)

Polynomial-time targeted attacks on coin tossing for any number of corruptions. - Omid Etesami; Ji Gao; Saeed Mahloujifar; Mohammad Mahmoody (IACR Cryptol. ePrint Arch., 2021)

Overparameterization from Computational Constraints. - Sanjam Garg; Somesh Jha; Saeed Mahloujifar; Mohammad Mahmoody; Mingyuan Wang 001 (NeurIPS, 2022)

On Optimal Learning Under Targeted Data Poisoning. - Steve Hanneke; Amin Karbasi; Mohammad Mahmoody; Idan Mehalel; Shay Moran (NeurIPS, 2022)

Overparameterized (robust) models from computational constraints. - Sanjam Garg; Somesh Jha; Saeed Mahloujifar; Mohammad Mahmoody; Mingyuan Wang 001 (CoRR, 2022)

On the Impossibility of Key Agreements from Quantum Random Oracles. - Per Austrin; Hao Chung; Kai-Min Chung; Shiuan Fu; Yao-Ting Lin; Mohammad Mahmoody (IACR Cryptol. ePrint Arch., 2022)

Lower Bounds for the Number of Decryption Updates in Registration-Based Encryption. - Mohammad Mahmoody; Wei Qi; Ahmadreza Rahimi (IACR Cryptol. ePrint Arch., 2022)

Deletion inference, reconstruction, and compliance in machine (un)learning. - Ji Gao; Sanjam Garg; Mohammad Mahmoody; Prashant Nalini Vasudevan (Proc. Priv. Enhancing Technol., 2022)

Online Mergers and Applications to Registration-Based Encryption and Accumulators. - Mohammad Mahmoody; Wei Qi (ITC, 2023)

Black-Box Separations for Non-interactive Classical Commitments in a Quantum World. - Kai-Min Chung; Yao-Ting Lin; Mohammad Mahmoody (EUROCRYPT (1), 2023)

Lower Bounds on Assumptions Behind Registration-Based Encryption. - Mohammad Hajiabadi; Mohammad Mahmoody; Wei Qi; Sara Sarfaraz (TCC (2), 2023)

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 (IACR Cryptol. ePrint Arch., 2023)

Fine-Grained Non-Interactive Key-Exchange: Constructions and Lower Bounds. - Abtin Afshar; Geoffroy Couteau; Mohammad Mahmoody; Elahe Sadeghi (IACR Cryptol. ePrint Arch., 2023)

Black-Box Separations for Non-Interactive Commitments in a Quantum World. - Kai-Min Chung; Yao-Ting Lin; Mohammad Mahmoody (IACR Cryptol. ePrint Arch., 2023)

Experimenting with Zero-Knowledge Proofs of Training. - Sanjam Garg; Aarushi Goel; Somesh Jha; Saeed Mahloujifar; Mohammad Mahmoody; Guru-Vamsi Policharla; Mingyuan Wang 001 (IACR Cryptol. ePrint Arch., 2023)

A Note on the Minimality of One-Way Functions in Post-Quantum Cryptography. - Sam Buxbaum; Mohammad Mahmoody (IACR Commun. Cryptol., 2024)

Publicly-Detectable Watermarking for Language Models. - Jaiden Fairoze; Sanjam Garg; Somesh Jha; Saeed Mahloujifar; Mohammad Mahmoody; Mingyuan Wang 001 (IACR Commun. Cryptol., 2024)

Graph of Attacks: Improved Black-Box and Interpretable Jailbreaks for LLMs. - Mohammad Akbar-Tajari; Mohammad Taher Pilehvar; Mohammad Mahmoody (CoRR, 2025)