Bibliography

Major publications by the team in recent years

[1]

M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, H. Shi.
Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions, in: Journal of Cryptology, July 2008, vol. 21, n^o 3, p. 350–391.

[2]

B. Blanchet, D. Pointcheval.
Automated Security Proofs with Sequences of Games, in: Advances in Cryptology – Proceedings of CRYPTO '06, Lecture Notes in Computer Science, Springer, 2006, vol. 4117, p. 538–554.

[3]

D. Catalano, D. Pointcheval, T. Pornin.
Trapdoor-Hard-to-Invert Isomorphism and their Application to Password-based Authentication, in: Journal of Cryptology, 2007, vol. 20, n^o 1, p. 115–149.

[4]

C. Delerablée, D. Pointcheval.
Dynamic Threshold Public-Key Encryption, in: Advances in Cryptology – Proceedings of CRYPTO '08, Lecture Notes in Computer Science, Springer, 2008, vol. 5157, p. 317–334.

[5]

V. Dubois, P.-A. Fouque, A. Shamir, J. Stern.
Practical Cryptanalysis of SFLASH, in: Advances in Cryptology – Proceedings of CRYPTO '07, Lecture Notes in Computer Science, Springer, 2007, vol. 4622, p. 1–12.

[6]

P.-A. Fouque, G. Leurent, P. Q. Nguyen.
Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5, in: Advances in Cryptology – Proceedings of CRYPTO '07, Lecture Notes in Computer Science, Springer, 2007, vol. 4622, p. 13–30.

[7]

P.-A. Fouque, G. Macario-Rat, J. Stern.
Key Recovery on Hidden Monomial Multivariate Schemes, in: Advances in Cryptology – Proceedings of EUROCRYPT '08, Lecture Notes in Computer Science, Springer, 2008, vol. 4965, p. 19–30.

[8]

E. Fujisaki, T. Okamoto, D. Pointcheval, J. Stern.
RSA–OAEP is Secure under the RSA Assumption, in: Journal of Cryptology, 2004, vol. 17, n^o 2, p. 81–104.

[9]

N. Gama, P. Q. Nguyen.
Finding Short Lattice Vectors within Mordell's Inequality, in: Proc. 40th ACM Symposium on the Theory of Computing (STOC '08), ACM, 2008, p. 207–216.

[10]

D. Naccache, N. Smart, J. Stern.
Projective Coordinates Leak, in: Advances in Cryptology – Proceedings of EUROCRYPT '04, Lecture Notes in Computer Science, Springer, 2004, vol. 3027, p. 257–267.

[11]

P. Q. Nguyen, O. Regev.
Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures, in: Advances in Cryptology – Proceedings of EUROCRYPT '06, Lecture Notes in Computer Science, Springer, 2006, vol. 4004, p. 215–233.

[12]

P. Q. Nguyen, D. Stehlé.
LLL on the Average, in: Proceedings of the 7th International Algorithmic Number Theory Symposium (ANTS-VII), Lecture Notes in Computer Science, Springer, 2006, vol. 4076, p. 238–256.

Publications of the year

Articles in International Peer-Reviewed Journal

[13]

M. Abdalla, J. H. An, M. Bellare, C. Namprempre.
From Identification to Signatures via the Fiat-Shamir Transform: Necessary and Sufficient Conditions for Security and Forward-Security, in: IEEE Transactions on Information Theory, August 2008, vol. 54, n^o 8, p. 3631–3646.

[14]

M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, H. Shi.
Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions, in: Journal of Cryptology, July 2008, vol. 21, n^o 3, p. 350–391.

[15]

M. Abdalla, E. Kiltz, G. Neven.
Generalized Key Delegation for Hierarchical Identity-Based Encryption, in: IET Information Security, September 2008, vol. 2, n^o 3, p. 67–78.

[16]

T. Claveirole, M. Dias de Amorim, M. Abdalla, Y. Viniotis.
Securing Wireless Sensor Networks Against Aggregator Compromises, in: IEEE Communications Magazine, April 2008, vol. 46, n^o 4, p. 134–141.

[17]

D. Coppersmith, J.-S. Coron, F. Grieu, S. Halevi, C. S. Jutla, D. Naccache, J. P. Stern.
Cryptanalysis of ISO/IEC 9796-1, in: Journal of Cryptology, 2008, vol. 21, n^o 1, p. 27–51.

