Mohammad Mahmoody
Department of Computer Science
Princeton University
I am interested in Theoretical Computer Science in general, and Foundations of Cryptography in particular.
My PhD adviser is
Boaz Barak
, and here is my
CV
.
Publications in Reverse Chronological Order:
Exploring the Limits of Trusted Coins Using Frontier Analysis
, (in preparation)
with H. K. Maji, P. Ouppaphan, M. Prabhakaran, and M. Rosulek.
Black Boxes, Incorporated
, (a survey - in preparation)
with Avi Wigderson.
Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography,
with Vipul Goyal, Yuval Ishai, and Amit Sahai.
Submitted.
On the Power of Randomized Reductions and the Checkability of SAT
,
with David Xiao.
ECCC TR09-139
.
A New Sampling Protocol and Applications to Basing Cryptogaphic Primitives on Hardness of NP
,
with Iftach Haitner and David Xiao.
Submitted.
Merkle Puzzles are Optimal
,
with Boaz Barak.
Crypto 2009, Invited to Journal of Cryptology.
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.
Proceedings of the 38th 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.