Computer Science University
Resume:
Mohammad Mahmoody Curriculum Vitae
Residential Address: Phone: 609-***-****
*** ***** *** *** *** Email: ********@**.*******.***
Ithaca, NY 14850 http://www.cs.cornell.edu/~mohammad/
Research Interests
I am generally interested in theoretical computer science and particularly in the foundations of cryptography
and its interplay with computational complexity.
Education
Cornell University, Ithaca, USA.
Postdoctoral Research Associate, Adviser: Rafael Pass, (since the Fall of 2010).
Princeton University, Princeton, USA.
Ph.D. in Computer Science, Major: Theory, Adviser: Boaz Barak, (2005-2010).
Sharif University, Tehran, Iran.
B.Sc. in Computer Engineering, Major: Software Engineering, (2000-2004).
Allame Helli High School, Tehran, Iran.
The National Institute for the Development of Exceptional Talents,
High-school diploma in Mathematics and Physics discipline, (1996-2000).
Honors and Awards
Wu Prize for Excellence, Princeton University 2009.
First Rank, National Graduate Entrance Examination in Computer Science, Iran 2004.
First Team Rank, ACM ICPC Regional Contest, Tehran, Iran 2002.
Gold Medal, 9th Iran National Olympiad in Informatics, Iran, 1999.
Teaching
Teaching Assistant, Princeton University:, Algorithms and Data Structures, Spring 2007, Discrete
Mathematics, Fall 2006.
Teaching Assistant, Sharif University: Advanced Algorithms (Graduate), Fall 2002, Mathematics of
Engineering, Fall 2002, Data Structures and Algorithms, Spring 2002, Discrete Mathematics, Spring 2002.
Member of National Committee of Iran s Informatics Olympiad, 2000-2003.
Responsibilities included designing problems, and training selected students for the international olympiad.
Committees
Theory of Cryptography Conference (TCC) 2011
Theory of Cryptography Conference (TCC) 2013.
Research Papers
Submitted:
1. Per Austrin, Kai-Min Chung, Mohammad Mahmoody, Rafael Pass, and Karn Seth
On the (Im)Possibility of Tamper-Resilient Cryptography: Using Fourier Analysis in Computer Viruses
2. Kai-Min Chung, Mohammad Mahmoody, and Rafael Pass
Shannon Meets Random Oracles: On the Power of Collision Resistant Hashing in Black-Box Constructions
3. Mohammad Mahmoody, Hemanta K. Maji, and Manoj Prabhakaran
Limits of Random Oracles in Secure Computation
4. Mohammad Mahmoody and David Xiao
Languages with E cient Zero-Knowledge PCPs are in SZK
Published:
5. Kai-Min Chung, Huijia Lin, Mohammad Mahmoody, and Rafael Pass
On the Power of Nonuniformity in Proofs of Security
Innovations in Theoretical Computer Science, 2013.
6. Mohammad Mahmoody, Tal Moran, and Salil Vadhan
Noninteractive Timestamping and Publicly Veri able Proofs of Work
Innovations in Theoretical Computer Science, 2013.
7. Mohammad Mahmoody and Rafael Pass
The Curious Case of Noninteractive Commitment
International Cryptology Conference (Crypto) 2012.
8. Yuval Ishai, Mohammad Mahmoody, and Amit Sahai
On E cient Zero-Knowledge PCPs
Theory of Cryptography Conference (TCC) 2012.
9. Vipul Goyal, Virendra Kumar, Satya Lokam, and Mohammad Mahmoody
On Black-Box Reductions between Predicate Encryption Schemes
Theory of Cryptography Conference (TCC) 2012.
10. Mohammad Mahmoody, Tal Moran, and Salil Vadhan
Time-Lock Puzzles in the Random Oracle Model
International Cryptology Conference (Crypto) 2011.
11. Dana Dachman-Soled, Yehuda Lindell, Mohammad Mahmoody, and Tal Malkin
On the Black-Box Complexity of Optimally-Fair Coin Tossing
Theory of Cryptography Conference (TCC) 2011.
12. Vipul Goyal, Yuval Ishai, Mohammad Mahmoody, and Amit Sahai
Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography
International Cryptology Conference (Crypto) 2010.
13. Mohammad Mahmoody and David Xiao
On the Power of Randomized Reductions and the Checkability of SAT
Computational Complexity Conference (CCC) 2010.
14. Iftach Haitner, Mohammad Mahmoody, and David Xiao
A New Sampling Protocol and Applications to Basing Cryptogaphic Primitives on Hardness of NP
Computational Complexity Conference (CCC) 2010.
15. Mohammad Mahmoody
Studies in the E ciency and (versus) Security of Cryptographic Tasks
Ph.D Thesis, Princeton University, 2010.
16. Boaz Barak and Mohammad Mahmoody
Merkle Puzzles are Optimal
International Cryptology Conference (Crypto) 2009, Invited to Journal of Cryptology.
17. S. Nayyeri, S. Zarifzadeh, N. Yazdani, and M. Mahmoody
Load sensitive topology control: Towards minimum energy consumption in dense ad hoc sensor networks
Computer Networks, Vol. 52, pp. 493 513, 2008.
18. Boaz Barak and Mohammad Mahmoody
Lower Bounds on Signatures From Symmetric Primitives
Annual Symposium on Foundations of Computer Science (FOCS), 2007.
19. S. Akbari, O. Etesami, H. Mahini, and M. Mahmoody
On Rainbow Cycles in Edge-Colored Complete Graphs
Australasian Journal of Combinatorics, Vo. 37, pp. 33-42, 2007.
20. S. Akbari, O. Etesami, H. Mahini, M. Mahmoody, and A. Shari
Transversals in Long Rectangular Arrays
Discrete Mathematics, Vol. 306, pp. 30113013, 2006.
Reviews
Journals: Theory of Computing, Journal of Cryptology, Transactions on Computing Theory, Random
Structures and Algorithms, SIAM Journal on Computing (SICOMP), Cryptography and Communications,
Computational Complexity Journal.
Conferences: Crypto 2008, FOCS 2009, Crypto 2009, TCC 2010, STOC 2010, ICALP 2010, FOCS 2010,
Crypto 2011, TCC 2011, Approx-Random 2011, STOC 2012, ICALP 2012, ITCS 2013.
Selected Talks
Boston University, 2012
On the (Im)Possibility of Tamper Resilient Cryptography.
International Cryptology Conference (Crypto), Santa Barbara, 2012
The Curious Case of Non-Interactive Commitments.
Talk on the same subject presented as Toronto University and Cornell University .
Theory of Cryptography Conference (TCC), Taormina, Italy, 2012
On E cient Zero-Knowledge PCPs.
Talks on the same subject presented at: New York s Crypto Day at Columbia University and Laboratoire
d Informatique Algorithmique: Fondements et Applications (LIAFA) in Paris .
International Cryptology Conference (Crypto), Santa Barbara, 2010
Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography. Talks on the same subject
presented at: Columbia University and University of Maryland at College Park.
Computational Complexity Conference, Boston, 2010
On the Power of Randomized Reductions and the Checkability of SAT.
University of Texas at Austin, 2010
On NP-Hard Cryptography.
Talk on the same subject presented at Cornell University s Theory Seminar.
International Cryptology Conference (Crypto), 2009
Merkle Puzzles are Optimal.
Talk on the same subject presented at: Institute of Advanced Studies and Columbia University.
IBM, Thomas J. Watson Research Center, 2008
On Optimality of Merkle and Lamport Schems.
Talk on the same subject presented at ETH Zurich.
Symposium on Foundations of Computer Science (FOCS), 2007
Lower-Bounds on Signatures from Symmetric Primitives.
Contact this candidate