View my papers  according to publication  category
Thesis

Mridul Nandi
Computer Science,
The George Washington University
publication    CV      Crypto-Corner 
brief-bio      images   other links















  Thesis

My Research interest includes
1. e-voting and other cryptographic protocols,
2. leakage-resilent  cryptography,
3. indifferentiability or PRO,
4. improving PRF-bounds,
5. hardware implementation etc. 


Analyzing Hash Functions in Theoretical Perspective:
Papers:
Summary:
Pseudorandom oracle (PRO) is an equivalent term for Indifferentiability of hash function which informally means that it is indistinguishable from random oracle with a proper model of adversary. We know many modes of hash function which preserves the PRO property. We study PRO security for the popular designs JH, chop-MD, PGV, general domain extension or GDE etc.We also provide multicollision (many message collide to the same output) for a class of sequential domain extensions.


Pseudorandom Function and MAC Security Analysis
Papers:
Summary:
PRF is indistinguishable from a random function (random oracle in secret key mode). MAC has weaker property called unforgeability. We provide improved PRF securitybounds for popular constructions and we propose efficient and secure MAC too.


Universal One-Way Hash Function or UOWHF
Papers:
 Summary:
UOWHF is also popularly known as target collision resistant. It is defined for a hash family H(K,.). Adversary has to commit a message M and then given a random  key K  it has to find  M' different from M such that H(K,M) = H(K,M'). We have proposed different designs of UOWHF for arbitrary domain given small domain UOWHF (i.e. UOWHF-preserving domain extensions). Some of the designs are optimal in wide subclasses of designs. We study the UOWHF propoerty for PGV domain extensions.
I would like to thank all my coauthors for my research works.


View My Stats

Calcutta:

Click for Kolkata (Calcutta), India Forecast

Gaithersburg, MD, US

Click for Gaithersburg, MD Forecast