Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding
暂无分享,去创建一个
Moti Yung | Donghoon Chang | Sangjin Lee | Mridul Nandi | M. Yung | Sangjin Lee | D. Chang | M. Nandi
[1] Joe Kilian,et al. How to Protect DES Against Exhaustive Key Search , 1996, CRYPTO.
[2] Joos Vandewalle,et al. Collision-free hashfunctions based on blockcipher algorithms , 1989, Proceedings. International Carnahan Conference on Security Technology.
[3] Yishay Mansour,et al. A construction of a cipher from a single pseudorandom permutation , 1997, Journal of Cryptology.
[4] Bruce Schneier. One-way hash functions , 1991 .
[5] Robert S. Winternitz. A Secure One-Way Hash Function Built from DES , 1984, 1984 IEEE Symposium on Security and Privacy.
[6] Joos Vandewalle,et al. Hash Functions Based on Block Ciphers: A Synthetic Approach , 1993, CRYPTO.
[7] Stefan Lucks,et al. A Failure-Friendly Design Principle for Hash Functions , 2005, ASIACRYPT.
[8] Jennifer Seberry,et al. LOKI - A Cryptographic Primitive for Authentication and Secrecy Applications , 1990, AUSCRYPT.
[9] Yishay Mansour,et al. A Construction of a Cioher From a Single Pseudorandom Permutation , 1991, ASIACRYPT.
[10] Shoichi Hirose,et al. Some Plausible Constructions of Double-Block-Length Hash Functions , 2006, FSE.
[11] Ueli Maurer,et al. Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology , 2004, TCC.
[12] Jean-Sébastien Coron,et al. Merkle-Damgård Revisited: How to Construct a Hash Function , 2005, CRYPTO.
[13] Jean-Jacques Quisquater,et al. 2n-Bit Hash-Functions Using n-Bit Symmetric Block Cipher Algorithms , 1990, EUROCRYPT.
[14] Ralph C. Merkle,et al. One Way Hash Functions and DES , 1989, CRYPTO.
[15] Ivan Damgård,et al. A Design Principle for Hash Functions , 1989, CRYPTO.
[16] Claude E. Shannon,et al. Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..
[17] Shoichi Hirose. Provably Secure Double-Block-Length Hash Functions in a Black-Box Model , 2004, ICISC.
[18] Mihir Bellare,et al. Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.
[19] Mridul Nandi. Towards Optimal Double-Length Hash Functions , 2005, INDOCRYPT.
[20] John Black,et al. Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV , 2002, CRYPTO.