A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical
暂无分享,去创建一个
[1] Aggelos Kiayias,et al. Self Protecting Pirates and Black-Box Traitor Tracing , 2001, CRYPTO.
[2] Bruce Schneier. One-way hash functions , 1991 .
[3] Thomas Ristenpart,et al. How to Build a Hash Function from Any Collision-Resistant Function , 2007, ASIACRYPT.
[4] Kaoru Kurosawa,et al. Advances in Cryptology - ASIACRYPT 2007, 13th International Conference on the Theory and Application of Cryptology and Information Security, Kuching, Malaysia, December 2-6, 2007, Proceedings , 2007, International Conference on the Theory and Application of Cryptology and Information Security.
[5] Ran Canetti,et al. Universally Composable Security with Global Setup , 2007, TCC.
[6] Nigel P. Smart,et al. Advances in Cryptology - EUROCRYPT 2008, 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Istanbul, Turkey, April 13-17, 2008. Proceedings , 2008, EUROCRYPT.
[7] Ran Canetti,et al. The random oracle methodology, revisited , 2000, JACM.
[8] Yevgeniy Dodis,et al. Salvaging Merkle-Damgard for Practical Applications , 2009, IACR Cryptol. ePrint Arch..
[9] Jacques Stern,et al. RSA-OAEP Is Secure under the RSA Assumption , 2001, Journal of Cryptology.
[10] Ralph C. Merkle,et al. One Way Hash Functions and DES , 1989, CRYPTO.
[11] Phong Q. Nguyen. Progress in Cryptology - VIETCRYPT 2006 , 2007 .
[12] Serge Vaudenay,et al. Advances in Cryptology - EUROCRYPT 2006 , 2006, Lecture Notes in Computer Science.
[13] Rafael Pass,et al. On Deniability in the Common Reference String and Random Oracle Model , 2003, CRYPTO.
[14] Bart Preneel,et al. Seven-Property-Preserving Iterated Hashing: ROX , 2007, ASIACRYPT.
[15] Dan Boneh,et al. Advances in Cryptology - CRYPTO 2003 , 2003, Lecture Notes in Computer Science.
[16] Marc Fischlin,et al. Robust Multi-property Combiners for Hash Functions Revisited , 2008, ICALP.
[17] Ueli Maurer,et al. Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology , 2004, TCC.
[18] Alfredo De Santis,et al. Advances in Cryptology — EUROCRYPT'94 , 1994, Lecture Notes in Computer Science.
[19] Marc Fischlin,et al. Multi-property Preserving Combiners for Hash Functions , 2008, TCC.
[20] Mihir Bellare,et al. Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.
[21] Ivan Damgård,et al. A Design Principle for Hash Functions , 1989, CRYPTO.
[22] Ron Steinfeld,et al. VSH, an Efficient and Provable Collision Resistant Hash Function , 2006, IACR Cryptol. ePrint Arch..
[23] Michael Wiener,et al. Advances in Cryptology — CRYPTO’ 99 , 1999 .
[24] Mihir Bellare,et al. Optimal Asymmetric Encryption-How to Encrypt with RSA , 1995 .
[25] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[26] Mihir Bellare,et al. Multi-Property-Preserving Hash Domain Extension and the EMD Transform , 2006, ASIACRYPT.
[27] Ran Canetti,et al. The random oracle methodology, revisited , 2000, JACM.
[28] A. J. Menezes,et al. Advances in Cryptology - CRYPTO 2007, 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007, Proceedings , 2007, CRYPTO.
[29] Victor Shoup. Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14-18, 2005, Proceedings , 2005, CRYPTO.
[30] Kefei Chen,et al. Advances in Cryptology - ASIACRYPT 2006, 12th International Conference on the Theory and Application of Cryptology and Information Security, Shanghai, China, December 3-7, 2006, Proceedings , 2006, ASIACRYPT.
[31] Phillip Rogaway,et al. Formalizing Human Ignorance , 2006, VIETCRYPT.
[32] Ueli Maurer,et al. Domain Extension of Public Random Functions: Beyond the Birthday Barrier , 2007, CRYPTO.
[33] Guido Bertoni,et al. On the Indifferentiability of the Sponge Construction , 2008, EUROCRYPT.
[34] Jean-Sébastien Coron,et al. Merkle-Damgård Revisited: How to Construct a Hash Function , 2005, CRYPTO.
[35] Mihir Bellare,et al. Optimal Asymmetric Encryption , 1994, EUROCRYPT.
[36] Chris Peikert,et al. SWIFFT: A Modest Proposal for FFT Hashing , 2008, FSE.
[37] Thomas Shrimpton,et al. Building a Collision-Resistant Compression Function from Non-compressing Primitives , 2008, ICALP.
[38] Ueli Maurer,et al. Advances in Cryptology — EUROCRYPT ’96 , 2001, Lecture Notes in Computer Science.
[39] Shai Halevi,et al. A Tweakable Enciphering Mode , 2003, CRYPTO.
[40] Gerhard Goos,et al. Fast Software Encryption , 2001, Lecture Notes in Computer Science.
[41] Mihir Bellare,et al. The Exact Security of Digital Signatures - HOw to Sign with RSA and Rabin , 1996, EUROCRYPT.