[18]

O. Dunkelman, N. Keller.
Treatment of the Initial Value in Time-Memory-Data Tradeoff Attacks on Stream Ciphers, in: Information Processing Letters, 2008, vol. 107, n^o 5, p. 133–137.

[19]

G. Leurent.
Practical key-recovery attack against APOP, an MD5-based challenge-response authentication, in: International Journal of Applied Cryptography, 2008, vol. 1, n^o 1, p. 32–46.

[20]

P. Q. Nguyen, O. Regev.
Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures, in: J. of Cryptology, Published online: 11 November 2008. Printed version to appear, 2008.

[21]

P. Q. Nguyen, D. Stehlé.
Low-Dimensional Lattice Basis Reduction Revisited, in: ACM Transactions on Algorithms, To appear, 2008.

[22]

P. Q. Nguyen, T. Vidick.
Sieve Algorithms for the Shortest Vector Problem are Practical, in: J. of Mathematical Cryptology, 2008, vol. 2, n^o 2.

[23]

D. Vergnaud.
Mesure d'indépendance linéaire de carrés de périodes et quasi-périodes de courbes elliptiques., in: J. Number Theory, To appear, 2008.

[24]

D. Vergnaud.
New Extensions of Pairing-based Signatures into Universal (Multi) Designated Verifier Signatures., in: Int. J. Found. Comput. Sci., To appear, 2008.

International Peer-Reviewed Conference/Proceedings

[25]

