Mohammad Mahmoody

I am a Ph.D. student in the Department of Computer Science at Princeton University since fall 2005. My adviser is Boaz Barak. I am interested in Theoretical Computer Science in general, and Foundations of Cryptography in particular. I received my B.S. from the Department of Computer Engineering at Sharif University of Technology.

Publications:

• Black Boxes, Incorporated, with Avi Wigderson
  A survey, in Preparation.
• A New Sampling Protocol and Applications to Basing Cryptogaphic Primitives on Hardness of NP, with Iftach Haitner and David Xiao.
  
• Merkle Puzzles are Optimal, with Boaz Barak.
  Crypto 2009, Invited to Journal of Cryptology.
• Lower Bounds on Signatures from Symmetric Primitives, with Boaz Barak.
  Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS), 2007.
• 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.
• 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.