Search

Your search keyword '"Nandi, Mridul"' showing total 9 results
Start Over Author "Nandi, Mridul" Topic random permutation

Refine your results

more »

9 results on '"Nandi, Mridul"'

1. Luby-Rackoff Backwards with More Users and More Security

Author

Bhattacharya, Srimanta, Nandi, Mridul, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Tibouchi, Mehdi, editor, and Wang, Huaxiong, editor

Published
2021
Full Text
View/download PDF

2. Full Indifferentiable Security of the Xor of Two or More Random Permutations Using the Method

Author

Bhattacharya, Srimanta, Nandi, Mridul, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Nielsen, Jesper Buus, editor, and Rijmen, Vincent, editor

Published
2018
Full Text
View/download PDF

4. Revisiting structure graphs: Applications to CBC-MAC and EMAC

Author

Jha Ashwin and Nandi Mridul

Subjects
cbc, emac, structure graph, random permutation, pseudorandom function, 94a60, 68r05, 68r10, 68q87, Mathematics, QA1-939
Abstract

In [2], Bellare, Pietrzak and Rogaway proved an O⁢(ℓ⁢q2/2n)${O(\ell q^{2}/2^{n})}$ bound for the PRF (pseudorandom function) security of the CBC-MAC based on an n-bit random permutation Π, provided ℓ

Published
2016
Full Text
View/download PDF

5. A Unified Method for Improving PRF Bounds for a Class of Blockcipher Based MACs

Author

Nandi, Mridul, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Hong, Seokhie, editor, and Iwata, Tetsu, editor

Published
2010
Full Text
View/download PDF

6. Security Analysis of the Mode of JH Hash Function

Author

Bhattacharyya, Rishiraj, Mandal, Avradip, Nandi, Mridul, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Hong, Seokhie, editor, and Iwata, Tetsu, editor

Published
2010
Full Text
View/download PDF

7. Two New Efficient CCA-Secure Online Ciphers: MHCBC and MCBC

Author

Nandi, Mridul, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Chowdhury, Dipanwita Roy, editor, Rijmen, Vincent, editor, and Das, Abhijit, editor

Published
2008
Full Text
View/download PDF

8. Improved security analysis for OMAC as a pseudorandom function

Author

Nandi Mridul

Subjects
mac, pmac, distinguishing attack, pseudorandom function, random permutation, Mathematics, QA1-939
Abstract

This paper shows that the advantage of any q-query adversary (which makes at most q queries) for distinguishing OMAC from a uniform random function is roughly Lq2/2n. Here L is the number of blocks of the longest query and n is the output size of the uniform random function. The so far best bound is roughly σ2/2n = O(L2q2/2n) and hence our new bound is an improved bound. Our improved security analysis also works for OMAC1 and CMAC which has been recommended by NIST as a candidate of blockcipher based MAC.

Published
2009
Full Text
View/download PDF

9. Improved security analysis of PMAC

Author

Nandi Mridul and Mandal Avradip

Subjects
mac, pmac, distinguishing attack, pseudorandom function, random permutation, Mathematics, QA1-939
Abstract

In this paper we provide a simple, concrete and improved security analysis of Parallelizable Message Authentication Code or PMAC. In particular, we show that the advantage of any distinguisher at distinguishing PMAC from a random function is at most (5qσ – 3.5q2)/2n. Here, σ is the total number of message blocks in all q queries made by and PMAC is based on a random permutation over {0, 1}n. In the original paper of PMAC by Black and Rogaway in Eurocrypt-2002, the bound was shown to be (σ + 1)2/2n–1. In FSE-2007, Minematsu and Matsushima provided a bound 5ℓq2/(2n – 2ℓ), where ℓ is the number of blocks of the longest queried made by the distinguisher. Our proposed bound is sharper than these two previous bounds.

Published
2008
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results