Mohammad Mahmoody
I am an assistant professor in the Computer Science Department of the University of Virginia (UVA).
Prior to joining the UVA I was a postdoctoral research associate in the Computer Science Department of Cornell University under the supervision of Professor Rafael Pass.
I received my PhD in 2010 from the Computer Science Department of Princeton University under the supervision of Professor Boaz Barak.
I am interested in theoretical computer science. In particular, I am interested in foundations of cryptography and its interplay with computational complexity.
If you are a (current or prospective) student at the UVA who is interested in foundations of cryptography and/or computational complexity and would like to work with me, let me know.
Here is my CV from Sept 2013.
Publications:
Languages with Efficient Zero-Knowledge PCPs are in SZK
with David Xiao.
Theory of Cryptography Conference (TCC) 2013.
On the Power of Nonuniformity in Proofs of Security
with Kai-Min Chung, Huijia Lin, and Rafael Pass.
Innovations in Theoretical Computer Science (ITCS) 2013.
Publicly Verifiable Proofs of Sequential Work
with Tal Moran and Salil Vadhan.
Innovations in Theoretical Computer Science (ITCS) 2013.
The Curious Case of Noninteractive Commitments: On the Power of Black-Box vs. Non-Black-Box Use of Primitives
with Rafael Pass.
International Cryptography Conference (Crypto) 2012.
On Efficient Zero-Knowledge PCPs
with Yuval Ishai and Amit Sahai.
Theory of Cryptography Conference (TCC) 2012.
Invited to Journal of Cryptology.
On Black-Box Reductions between Predicate Encryption Schemes
with Vipul Goyal, Virendra Kumar, and Satya Lokam.
Theory of Cryptography Conference (TCC) 2012.
Time-Lock Puzzles in the Random Oracle Model
with Tal Moran and Salil Vadhan.
International Cryptography Conference (Crypto) 2011.
On Black-Box Complexity of Optimally-Fair Coin-Tossing
with Dana Dachman-Soled, Yehuda Lindell, and Tal Malkin.
Theory of Cryptography Conference (TCC) 2011.
Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography
with Vipul Goyal, Yuval Ishai, and Amit Sahai.
International Cryptography Conference (Crypto) 2010.
On the Power of Randomized Reductions and the Checkability of SAT
with David Xiao
Computational Complexity Conference (CCC) 2010.
A New Sampling Protocol and Applications to Basing Cryptogaphic Primitives on the Hardness of NP
with Iftach Haitner and David Xiao
Computational Complexity Conference (CCC) 2010.
Merkle Puzzles are Optimal
with Boaz Barak
International Cryptography Conference (Crypto) 2009.
Invited to Journal of Cryptology.
Download the full version from here.
Load Sensitive Topology Control: Towards Minimum Energy Consumption in Dense Ad Hoc Sensor Networks
with A. Nayyeri, S. Zarifzadeh, and N. Yazdani
Computer Networks, Vol. 52, pp. 493--513, 2008.
Lower Bounds on Signatures from Symmetric Primitives
with Boaz Barak
Annual Symposium on Foundations of Computer Science (FOCS), 2007.
On Rainbow Cycles in Edge Colored Complete Graphs
with S. Akbari, O. Etesami, and H. Mahini
Australasian Journal of Combinatorics, Vol. 37, pp. 33--42, 2007.
Transversals in Long Rectangular Arrays
with S. Akbari, O. Etesami, H. Mahini, and A. Sharifi
Discrete Mathematics, Vol. 306, pp. 3011--3013, 2006.
In Submission:
On the (Im)Possibility of Tamper-Resilient Cryptography: Using Fourier Analysis in Computer Viruses
with Per Austrin, Kai-Min Chung, Rafael Pass, and Karn Seth.
Unprovable Security of Two-Message Zero Knowledge
with Kai-Min Chung, Edward Lui, and Rafael Pass.
Limits of Random Oracles in Secure Computation
with Hemanta K. Maji and Manoj Prabhakaran.
Manuscripts:
Black Boxes, Incorporated, (a survey)
with Avi Wigderson.
Studies in the Efficiency and (versus) Security of Cryptographic Tasks
Ph.D Thesis, Princeton University, 2010.