P
Prashant Puniya
Researcher at New York University
Publications - 10
Citations - 740
Prashant Puniya is an academic researcher from New York University. The author has contributed to research in topics: Hash function & SWIFFT. The author has an hindex of 6, co-authored 10 publications receiving 703 citations. Previous affiliations of Prashant Puniya include Courant Institute of Mathematical Sciences & Indian Institute of Technology Bombay.
Papers
More filters
Book ChapterDOI
Merkle-Damgård revisited: how to construct a hash function
TL;DR: It is shown that the current design principle behind hash functions such as SHA-1 and MD5 — the (strengthened) Merkle-Damgard transformation — does not satisfy a new security notion for hash-functions, stronger than collision-resistance.
Book ChapterDOI
A new mode of operation for block ciphers and length-preserving MACs
TL;DR: A new mode of operation, enciphered CBC, for domain extension of length-preserving functions (like block ciphers), which is a variation on the popular CBC mode ofoperation, and yields the first constant-rate Variable Input Length (VIL) MAC from any length preserving Fixed Input length (FIL) MAC.
Journal Article
On the relation between the ideal cipher and the random oracle models
Yevgeniy Dodis,Prashant Puniya +1 more
TL;DR: In this paper, it was shown that the Luby-Rackoff construction with a superlogarithmic number of rounds can be used to instantiate the ideal block cipher in any honest-but-curious cryptosystem.
Book ChapterDOI
Feistel Networks Made Public, and Applications
Yevgeniy Dodis,Prashant Puniya +1 more
TL;DR: A new combinatorial understanding of Feistel networks is developed, which makes them applicable to situations when the round functions are merely unpredictablerather than (pseudo)random and/or when the intermediate round values may be leaked to the adversary.
Book ChapterDOI
Getting the best out of existing hash functions; or what if we are stuck with SHA?
Yevgeniy Dodis,Prashant Puniya +1 more
TL;DR: A thorough treatment of how to soundly design a secure hash function H′ from a given cascade-based hash functions H for various cryptographic applications, such as collision-resistance, one-wayness, pseudorandomness, etc.