Mridul Nandi

IACR Trans. Symmetric Cryptol., 2017

On The Exact Security of Message Authentication Using Pseudorandom Functions.

[BibT_eX]

[DOI]

IACR Trans. Symmetric Cryptol., 2017

Tight Security Analysis of EHtM MAC.

[BibT_eX]

[DOI]

IACR Trans. Symmetric Cryptol., 2017

Understanding RUP Integrity of COLM.

[BibT_eX]

[DOI]

IACR Trans. Symmetric Cryptol., 2017

Single Key Variant of PMAC_Plus.

[BibT_eX]

[DOI]

IACR Trans. Symmetric Cryptol., 2017

Turning Online Ciphers Off.

[BibT_eX]

[DOI]

IACR Trans. Symmetric Cryptol., 2017

A New Look at Counters: Don't Run Like Marathon in a Hundred Meter Race.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2017

Two Efficient Fault-Based Attacks on CLOC and SILC.

[BibT_eX]

[DOI]

J. Hardw. Syst. Secur., 2017

Birthday Attack on Dual EWCDM.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

XHX - A Framework for Optimally Secure Tweakable Block Ciphers from Classical Block Ciphers and Universal Hashing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Improved Security for OCB3.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

The Iterated Random Function Problem.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Balanced Permutations Even-Mansour Ciphers.

[BibT_eX]

[DOI]

Shoni Gilboa

Shay Gueron

Cryptogr., 2017

Practical Fault Attacks on Minalpher: How to Recover Key with Minimum Faults?

[BibT_eX]

[DOI]

Avik Chakraborti

Proceedings of the Security, Privacy, and Applied Cryptography Engineering, 2017

2016

OleF: an Inverse-Free Online Cipher. An Online SPRP with an Optimal Inverse-Free Construction.

[BibT_eX]

[DOI]

IACR Trans. Symmetric Cryptol., 2016

ELmD: A Pipelineable Authenticated Encryption and Its Hardware Implementation.

[BibT_eX]

[DOI]

Lilian Bossuet

Cuauhtemoc Mancillas-López

IEEE Trans. Computers, 2016

On the security of joint signature and encryption revisited.

[BibT_eX]

[DOI]

Tapas Pandit

J. Math. Cryptol., 2016

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

[BibT_eX]

[DOI]

J. Math. Cryptol., 2016

Revisiting Full-PRF-Secure PMAC and Using It for Beyond-Birthday Authenticated Encryption.

[BibT_eX]

[DOI]

Eik List

IACR Cryptol. ePrint Arch., 2016

Revisiting Structure Graph and Its Applications to CBC-MAC and EMAC.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Exact Security Analysis of Hash-then-Mask Type Probabilistic MAC Constructions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

OleF: An Inverse-Free Online Cipher.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Fault Based Almost Universal Forgeries on CLOC and SILC.

[BibT_eX]

[DOI]

Proceedings of the Security, Privacy, and Applied Cryptography Engineering, 2016

INT-RUP Analysis of Block-cipher Based Authenticated Encryption Schemes.

[BibT_eX]

[DOI]

Avik Chakraborti

Proceedings of the Topics in Cryptology - CT-RSA 2016 - The Cryptographers' Track at the RSA Conference 2016, San Francisco, CA, USA, February 29, 2016

One-Key Compression Function Based MAC with Security Beyond Birthday Bound.

[BibT_eX]

[DOI]

Goutam Paul

Proceedings of the Information Security and Privacy - 21st Australasian Conference, 2016

2015

Attacks on the Authenticated Encryption Mode of Operation PAE.

[BibT_eX]

[DOI]

Debrup Chakraborty

IEEE Trans. Inf. Theory, 2015

On the Power of Pair Encodings: Frameworks for Predicate Cryptographic Primitives.

[BibT_eX]

[DOI]

Tapas Pandit

IACR Cryptol. ePrint Arch., 2015

Generic Conversions from CPA to CCA secure Functional Encryption.

[BibT_eX]

[DOI]

Tapas Pandit

IACR Cryptol. ePrint Arch., 2015

A Simple Proof of a Distinguishing Bound of Iterated Uniform Random Permutation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

XLS is not a Strong Pseudorandom Permutation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Revisiting Security Claims of XLS and COPA.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

On the Optimality of Non-Linear Computations of Length-Preserving Encryption Schemes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Some Cryptanalytic Results on Zipper Hash and Concatenated Hash.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

TriviA: A Fast and Secure Authenticated Encryption Scheme.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

An Inverse-free Single-Keyed Tweakable Enciphering Scheme.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Revisiting Turning Online Cipher Off.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

2014

Forging Attacks on two Authenticated Encryptions COBRA and POET.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Characterization of EME with Linear Mixing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Equivalence between MAC, WCR and PRF for Blockcipher Based Constructions.

[BibT_eX]

[DOI]

Proceedings of the Provable Security - 8th International Conference, 2014

On the Minimum Number of Multiplications Necessary for Universal Hash Functions.

[BibT_eX]

[DOI]

Proceedings of the Fast Software Encryption - 21st International Workshop, 2014

Forging Attacks on Two Authenticated Encryption Schemes COBRA and POET.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

ELmE: A Misuse Resistant Parallel Authenticated Encryption.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Privacy - 19th Australasian Conference, 2014

2013

