Prashant Puniya

PhD Student
Computer Science Department
Courant Institute of Mathematical Sciences
New York University

Room no. 605
Warren Weaver Hall
251, Mercer Street
New York, NY 10012
Tel: +1 (917) 232-8390

Resume PDF PS


Recently, I completed my PhD in Cryptography at Courant Institute, New York University. My advisor is Prof. Yevgeniy Dodis.
Prior to this, I completed my B.Tech. in Computer Science and Engineering at Indian Institute of Technology (IIT), Mumbai, India.


My main area of interest is Cryptography . Currently, my research is focussed on finding security definitions for the design of hash functions, block ciphers and related primitives, as well as finding constructions satisfying these definitions.

Apart from this, I'm also interested in Complexity Theory, Combinatorics and Financial Mathematics.


Conference papers

  • Yevgeniy Dodis and Prashant Puniya,
    "Getting the Best Out of Existing Hash Functions or What if We Are Stuck with SHA?",
    Applied Cryptography and Network Security (ACNS) Conference, June 2008.

  • Yevgeniy Dodis, Krzysztof Pietrzak and Prashant Puniya,
    "A New Mode of Operation for Block Ciphers and Length-Preserving MACs",
    Advances in Cryptology - EUROCRYPT, April 2008.

  • Yevgeniy Dodis and Prashant Puniya,
    "Feistel Networks made Public, and Applications",
    Advances in Cryptology - Eurocrypt, May 2007.

  • Yevgeniy Dodis and Prashant Puniya,
    "On the Relation between the Ideal Cipher and the Random Oracle Models",
    Theory of Cryptography Conference (TCC), March 2006.

  • Jean-Sebastian Coron, Yevgeniy Dodis, Cecile Malinaud and Prashant Puniya,
    "Merkle-Damgard Revisited : how to Construct a Hash Function",
    Advances in Cryptology - CRYPTO, August 2005.

    Workshop Papers

  • Jean-Sebastian Coron, Yevgeniy Dodis, Cecile Malinaud and Prashant Puniya,
    "A New Design Criteria for Hash-Functions",
    NIST Cryptographic Hash Workshop, November 2005

    Journal Papers

  • Narayan Rangaraj, Milind Sohoni, Prashant Puniya and Jugal Garg,
    "Rake Linking for Suburban Train Services",
    Opsearch - Journal of the Operational Research Society of India,vol. 43, no. 2, 2006


  • Exposure-Resilient Cryptography (non-credit)

  • Introduction to Cryptography, Topics in Cryptography, Elliptic Curve Cryptography and Cryptography and Imperfect Randomness.
  • Honors Theory of Computation, Honors Algorithms, Topics in Game Theory, Topics in Combinatorics and Random Graphs.
  • Derivative Securities, Stochastic Calculus and Capital Markets and Portfolio Theory
  • Computational Number Theory and Algebra, Linear Algebra, Independent Studies in Random Graphs and Fast Polynomial Arithmetic. free hit counter code