M. Abdalla, D. Catalano, C. Chevalier, D. Pointcheval.
Efficient Two-Party Password-Based Key Exchange Protocols in the UC Framework, in: The Cryptographers' Track at RSA Conference '08 (CT-RSA '08), Lecture Notes in Computer Science, Springer, 2008, vol. 4964, p. 335–351.

[26]

M. Abdalla, M. Izabachène, D. Pointcheval.
Anonymous and Transparent Gateway-based Password-Authenticated Key Exchange, in: The 7th International Conference on Cryptology and Network Security (CANS '08), Lecture Notes in Computer Science, Springer, 2008, vol. 5339, p. 133–148.

[27]

E. Andreeva, C. Bouillaguet, P.-A. Fouque, J. J. Hoch, J. Kelsey, A. Shamir, S. Zimmer.
Second Preimage Attacks on Dithered Hash Functions, in: Advances in Cryptology – Proceedings of EUROCRYPT '08, Lecture Notes in Computer Science, Springer, 2008, vol. 4965, p. 270–288.

[28]

C. Bouillaguet, P.-A. Fouque.
Analysis of the Collision Resistance of Radiogatun using Algebraic Techniques, in: Selected Area in Cryptography '08 (SAC '08), Lecture Notes in Computer Science, Springer, 2008, - p.

[29]

E. Bresson, J. Monnerat, D. Vergnaud.
Separation Results on the "One-More" Computational Problems, in: Topics in Cryptology - CT-RSA 2008, The Cryptographers' Track at the RSA Conference 2008, San Francisco, CA, USA, April 8-11, 2008. Proceedings, T. Malkin (editor), Lecture Notes in Computer Science, Springer, 2008, vol. 4964, p. 71-87.

[30]

C. De Cannière, Ö. Küçük, B. Preneel.
Analysis of Grain's Initialization Algorithm, in: Proceedings of AFRICACRYPT '08, Lecture Notes in Computer Science, Springer, 2008, vol. 5023, p. 276–289.

[31]

C. De Cannière, C. Rechberger.
Preimages for Reduced SHA-0 and SHA-1, in: Advances in Cryptology – Proceedings of CRYPTO '08, Lecture Notes in Computer Science, Springer, 2008, vol. 5157, p. 179–202.

[32]

C. Delerablée, D. Pointcheval.
Dynamic Threshold Public-Key Encryption, in: Advances in Cryptology – Proceedings of CRYPTO '08, Lecture Notes in Computer Science, Springer, 2008, vol. 5157, p. 317–334.

[33]

O. Dunkelman, N. Keller.
A New Attack on the LEX Stream Cipher, in: Advances in Cryptology – Proceedings of ASIACRYPT '08, Lecture Notes in Computer Science, springer, 2008.

[34]

O. Dunkelman, N. Keller.
An Improved Impossible Differential Attack on MISTY1, in: Advances in Cryptology – Proceedings of ASIACRYPT '08, Lecture Notes in Computer Science, springer, 2008.

[35]

P.-A. Fouque, G. Leurent.
Cryptanalysis of a Hash Function Based on Quasi-cyclic Codes, in: The Cryptographers' Track at RSA Conference '08 (CT-RSA '08), Lecture Notes in Computer Science, Springer, 2008, vol. 4964, p. 19–35.

[36]

P.-A. Fouque, G. Macario-Rat, L. Perret, J. Stern.
Total Break of the l-IC Signature Scheme, in: Conference on Practice and Theory in Public-Key Cryptography (PKC '08), Lecture Notes in Computer Science, Springer, 2008, vol. 4939, p. 1–17.

[37]

P.-A. Fouque, G. Macario-Rat, J. Stern.
Key Recovery on Hidden Monomial Multivariate Schemes, in: Advances in Cryptology – Proceedings of EUROCRYPT '08, Lecture Notes in Computer Science, Springer, 2008, vol. 4965, p. 19–30.

[38]

P.-A. Fouque, G. Martinet, F. Valette, S. Zimmer.
On the Security of the CCM Encryption Mode and of a Slight Variant, in: Conference on Applied Cryptography and Network Security (ACNS '08), Lecture Notes in Computer Science, Springer, 2008, vol. 5037, p. 411–428.

[39]

P.-A. Fouque, D. Pointcheval, S. Zimmer.
HMAC is a Randomness Extractor and Applications to TLS, in: Proceedings of the 3rd ACM Symposium on InformAtion, Computer and Communications Security (AsiaCCS '08), ACM Press, 2008, p. 21–32.

[40]

P.-A. Fouque, D. Réal, F. Valette, M. Drissi.
The Carry Leakage on the Randomized Exponent Countermeasure, in: Cryptographic Hardware and Embedded Systems '08 (CHES '08), Lecture Notes in Computer Science, Springer, 2008, vol. 5154, p. 198-213.

[41]

P.-A. Fouque, J. Stern, S. Zimmer.
Cryptanalysis of Tweaked Versions of SMASH and Reparation, in: Selected Area in Cryptography '08 (SAC '08), Lecture Notes in Computer Science, Springer, 2008, - p.

[42]

G. Fuchsbauer, D. Pointcheval.
Anonymous Proxy Signatures, in: The 6th Conference on Security in Communication Networks (SCN '08), Lecture Notes in Computer Science, Springer, 2008, vol. 5229, p. 201–217.

[43]

N. Gama, P. Q. Nguyen.
Finding Short Lattice Vectors within Mordell's Inequality, in: Proc. 40th ACM Symposium on the Theory of Computing (STOC '08), ACM, 2008, p. 207–216.

[44]

N. Gama, P. Q. Nguyen.
Predicting Lattice Reduction, in: Advances in Cryptology - Proc. EUROCRYPT '08, Lecture Notes in Computer Science, Springer, 2008, vol. 4965, p. 31-51.

[45]

M. Izabachène, D. Pointcheval.
New Anonymity Notions for Identity-Based Encryption, in: The 6th Conference on Security in Communication Networks (SCN '08), Lecture Notes in Computer Science, Springer, 2008, vol. 5229, p. 375–391.

[46]

N. K. Jiqiang Lu, J. Kim.
New Impossible Differential Attacks on AES, in: Proceedings of INDOCRYPT '08, Lecture Notes in Computer Science, springer, 2008.

[47]

G. Leurent.
MD4 is Not One-Way, in: FSE '08, Lecture Notes in Computer Science, Springer, 2008, vol. 5086, p. 412–428.

[48]

E. Levieil, D. Naccache.
Cryptographic Test Correction, in: Public Key Cryptography (PKC '08), Springer, 2008, vol. 4939, p. 85-100.

[49]

B. Libert, D. Vergnaud.
Multi-use unidirectional proxy re-signatures., in: Proceedings of the 2008 ACM Conference on Computer and Communications Security, CCS 2008, P. Ning, P. F. Syverson, S. Jha (editors), ACM, 2008, p. 511–520.

[50]

B. Libert, D. Vergnaud.
Tracing Malicious Proxies in Proxy Re-Encryption., in: Pairing-Based Cryptography (Pairing '08), Lecture Notes in Computer Science, Springer, 2008, vol. 5209, p. 332–353.

[51]

B. Libert, D. Vergnaud.
Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption, in: Public Key Cryptography (PKC '08), Lecture Notes in Computer Science, Springer, 2008, vol. 4939, p. 360-379.

[52]

S. I. Orr Dunkelman, N. Keller.
Differential-Linear Attack on 12-Round Serpent, in: Proceedings of INDOCRYPT '08, Lecture Notes in Computer Science, springer, 2008.

[53]

D. Pointcheval, S. Zimmer.
Multi-Factor Authenticated Key Exchange, in: Conference on Applied Cryptography and Network Security (ACNS '08), Lecture Notes in Computer Science, Springer, 2008, vol. 5037, p. 277–295.

[54]

Q. Tang, J. Bringer, H. Chabanne, D. Pointcheval.
A Formal Study of the Privacy Concerns in Biometric-based Remote Authentication Schemes, in: The 4th Information Security Practice and Experience Conference (ISPEC '08), Lecture Notes in Computer Science, Springer, 2008, vol. 4991, p. 56–70.

Scientific Books (or Scientific Book chapters)

[55]

P. Q. Nguyen.
, Public-Key CryptanalysisI. Luengo (editor), Contemporary Mathematics, To appear, AMS–RSME, 2008.

Other Publications

[56]

O. Dunkelman.
Hash Functions — As You Like It, in: TaiWan Information Security Center (TWISC) 2008, 2008.

[57]

O. Dunkelman.
Hash Functions — Much Ado about Something, in: Elliptic Curves Cryptography 2008, 2008.

[58]

O. Dunkelman.
New Hash Function Proposals, in: TaiWan Information Security Center (TWISC) 2008, 2008.

[59]

O. Dunkelman.
Re-visiting HAIFA and why you should visit too, in: Hash functions in cryptology: theory and practice (Lorentz Center), 2008.

[60]

O. Dunkelman.
Related-Key Attacks, in: 3rd ECRYPT PhD SUMMER SCHOOL Advanced Topics in Cryptography, 2008.

References in notes

[61]

M. Bellare.
Practice-Oriented Provable-Security (Invited Lecture), in: ISW'97: 1st International Workshop on Information Security, E. Okamoto, G. I. Davida, M. Mambo (editors), Lecture Notes in Computer Science, Springer-Verlag, Berlin, Germany, September 1997, vol. 1396, p. 221–231.

[62]

M. Bellare, D. Pointcheval, P. Rogaway.
Authenticated Key Exchange Secure against Dictionary Attacks, in: Advances in Cryptology – EUROCRYPT 2000, Bruges, Belgium, B. Preneel (editor), Lecture Notes in Computer Science, Springer-Verlag, Berlin, Germany, May 14–18, 2000, vol. 1807, p. 139–155.

[63]

M. Bellare, P. Rogaway.
The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs, in: Advances in Cryptology – EUROCRYPT 2006, St. Petersburg, Russia, S. Vaudenay (editor), Lecture Notes in Computer Science, Springer-Verlag, Berlin, Germany, May 28 – June 1, 2006, vol. 4004, p. 409–426.

[64]

M. Bellare, P. Rogaway.
Random Oracles are Practical: A Paradigm for Designing Efficient Protocols, in: ACM CCS 93: 1st Conference on Computer and Communications Security, Fairfax, Virginia, USA, V. Ashby (editor), ACM Press, November 3–5, 1993, p. 62–73.

[65]

M. Bellare, P. Rogaway.
The Exact Security of Digital Signatures: How to Sign with RSA and Rabin, in: Advances in Cryptology – EUROCRYPT'96, Saragossa, Spain, U. M. Maurer (editor), Lecture Notes in Computer Science, Springer-Verlag, Berlin, Germany, May 12–16, 1996, vol. 1070, p. 399–416.

[66]

E. Biham, R. Chen, A. Joux, P. Carribault, C. Lemuet, W. Jalby.
Collisions of SHA-0 and Reduced SHA-1., in: Eurocrypt '05, LNCS 3494, Springer-Verlag, Berlin, 2005, p. 36–57.

[67]

D. R. L. Brown.
The Exact Security of ECDSA, http://grouper.ieee.org/groups/1363/, January 2001, Contributions to IEEE P1363a.

[68]

B. Chor, R. L. Rivest.
A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields, in: Advances in Cryptology – CRYPTO'84, Santa Barbara, CA, USA, G. R. Blakley, D. Chaum (editors), Lecture Notes in Computer Science, Springer-Verlag, Berlin, Germany, August 19–23, 1985, vol. 196, p. 54–65.

[69]

W. Diffie, M. E. Hellman.
New Directions in Cryptography, in: IEEE Transactions on Information Theory, 1976, vol. 22, n^o 6, p. 644–654.

[70]

V. Dubois, P. A. Fouque, A. Shamir, J. Stern.
Practical Cryptanalysis of SFLASH, in: Advances in Cryptology – Proceedings of CRYPTO '07, Lecture Notes in Computer Science, Submitted, Springer, 2007.

[71]

V. Dubois, P. A. Fouque, J. Stern.
Cryptanalysis of SFLASH with Slightly Modified Parameters, in: Advances in Cryptology – Proceedings of EUROCRYPT '07, Lecture Notes in Computer Science, To appear, Springer, 2007.

[72]

A. Fiat, A. Shamir.
How to Prove Yourself: Practical Solutions to Identification and Signature Problems, in: Advances in Cryptology – CRYPTO'86, Santa Barbara, CA, USA, A. M. Odlyzko (editor), Lecture Notes in Computer Science, Springer-Verlag, Berlin, Germany, August 1987, vol. 263, p. 186–194.

[73]

E. Fujisaki, T. Okamoto, D. Pointcheval, J. Stern.
RSA–OAEP is Secure under the RSA Assumption, in: Journal of Cryptology, 2004, vol. 17, n^o 2, p. 81–104.

[74]

N. Gama, N. Howgrave-Graham, H. Koy, P. Q. Nguyen.
Rankin's Constant and Blockwise Lattice Reduction, in: Advances in Cryptology – Proceedings of CRYPTO '06, Lecture Notes in Computer Science, Springer, 2006, vol. 4117, p. 112-130.

[75]

L. Lamport.
Constructing Digital Signatures from a One-Way Function, Technical report, SRI Intl., 1979, n^o CSL 98.

[76]

T. Matsumoto, H. Imai.
Public Quadratic Polynominal-Tuples for Efficient Signature-Verification and Message-Encryption, in: Advances in Cryptology – EUROCRYPT'88, Davos, Switzerland, C. G. Günther (editor), Lecture Notes in Computer Science, Springer-Verlag, Berlin, Germany, May 25–27, 1988, vol. 330, p. 419–453.

[77]

NIST.
Descriptions of SHA–256, SHA–384, and SHA–512, Available from http://www.nist.gov/sha/, October 2000.

[78]

NIST.
Secure Hash Standard (SHS), Federal Information Processing Standards PUBlication 180, Draft, April 1993.

[79]

NIST.
Secure Hash Standard (SHS), Federal Information Processing Standards PUBlication 180–1, April 1995.

[80]

V. I. Nechaev.
Complexity of a Determinate Algorithm for the Discrete Logarithm, in: Mathematical Notes, 1994, vol. 55, n^o 2, p. 165–172.

[81]

P. Q. Nguyen, D. Stehlé.
Floating-Point LLL Revisited, in: Advances in Cryptology – Proceedings of EUROCRYPT '05, Lecture Notes in Computer Science, Springer, 2005, vol. 3494, p. 215–233.

[82]

P. Q. Nguyen, D. Stehlé.
Low-dimensional lattice basis reduction revisited, in: Proceedings of the 6th International Algorithmic Number Theory Symposium, (ANTS-VI), Lecture Notes in Computer Science, Springer, 2004, vol. 3076, p. 338–357.

[83]

P. Q. Nguyen, D. Stehlé.
LLL on the Average, in: Proceedings of the 7th International Algorithmic Number Theory Symposium, (ANTS-VII), Lecture Notes in Computer Science, Springer, 2006, vol. 4076, p. 238–256.

[84]

J.-B. Note, J. Vuillemin.
Compiling synchronous kahn networks to efficient reconfigurable hardware, Symposium in memory of Gilles Kahnn, Springer Verlag, 2007.

[85]

J.-B. Note, J. Vuillemin.
Towards automatically compiling efficient fpga hardware, International Workshop on Design and Functional Languages, IEEE, 2007, p. 115–124.

[86]

K. Ohta, T. Okamoto.
On Concrete Security Treatment of Signatures Derived from Identification, in: Advances in Cryptology – CRYPTO'98, Santa Barbara, CA, USA, H. Krawczyk (editor), Lecture Notes in Computer Science, Springer-Verlag, Berlin, Germany, August 23–27, 1998, vol. 1462, p. 354–369.

[87]

J. Patarin, L. Goubin, N. Courtois.
C_{- +} ^* and HM: Variations Around Two Schemes of T. Matsumoto and H. Imai, in: Advances in Cryptology – ASIACRYPT'98, Beijing, China, K. Ohta, D. Pei (editors), Lecture Notes in Computer Science, Springer-Verlag, Berlin, Germany, October 18–22, 1998, vol. 1514, p. 35–49.

[88]

J. Patarin.
Cryptoanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88, in: Advances in Cryptology – CRYPTO'95, Santa Barbara, CA, USA, D. Coppersmith (editor), Lecture Notes in Computer Science, Springer-Verlag, Berlin, Germany, August 27–31, 1995, vol. 963, p. 248–261.

[89]

J. Patarin.
Asymmetric Cryptography with a Hidden Monomial, in: Advances in Cryptology – CRYPTO'96, Santa Barbara, CA, USA, N. Koblitz (editor), Lecture Notes in Computer Science, Springer-Verlag, Berlin, Germany, August 18–22, 1996, vol. 1109, p. 45–60.

[90]

J. Patarin.
Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms, in: Advances in Cryptology – EUROCRYPT'96, Saragossa, Spain, U. M. Maurer (editor), Lecture Notes in Computer Science, Springer-Verlag, Berlin, Germany, May 12–16, 1996, vol. 1070, p. 33–48.

[91]

D. Pointcheval.
« Provable Security for Public-Key Schemes », in: Advanced Course on Contemporary Cryptology, Advanced Courses CRM Barcelona, ISBN: 3-7643-7294-X (248 pages), Birkhäuser Publishers, Basel, June 2005, p. 133–189.

[92]

R. Rivest.
The MD4 Message-Digest Algorithm, RFC 1320, The Internet Engineering Task Force, April 1992.

[93]

R. Rivest.
The MD5 Message-Digest Algorithm, RFC 1321, The Internet Engineering Task Force, April 1992.

[94]

V. Shoup.
Sequences of games: a tool for taming complexity in security proofs, Cryptology ePrint Archive 2004/332, 2004.

[95]

V. Shoup.
Lower Bounds for Discrete Logarithms and Related Problems, in: Advances in Cryptology – EUROCRYPT'97, Konstanz, Germany, W. Fumy (editor), Lecture Notes in Computer Science, Springer-Verlag, Berlin, Germany, May 11–15, 1997, vol. 1233, p. 256–266.

[96]

S. Vaudenay.
Cryptanalysis of the Chor-Rivest Cryptosystem, in: Advances in Cryptology – CRYPTO'98, Santa Barbara, CA, USA, H. Krawczyk (editor), Lecture Notes in Computer Science, Springer-Verlag, Berlin, Germany, August 23–27, 1998, vol. 1462, p. 243–256.

[97]

X. Wang, X. Lai, D. Feng, H. Chen, X. Yu.
Cryptanalysis of the Hash Functions MD4 and RIPEMD, in: Eurocrypt '05, LNCS 3494, Springer-Verlag, Berlin, 2005, p. 1–18.

[98]

X. Wang, Y. L. Yin, H. Yu.
Finding Collisions in the Full SHA-1, in: Crypto '05, LNCS 3621, Springer-Verlag, Berlin, 2005, p. 17–36.

[99]

X. Wang, H. Yu.
How to Break MD5 and Other Hash Functions, in: Eurocrypt '05, LNCS 3494, Springer-Verlag, Berlin, 2005, p. 19–35.

[100]

X. Wang, H. Yu, Y. L. Yin.
Efficient Collision Search Attacks on SHA-0, in: Crypto '05, LNCS 3621, Springer-Verlag, Berlin, 2005, p. 1–16.

[101]

H. Yu, X. Wang, A. Yun, S. Park.
Cryptanalysis of the Full HAVAL with 4 and 5 Passes, in: FSE '06, LNCS 4047, Springer-Verlag, Berlin, 2006, p. 89–110.

[102]

H. Yu, G. Wang, G. Zhang, X. Wang.
The Second-Preimage Attack on MD4, in: CANS '05, LNCS 3810, Springer-Verlag, Berlin, 2005, p. 1–12.