Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Mridul Nandi
2010 – today
- 2012
[e1]Steven D. Galbraith, Mridul Nandi (Eds.): Progress in Cryptology - INDOCRYPT 2012, 13th International Conference on Cryptology in India, Kolkata, India, December 9-12, 2012. Proceedings. Lecture Notes in Computer Science 7668, Springer 2012, ISBN 978-3-642-34930-0- 2011
[c21]Donghoon Chang, Mridul Nandi, Moti Yung: On the Security of Hash Functions Employing Blockcipher Postprocessing. FSE 2011: 146-166
[c20]David Chaum, Alex Florescu, Mridul Nandi, Stefan Popoveniuc, Jan Rubio, Poorvi L. Vora, Filip Zagórski: Paperless Independently-Verifiable Voting. VOTE-ID 2011: 140-157
[i24]Donghoon Chang, Mridul Nandi, Moti Yung: Indifferentiability of the Hash Algorithm BLAKE. IACR Cryptology ePrint Archive 2011: 623 (2011)- 2010
[c19]Rishiraj Bhattacharyya, Avradip Mandal, Mridul Nandi: Security Analysis of the Mode of JH Hash Function. FSE 2010: 168-191
[c18]Mridul Nandi: A Unified Method for Improving PRF Bounds for a Class of Blockcipher Based MACs. FSE 2010: 212-229
[c17]Mridul Nandi, Stefan Popoveniuc, Poorvi L. Vora: Stamp-It: A Method for Enhancing the Universal Verifiability of E2E Voting Systems. ICISS 2010: 81-95
[c16]Mridul Nandi: The Characterization of Luby-Rackoff and Its Optimum Single-Key Variants. INDOCRYPT 2010: 82-97
[c15]Mridul Nandi, Souradyuti Paul: Speeding Up the Wide-Pipe: Secure and Fast Hashing. INDOCRYPT 2010: 144-162
[i23]Mridul Nandi: A Unified Method for Improving PRF Bounds for a Class of Blockcipher based MACs. IACR Cryptology ePrint Archive 2010: 14 (2010)
[i22]Mridul Nandi, Souradyuti Paul: Speeding Up The Widepipe: Secure and Fast Hashing. IACR Cryptology ePrint Archive 2010: 193 (2010)
[i21]Donghoon Chang, Mridul Nandi, Moti Yung: On the Security of Hash Functions Employing Blockcipher Postprocessing. IACR Cryptology ePrint Archive 2010: 629 (2010)
2000 – 2009
- 2009
[j7]Mridul Nandi: A Generic Method to Extend Message Space of a Strong Pseudorandom Permutation. Computación y Sistemas 12(3) (2009)
[j6]Mridul Nandi: Improved security analysis for OMAC as a pseudorandom function. J. Mathematical Cryptology 3(2): 133-148 (2009)
[c14]Mridul Nandi: Characterizing Padding Rules of MD Hash Functions Preserving Collision Security. ACISP 2009: 171-184
[c13]
[c12]Rishiraj Bhattacharyya, Avradip Mandal, Mridul Nandi: Indifferentiability Characterization of Hash Functions and Optimal Bounds of Popular Domain Extensions. INDOCRYPT 2009: 199-218
[i20]Mridul Nandi: Characterizing Padding Rules of MD Hash Functions Preserving Collision Security. IACR Cryptology ePrint Archive 2009: 325 (2009)- 2008
[j5]Donghoon Chang, Mridul Nandi, Jesang Lee, Jaechul Sung, Seokhie Hong, Jongin Lim, Haeryong Park, Kilsoo Chun: Compression Function Design Principles Supporting Variable Output Lengths from a Single Small Function. IEICE Transactions 91-A(9): 2607-2614 (2008)
[j4]Mridul Nandi, Avradip Mandal: Improved security analysis of PMAC. J. Mathematical Cryptology 2(2): 149-162 (2008)
[c11]
[c10]Donghoon Chang, Mridul Nandi: Improved Indifferentiability Security Analysis of chopMD Hash Function. FSE 2008: 429-443
[c9]
[i19]Donghoon Chang, Mridul Nandi: A Short Proof of the PRP/PRF Switching Lemma. IACR Cryptology ePrint Archive 2008: 78 (2008)
[i18]Mridul Nandi: Improving upon HCTR and matching attacks for Hash-Counter-Hash approach. IACR Cryptology ePrint Archive 2008: 90 (2008)
[i17]Mridul Nandi: A Generic Method to Extend Message Space of a Strong Pseudorandom Permutation. IACR Cryptology ePrint Archive 2008: 91 (2008)
[i16]Mridul Nandi: An Efficient SPRP-secure Construction based on Pseudo Random Involution. IACR Cryptology ePrint Archive 2008: 92 (2008)
[i15]Mridul Nandi: Two New Efficient CCA-Secure Online Ciphers: MHCBC and MCBC. IACR Cryptology ePrint Archive 2008: 401 (2008)- 2007
[j3]Mridul Nandi, Douglas R. Stinson: Multicollision Attacks on Some Generalized Sequential Hash Functions. IEEE Transactions on Information Theory 53(2): 759-767 (2007)
[i14]Mridul Nandi, Avradip Mandal: Improved Security Analysis of PMAC. IACR Cryptology ePrint Archive 2007: 31 (2007)
[i13]Avradip Mandal, Mridul Nandi: An improved collision probability for CBC-MAC and PMAC. IACR Cryptology ePrint Archive 2007: 32 (2007)
[i12]Mridul Nandi: A Simple Security Analysis of Hash-CBC and a New Efficient One-Key Online Cipher. IACR Cryptology ePrint Archive 2007: 158 (2007)
[i11]
[i10]Donghoon Chang, Mridul Nandi, Jesang Lee, Jaechul Sung, Seokhie Hong: Compression Function Design Principles Supporting Variable Output Lengths from a Single Small Function. IACR Cryptology ePrint Archive 2007: 416 (2007)- 2006
[c8]Donghoon Chang, Sangjin Lee, Mridul Nandi, Moti Yung: Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding. ASIACRYPT 2006: 283-298
[c7]Donghoon Chang, Kishan Chand Gupta, Mridul Nandi: RC4-Hash: A New Hash Function Based on RC4. INDOCRYPT 2006: 80-94
[c6]
[i9]Mridul Nandi, Douglas R. Stinson: Multicollision Attacks on some Generalized Sequential Hash Functions. IACR Cryptology ePrint Archive 2006: 55 (2006)
[i8]Mridul Nandi: A Simple and Unified Method of Proving Unpredictability. IACR Cryptology ePrint Archive 2006: 264 (2006)
[i7]Donghoon Chang, Mridul Nandi: General Distinguishing Attacks on NMAC and HMAC with Birthday Attack Complexity. IACR Cryptology ePrint Archive 2006: 441 (2006)- 2005
[j2]Wonil Lee, Mridul Nandi, Palash Sarkar, Donghoon Chang, Sangjin Lee, Kouichi Sakurai: PGV-Style Block-Cipher-Based Hash Families and Black-Box Analysis. IEICE Transactions 88-A(1): 39-48 (2005)
[j1]Wonil Lee, Donghoon Chang, Sangjin Lee, Soo Hak Sung, Mridul Nandi: Construction of UOWHF: Two New Parallel Methods. IEICE Transactions 88-A(1): 49-58 (2005)
[c5]Mridul Nandi, Wonil Lee, Kouichi Sakurai, Sangjin Lee: Security Analysis of a 2/3-Rate Double Length Compression Function in the Black-Box Model. FSE 2005: 243-254
[c4]- 2004
[c3]Wonil Lee, Mridul Nandi, Palash Sarkar, Donghoon Chang, Sangjin Lee, Kouichi Sakurai: Pseudorandomness of SPN-Type Transformations. ACISP 2004: 212-223
[c2]Mridul Nandi: A Sufficient Condition for Optimal Domain Extension of UOWHFs. Selected Areas in Cryptography 2004: 341-354
[i6]Wonil Lee, Mridul Nandi, Palash Sarkar, Donghoon Chang, Sangjin Lee, Kouichi Sakurai: A Generalization of PGV-Hash Functions and Security Analysis in Black-Box Model. IACR Cryptology ePrint Archive 2004: 69 (2004)
[i5]Mridul Nandi: Designs of Efficient Secure Large Hash Values. IACR Cryptology ePrint Archive 2004: 296 (2004)
[i4]Mridul Nandi, Wonil Lee, Kouichi Sakurai, Sangjin Lee: Security Analysis of a 2/3-rate Double Length Compression Function in Black-Box Model. IACR Cryptology ePrint Archive 2004: 328 (2004)
[i3]Mridul Nandi, Douglas R. Stinson: Multicollision Attacks on Generalized Hash Functions. IACR Cryptology ePrint Archive 2004: 330 (2004)- 2003
[c1]Wonil Lee, Donghoon Chang, Sangjin Lee, Soo Hak Sung, Mridul Nandi: New Parallel Domain Extenders for UOWHF. ASIACRYPT 2003: 208-227
[i2]Mridul Nandi: A New Tree based Domain Extension of UOWHF. IACR Cryptology ePrint Archive 2003: 142 (2003)
[i1]Mridul Nandi: A Sufficient Condition and Optimal Domain Extension of UOWHF. IACR Cryptology ePrint Archive 2003: 158 (2003)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-11 18:40 CEST by the dblp team



