Mohammad Mahmoody

ORCID

Publication Activity (10 Years)

Years Active: 2006-2023
Publications (10 Years): 80

Top Venues

IACR Cryptol. ePrint Arch.

CoRR

NeurIPS

TCC (2)

Publications

Jaiden Fairoze, Sanjam Garg, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Mingyuan Wang
Publicly Detectable Watermarking for Language Models. CoRR (2023)
Abtin Afshar, Kai-Min Chung, Yao-Ching Hsieh, Yao-Ting Lin, Mohammad Mahmoody
On the (Im)possibility of Time-Lock Puzzles in the Quantum Random Oracle Model. IACR Cryptol. ePrint Arch. 2023 (2023)
Abtin Afshar, Geoffroy Couteau, Mohammad Mahmoody, Elahe Sadeghi
Fine-Grained Non-Interactive Key-Exchange: Constructions and Lower Bounds. IACR Cryptol. ePrint Arch. 2023 (2023)
Abtin Afshar, Geoffroy Couteau, Mohammad Mahmoody, Elahe Sadeghi
Fine-Grained Non-interactive Key-Exchange: Constructions and Lower Bounds. EUROCRYPT (1) (2023)
Mohammad Hajiabadi, Mohammad Mahmoody, Wei Qi, Sara Sarfaraz
Lower Bounds on Assumptions Behind Registration-Based Encryption. TCC (2) (2023)
Sanjam Garg, Aarushi Goel, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Guru-Vamsi Policharla, Mingyuan Wang
Experimenting with Zero-Knowledge Proofs of Training. IACR Cryptol. ePrint Arch. 2023 (2023)
Jaiden Fairoze, Sanjam Garg, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Mingyuan Wang
Publicly Detectable Watermarking for Language Models. IACR Cryptol. ePrint Arch. 2023 (2023)
Sanjam Garg, Aarushi Goel, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Guru-Vamsi Policharla, Mingyuan Wang
Experimenting with Zero-Knowledge Proofs of Training. CCS (2023)
Mohammad Mahmoody, Wei Qi
Online Mergers and Applications to Registration-Based Encryption and Accumulators. ITC (2023)
Abtin Afshar, Kai-Min Chung, Yao-Ching Hsieh, Yao-Ting Lin, Mohammad Mahmoody
On the (Im)possibility of Time-Lock Puzzles in the Quantum Random Oracle Model. ASIACRYPT (4) (2023)
Kai-Min Chung, Yao-Ting Lin, Mohammad Mahmoody
Black-Box Separations for Non-interactive Classical Commitments in a Quantum World. EUROCRYPT (1) (2023)
Kai-Min Chung, Yao-Ting Lin, Mohammad Mahmoody
Black-Box Separations for Non-Interactive Commitments in a Quantum World. IACR Cryptol. ePrint Arch. 2023 (2023)
Steve Hanneke, Amin Karbasi, Mohammad Mahmoody, Idan Mehalel, Shay Moran
On Optimal Learning Under Targeted Data Poisoning. NeurIPS (2022)
Mohammad Mahmoody, Wei Qi, Ahmadreza Rahimi
Lower Bounds for the Number of Decryption Updates in Registration-Based Encryption. IACR Cryptol. ePrint Arch. 2022 (2022)
Steve Hanneke, Amin Karbasi, Mohammad Mahmoody, Idan Mehalel, Shay Moran
On Optimal Learning Under Targeted Data Poisoning. CoRR (2022)
Ji Gao, Sanjam Garg, Mohammad Mahmoody, Prashant Nalini Vasudevan
Deletion inference, reconstruction, and compliance in machine (un)learning. Proc. Priv. Enhancing Technol. 2022 (3) (2022)
Mohammad Mahmoody, Wei Qi, Ahmadreza Rahimi
Lower Bounds for the Number of Decryption Updates in Registration-Based Encryption. TCC (1) (2022)
Ji Gao, Sanjam Garg, Mohammad Mahmoody, Prashant Nalini Vasudevan
Deletion Inference, Reconstruction, and Compliance in Machine (Un)Learning. CoRR (2022)
Sanjam Garg, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Mingyuan Wang
Overparameterization from Computational Constraints. NeurIPS (2022)
Sanjam Garg, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Mingyuan Wang
Overparameterized (robust) models from computational constraints. CoRR (2022)
Per Austrin, Hao Chung, Kai-Min Chung, Shiuan Fu, Yao-Ting Lin, Mohammad Mahmoody
On the Impossibility of Key Agreements from Quantum Random Oracles. CRYPTO (2) (2022)
Per Austrin, Hao Chung, Kai-Min Chung, Shiuan Fu, Yao-Ting Lin, Mohammad Mahmoody
On the Impossibility of Key Agreements from Quantum Random Oracles. IACR Cryptol. ePrint Arch. 2022 (2022)
Samuel Deng, Sanjam Garg, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Abhradeep Guha Thakurta
A Separation Result Between Data-oblivious and Data-aware Poisoning Attacks. NeurIPS (2021)
Omid Etesami, Ji Gao, Saeed Mahloujifar, Mohammad Mahmoody
Polynomial-time targeted attacks on coin tossing for any number of corruptions. IACR Cryptol. ePrint Arch. 2021 (2021)
Nicholas Carlini, Sanjam Garg, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Florian Tramèr
NeuraCrypt is not private. CoRR (2021)
Omid Etesami, Ji Gao, Saeed Mahloujifar, Mohammad Mahmoody
Polynomial-Time Targeted Attacks on Coin Tossing for Any Number of Corruptions. TCC (2) (2021)
Ji Gao, Amin Karbasi, Mohammad Mahmoody
Learning and certification under instance-targeted poisoning. UAI (2021)
Geoffroy Couteau, Pooya Farshim, Mohammad Mahmoody
Black-Box Uselessness: Composing Separations in Cryptography. ITCS (2021)
Ji Gao, Amin Karbasi, Mohammad Mahmoody
Learning and Certification under Instance-targeted Poisoning. CoRR (2021)
Geoffroy Couteau, Pooya Farshim, Mohammad Mahmoody
Black-Box Uselessness: Composing Separations in Cryptography. IACR Cryptol. ePrint Arch. 2021 (2021)
Nicholas Carlini, Samuel Deng, Sanjam Garg, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Abhradeep Thakurta, Florian Tramèr
Is Private Learning Possible with Instance Encoding? IEEE Symposium on Security and Privacy (2021)
Mohammad Mahmoody, Caleb Smith, David J. Wu
Can Verifiable Delay Functions Be Based on Random Oracles? ICALP (2020)
Dimitrios I. Diochnos, Saeed Mahloujifar, Mohammad Mahmoody
Lower Bounds for Adversarially Robust PAC Learning under Evasion and Hybrid Attacks. ICMLA (2020)
Omid Etesami, Saeed Mahloujifar, Mohammad Mahmoody
Computational Concentration of Measure: Optimal Bounds, Reductions, and More. SODA (2020)
Sanjam Garg, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody
Adversarially Robust Learning Could Leverage Computational Hardness. ALT (2020)
Sanjam Garg, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Abhradeep Thakurta
Obliviousness Makes Poisoning Adversaries Weaker. CoRR (2020)
Saeed Mahloujifar, Dimitrios I. Diochnos, Mohammad Mahmoody
Learning under p-tampering poisoning attacks. Ann. Math. Artif. Intell. 88 (7) (2020)
Nicholas Carlini, Samuel Deng, Sanjam Garg, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Shuang Song, Abhradeep Thakurta, Florian Tramèr
An Attack on InstaHide: Is Private Learning Possible with Instance Encoding? CoRR (2020)
Dimitrios I. Diochnos, Saeed Mahloujifar, Mohammad Mahmoody
Lower Bounds for Adversarially Robust PAC Learning. ISAIM (2020)
Mohammad Mahmoody, Caleb Smith, David J. Wu
A Note on the (Im)possibility of Verifiable Delay Functions in the Random Oracle Model. IACR Cryptol. ePrint Arch. 2019 (2019)
Dimitrios I. Diochnos, Saeed Mahloujifar, Mohammad Mahmoody
Lower Bounds for Adversarially Robust PAC Learning. CoRR (2019)
Sanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody, Ahmadreza Rahimi, Sruthi Sekar
Registration-Based Encryption from Standard Assumptions. Public Key Cryptography (2) (2019)
Saeed Mahloujifar, Mohammad Mahmoody, Ameer Mohammed
Data Poisoning Attacks in Multi-Party Learning. ICML (2019)
Saeed Mahloujifar, Xiao Zhang, Mohammad Mahmoody, David Evans
Empirically Measuring Concentration: Fundamental Limits on Intrinsic Robustness. NeurIPS (2019)
Saeed Mahloujifar, Dimitrios I. Diochnos, Mohammad Mahmoody
The Curse of Concentration in Robust Learning: Evasion and Poisoning Attacks from Concentration of Measure. AAAI (2019)
Saeed Mahloujifar, Mohammad Mahmoody
Can Adversarially Robust Learning LeverageComputational Hardness? ALT (2019)
Saeed Mahloujifar, Xiao Zhang, Mohammad Mahmoody, David Evans
Empirically Measuring Concentration: Fundamental Limits on Intrinsic Robustness. CoRR (2019)
Sanjam Garg, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody
Adversarially Robust Learning Could Leverage Computational Hardness. CoRR (2019)
Omid Etesami, Saeed Mahloujifar, Mohammad Mahmoody
Computational Concentration of Measure: Optimal Bounds, Reductions, and More. CoRR (2019)
Sanjam Garg, Mohammad Mahmoody, Daniel Masny, Izaak Meckler
On the Round Complexity of OT Extension. CRYPTO (3) (2018)
Sanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody, Ahmadreza Rahimi, Sruthi Sekar
Registration-Based Encryption from Standard Assumptions. IACR Cryptol. ePrint Arch. 2018 (2018)
Saeed Mahloujifar, Dimitrios I. Diochnos, Mohammad Mahmoody
The Curse of Concentration in Robust Learning: Evasion and Poisoning Attacks from Concentration of Measure. CoRR (2018)
Sanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody, Ahmadreza Rahimi
Registration-Based Encryption: Removing Private-Key Generator from IBE. TCC (1) (2018)
Mohammad Etemad, Mohammad Mahmoody, David Evans
Optimizing Trees for Static Searchable Encryption. IACR Cryptol. ePrint Arch. 2018 (2018)
Saeed Mahloujifar, Mohammad Mahmoody, Ameer Mohammed
Multi-party Poisoning through Generalized p-Tampering. CoRR (2018)
Saeed Mahloujifar, Dimitrios I. Diochnos, Mohammad Mahmoody
Learning under p-Tampering Attacks. ISAIM (2018)
Saeed Mahloujifar, Mohammad Mahmoody, Ameer Mohammed
Multi-party Poisoning through Generalized p-Tampering. IACR Cryptol. ePrint Arch. 2018 (2018)
Sanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody, Ameer Mohammed
Limits on the Power of Garbling Techniques for Public-Key Encryption. CRYPTO (3) (2018)
Dimitrios I. Diochnos, Saeed Mahloujifar, Mohammad Mahmoody
Adversarial Risk and Robustness: General Definitions and Implications for the Uniform Distribution. NeurIPS (2018)
Saeed Mahloujifar, Dimitrios I. Diochnos, Mohammad Mahmoody
Learning under $p$-Tampering Attacks. ALT (2018)
Sanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody, Ameer Mohammed
Limits on the Power of Garbling Techniques for Public-Key Encryption. IACR Cryptol. ePrint Arch. 2018 (2018)
Dimitrios I. Diochnos, Saeed Mahloujifar, Mohammad Mahmoody
Adversarial Risk and Robustness: General Definitions and Implications for the Uniform Distribution. CoRR (2018)
Saeed Mahloujifar, Mohammad Mahmoody
Can Adversarially Robust Learning Leverage Computational Hardness? CoRR (2018)
Sanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody, Ahmadreza Rahimi
Registration-Based Encryption: Removing Private-Key Generator from IBE. IACR Cryptol. ePrint Arch. 2018 (2018)
Sanjam Garg, Mohammad Mahmoody, Ameer Mohammed
When Does Functional Encryption Imply Obfuscation? TCC (1) (2017)
Sanjam Garg, Mohammad Mahmoody, Ameer Mohammed
Lower Bounds on Obfuscation from All-or-Nothing Encryption Primitives. CRYPTO (1) (2017)
Saeed Mahloujifar, Mohammad Mahmoody
Blockwise p-Tampering Attacks on Cryptographic Primitives, Extractors, and Learners. IACR Cryptol. ePrint Arch. 2017 (2017)
Per Austrin, Kai-Min Chung, Mohammad Mahmoody, Rafael Pass, Karn Seth
On the Impossibility of Cryptography with Tamperable Randomness. Algorithmica 79 (4) (2017)
Saeed Mahloujifar, Mohammad Mahmoody
Blockwise p-Tampering Attacks on Cryptographic Primitives, Extractors, and Learners. TCC (2) (2017)
Sanjam Garg, Mohammad Mahmoody, Daniel Masny, Izaak Meckler
On the Round Complexity of OT Extension. IACR Cryptol. ePrint Arch. 2017 (2017)
Saeed Mahloujifar, Dimitrios I. Diochnos, Mohammad Mahmoody
Learning under p-Tampering Attacks. CoRR (2017)
Sanjam Garg, Mohammad Mahmoody, Ameer Mohammed
When does Functional Encryption Imply Obfuscation? IACR Cryptol. ePrint Arch. 2017 (2017)
Sanjam Garg, Mohammad Mahmoody, Ameer Mohammed
Lower Bounds on Obfuscation from All-or-Nothing Encryption Primitives. IACR Cryptol. ePrint Arch. 2017 (2017)
Mohammad Mahmoody, Ameer Mohammed
On the Power of Hierarchical Identity-Based Encryption. EUROCRYPT (2) (2016)
Mohammad Mahmoody, Ameer Mohammed, Soheil Nematihaji, Rafael Pass, Abhi Shelat
Lower Bounds on Assumptions Behind Indistinguishability Obfuscation. TCC (A1) (2016)
Mohammad Mahmoody, Ameer Mohammed, Soheil Nematihaji, Rafael Pass, Abhi Shelat
A Note on Black-Box Complexity of Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2016 (2016)
Mohammad Mahmoody, Ameer Mohammed, Soheil Nematihaji
On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models. TCC (A1) (2016)
Mohammad Mahmoody, Ameer Mohammed, Soheil Nematihaji, Rafael Pass, Abhi Shelat
Lower Bounds on Assumptions behind Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2015 (2015)
Mohammad Mahmoody, Ameer Mohammed, Soheil Nematihaji
More on Impossibility of Virtual Black-Box Obfuscation in Idealized Models. IACR Cryptol. ePrint Arch. 2015 (2015)
Mohammad Mahmoody, Ameer Mohammed
On the Power of Hierarchical Identity-Based Encryption. IACR Cryptol. ePrint Arch. 2015 (2015)
Mohammad Mahmoody, Hemanta K. Maji, Manoj Prabhakaran
On the Power of Public-Key Encryption in Secure Computation. TCC (2014)
Dana Dachman-Soled, Mohammad Mahmoody, Tal Malkin
Can Optimally-Fair Coin Tossing Be Based on One-Way Functions? TCC (2014)
Mohammad Mahmoody, Hemanta K. Maji, Manoj Prabhakaran
Limits of random oracles in secure computation. ITCS (2014)
Per Austrin, Kai-Min Chung, Mohammad Mahmoody, Rafael Pass, Karn Seth
On the Impossibility of Cryptography with Tamperable Randomness. CRYPTO (1) (2014)
Mohammad Mahmoody, David Xiao
Languages with Efficient Zero-Knowledge PCPs are in SZK. TCC (2013)
Mohammad Mahmoody, Tal Moran, Salil P. Vadhan
Publicly verifiable proofs of sequential work. ITCS (2013)
Kai-Min Chung, Huijia Lin, Mohammad Mahmoody, Rafael Pass
On the power of nonuniformity in proofs of security. ITCS (2013)
Mohammad Mahmoody, Hemanta K. Maji, Manoj Prabhakaran
On the Power of Public-key Encryption in Secure Computation. Electron. Colloquium Comput. Complex. 20 (2013)
Per Austrin, Kai-Min Chung, Mohammad Mahmoody, Rafael Pass, Karn Seth
On the (Im)Possibility of Tamper-Resilient Cryptography: Using Fourier Analysis in Computer Viruses. IACR Cryptol. ePrint Arch. 2013 (2013)
Mohammad Mahmoody, David Xiao
Languages with Efficient Zero-Knowledge PCP's are in SZK. IACR Cryptol. ePrint Arch. 2012 (2012)
Kai-Min Chung, Edward Lui, Mohammad Mahmoody, Rafael Pass
Unprovable Security of Two-Message Zero Knowledge. IACR Cryptol. ePrint Arch. 2012 (2012)
Vipul Goyal, Virendra Kumar, Satyanarayana V. Lokam, Mohammad Mahmoody
On Black-Box Reductions between Predicate Encryption Schemes. TCC (2012)
Mohammad Mahmoody, David Xiao
Languages with Efficient Zero-Knowledge PCPs are in SZK. Electron. Colloquium Comput. Complex. 19 (2012)
Mohammad Mahmoody, Rafael Pass
The Curious Case of Non-Interactive Commitments - On the Power of Black-Box vs. Non-Black-Box Use of Primitives. CRYPTO (2012)
Mohammad Mahmoody, Hemanta K. Maji, Manoj Prabhakaran
Limits of Random Oracles in Secure Computation CoRR (2012)
Yuval Ishai, Mohammad Mahmoody, Amit Sahai
On Efficient Zero-Knowledge PCPs. TCC (2012)
Mohammad Mahmoody, Hemanta K. Maji, Manoj Prabhakaran
Limits of Random Oracles in Secure Computation. Electron. Colloquium Comput. Complex. 19 (2012)
Mohammad Mahmoody, Rafael Pass
The Curious Case of Non-Interactive Commitments. IACR Cryptol. ePrint Arch. 2012 (2012)
Mohammad Mahmoody, Tal Moran, Salil P. Vadhan
Time-Lock Puzzles in the Random Oracle Model. CRYPTO (2011)
Dana Dachman-Soled, Yehuda Lindell, Mohammad Mahmoody, Tal Malkin
On the Black-Box Complexity of Optimally-Fair Coin Tossing. TCC (2011)

Mohammad Mahmoody.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Mohammad Mahmoody