On the Minimum Number of Multiplications Necessary for Universal Hash Constructions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Misuse Resistant Parallel Authenticated Encryptions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Equivalence between MAC and PRF for Blockcipher based Constructions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Joux multicollisions attack in sponge construction.

[BibT_eX]

[DOI]

Mohammad A. AlAhmad

Imad Fakhri Alshaikhli

Proceedings of the 6th International Conference on Security of Information and Networks, 2013

2011

Indifferentiability of the Hash Algorithm BLAKE.

[BibT_eX]

[DOI]

Moti Yung

IACR Cryptol. ePrint Arch., 2011

Paperless Independently-Verifiable Voting.

[BibT_eX]

[DOI]

Proceedings of the E-Voting and Identity - Third International Conference, 2011

2010

Speeding Up The Widepipe: Secure and Fast Hashing.

[BibT_eX]

[DOI]

Souradyuti Paul

IACR Cryptol. ePrint Arch., 2010

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

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

On the Security of Hash Functions Employing Blockcipher Postprocessing.

[BibT_eX]

[DOI]

Moti Yung

IACR Cryptol. ePrint Arch., 2010

Speeding Up the Wide-Pipe: Secure and Fast Hashing.

[BibT_eX]

[DOI]

Souradyuti Paul

Proceedings of the Progress in Cryptology - INDOCRYPT 2010, 2010

The Characterization of Luby-Rackoff and Its Optimum Single-Key Variants.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology - INDOCRYPT 2010, 2010

Stamp-It: A Method for Enhancing the Universal Verifiability of E2E Voting Systems.

[BibT_eX]

[DOI]

Stefan Popoveniuc

Poorvi L. Vora

Proceedings of the Information Systems Security - 6th International Conference, 2010

Security Analysis of the Mode of JH Hash Function.

[BibT_eX]

[DOI]

Rishiraj Bhattacharyya

Proceedings of the Fast Software Encryption, 17th International Workshop, 2010

2009

Improved security analysis for OMAC as a pseudorandom function.

[BibT_eX]

[DOI]

J. Math. Cryptol., 2009

Characterizing Padding Rules of MD Hash Functions Preserving Collision Security.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

A Generic Method to Extend Message Space of a Strong Pseudorandom Permutation.

[BibT_eX]

[DOI]

Computación y Sistemas, 2009

Indifferentiability Characterization of Hash Functions and Optimal Bounds of Popular Domain Extensions.

[BibT_eX]

[DOI]

Rishiraj Bhattacharyya

Proceedings of the Progress in Cryptology, 2009

Fast and Secure CBC-Type MAC Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Fast Software Encryption, 16th International Workshop, 2009

2008

Improved security analysis of PMAC.

[BibT_eX]

[DOI]

J. Math. Cryptol., 2008

Compression Function Design Principles Supporting Variable Output Lengths from a Single Small Function.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

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

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

An Efficient SPRP-secure Construction based on Pseudo Random Involution.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Improving upon HCTR and matching attacks for Hash-Counter-Hash approach.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

A Short Proof of the PRP/PRF Switching Lemma.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Improved Indifferentiability Security Analysis of chopMD Hash Function.

[BibT_eX]

[DOI]

Proceedings of the Fast Software Encryption, 15th International Workshop, 2008

An Improved Security Bound for HCTR.

[BibT_eX]

[DOI]

Debrup Chakraborty

Proceedings of the Fast Software Encryption, 15th International Workshop, 2008

2007

Multicollision Attacks on Some Generalized Sequential Hash Functions.

[BibT_eX]

[DOI]

Douglas R. Stinson

IEEE Trans. Inf. Theory, 2007

Improved security analysis of OMAC.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

A Simple Security Analysis of Hash-CBC and a New Efficient One-Key Online Cipher.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

An improved collision probability for CBC-MAC and PMAC.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

Compression Function Design Principles Supporting Variable Output Lengths from a Single Small Function.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

2006

A Simple and Unified Method of Proving Unpredictability.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2006

General Distinguishing Attacks on NMAC and HMAC with Birthday Attack Complexity.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2006

A Simple and Unified Method of Proving Indistinguishability.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology, 2006

RC4-Hash: A New Hash Function Based on RC4.

[BibT_eX]

[DOI]

Kishan Chand Gupta

Proceedings of the Progress in Cryptology, 2006

Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2006

2005

PGV-Style Block-Cipher-Based Hash Families and Black-Box Analysis.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

Construction of UOWHF: Two New Parallel Methods.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

Towards Optimal Double-Length Hash Functions.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology, 2005

Security Analysis of a 2/3-Rate Double Length Compression Function in the Black-Box Model.

[BibT_eX]

[DOI]

Proceedings of the Fast Software Encryption: 12th International Workshop, 2005

2004

Multicollision Attacks on Generalized Hash Functions.

[BibT_eX]

[DOI]

Douglas R. Stinson

IACR Cryptol. ePrint Arch., 2004

Designs of Efficient Secure Large Hash Values.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2004

A Generalization of PGV-Hash Functions and Security Analysis in Black-Box Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2004

A Sufficient Condition for Optimal Domain Extension of UOWHFs.

[BibT_eX]

[DOI]

Proceedings of the Selected Areas in Cryptography, 11th International Workshop, 2004

Pseudorandomness of SPN-Type Transformations.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Privacy: 9th Australasian Conference, 2004

2003

A Sufficient Condition and Optimal Domain Extension of UOWHF.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2003

A New Tree based Domain Extension of UOWHF.

[BibT_eX]

[DOI]