 |
| Mridul
Nandi Applied Staistics Unit, Indian Statistical Institute 203 B. T. Road Kolkata 700124 Phone: +91 33 2575-2815 (office) email: mridul at isical dot ac dot in Find me at Google DBLP Homepage www.isical.ac.in/~mridul publication CV brief-Bio |
My Papers
View my papers according to (1) Publication or (2) Category. Find my Thesis.<< back to home page
| Analyzing Hash Functions in Theoretical
Perspective: |
|
|---|---|
| Papers: | FSE-10, FSE-08 FSE-05 Asiacrypt-06 Indocrpyt-09 Indocrypt-06 Indocrypt-05 |
| 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: | JMC-09, JMC-08 FSE-10 FSE-09 Indocrpyt-08 Indocrypt-06
|
| 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. |
| Security Analysis of Different Modes of
Operations of Encryption: |
|
|---|---|
| Papers: | CyS-08, FSE-08 Indocrypt-08 |
| Summary: |
Designing wide block cipher from a traditional
blockcipher is popularly knmown as modes of opeartions. We provide
improved security analysis of HCTR and propose a generic method to
obtain a modes of operation. We also study security of online cipher
HCBC and proposed modified HCBC which are more efficient. |
| Universal One-Way Hash Function or UOWHF |
|
|---|---|
| Papers: | SAC-04, Asiacrypt-03 ACISP-04 IEICE-05 IEICE-05 |
| 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. |