Description
Leader of the group Cryptology: Ronald Cramer.
News
ERC Advanced Grant for CWI cryptographer Ronald Cramer
CWI cryptographer Ronald Cramer has been awarded an ERC Advanced Grant of 2.5 million euro for his proposal 'Algebraic Methods for Stronger Crypto'. He leads the Cryptology Research group at Centrum Wiskunde & Informatica (CWI) in Amsterdam and is a full professor at the Mathematical Institute of Leiden University. The European Research Council awards these most prestigious personal grants to outstanding, well-established scientists with novel ideas towards high-risk, groundbreaking research that impacts both science and society at large.
CWI and Google announce first collision for Industry Security Standard SHA-1
'Industry deprecation proved to be too slow' Today, Thursday 23 February 2017, researchers at the Dutch research institute CWI and Google jointly announce that they have broken the SHA-1 internet security standard in practice. This industry standard is used for digital signatures and file integrity verification, which secure credit card transactions, electronic documents, GIT open-source software repositories and software distribution.
Cryptology researcher Marc Stevens awarded with Google research prize
CWI researcher Marc Stevens of the Cryptology research group has been awarded the Google Security Privacy and Anti-abuse applied award.
New attacks on location-based quantum cryptography
For secure communication of classified information, researchers want to deploy the sender’s location, so a receiver can be sure that a message is, for instance, really coming from the White House. Classic location-based methods are shown to be unsafe but location-based quantum cryptography seemed to have a chance.
Members
Associated Members
Publications
-
Ducas, L, & Pellet-Mary, A. (2018). On the statistical leak of the GGH13 multilinear map and some variants. In Advances in Cryptology - ASIACRYPT (pp. 465–493). doi:10.1007/978-3-030-03326-2_16
-
Yu, Y, & Ducas, L. (2018). Learning strikes again: The case of the DRS signature scheme. In Advances in Cryptology - ASIACRYPT 2018 (pp. 525–543). doi:10.1007/978-3-030-03329-3_18
-
Ducas, L, & Pierrot, C.A. (2018). Polynomial time bounded distance decoding near Minkowski’s bound in discrete logarithm lattices. Designs, Codes and Cryptography. doi:10.1007/s10623-018-0573-3
-
Cramer, R.J.F, Damgård, I.B, Escudero, D, Scholl, P, & Xing, C. (2018). SPDZ_{2^k}: Efficient MPC mod 2^k for dishonest majority. In Advances in Cryptology - CRYPTO 2018 (pp. 769–798). doi:10.1007/978-3-319-96881-0_26
-
Bonnoron, G, Ducas, L, & Fillinger, M.J. (2018). Large FHE Gates from tensored homomorphic accumulator. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence. doi:10.1007/978-3-319-89339-6_13
-
Ducas, L. (2018). Shortest vector from lattice sieving: A few dimensions for free. In Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques (pp. 125–145). doi:10.1007/978-3-319-78381-9_5
-
Bos, J.W, Ducas, L, Kiltz, E, Lepoint, T, Lyubashevsky, V, Schanck, J.M, … Stehlé, D. (2018). CRYSTALS - Kyber: A CCA-secure Module-Lattice-Based KEM. In 3rd IEEE European Symposium on Security and Privacy, EURO S & P 2018 (pp. 353–367). doi:10.1109/EuroSP.2018.00032
-
de Boer, K, Ducas, L, Jeffery, S, & de Wolf, R. M. (2018). Attacks on the AJPS Mersenne-based cryptosystem. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence (pp. 101–120). doi:10.1007/978-3-319-79063-3_5
-
Benhamouda, F, Blazy, O, Ducas, L, & Quach, W. (2018). Hash Proof Systems over lattices revisited. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence (pp. 644–674). doi:10.1007/978-3-319-76581-5_22
-
Ducas, L, Kiltz, E, Lepoint, T, Lyubashevsky, V, Schwabe, P, Seiler, G, & Stehlé, D. (2018). CRYSTALS-Dilithium: A lattice-based digital signature scheme. IACR Transactions on Cryptographic Hardware and Embedded Systems, 2018(1), 238–268.
Software
NewHope: Fast implementation of a quantum-resistant key exchange
NewHope is the reference implementation of a quantum-resistant key exchange protocol.
Counter-Cryptanalysis: detecting forged digital MD5, SHA-1 signatures
The Counter-Cryptanalysis project provides a drop-in replacement for the existing cryptographic hash functions MD5 and SHA-1.
HashClash: A framework for studying the weaknesses of MD5 and SHA-1
HashClash is a software framework for cryptanalysis of the MD5 and SHA-1 cryptographic hash functions, and for Chosen-Prefix Collisions for MD5.
Current projects with external funding
-
Applications of Arithmetic Secret Sharing Schemes in Two-Party Cryptography
-
Cryptanalysis of Lattice-based Cryptography
-
Cryptanalysis of Widely-used Hash Function Standards and Beyond
-
Samenwerkingsovereenkomst met TNO vwb promotieonderzoek Thomas Attema
-
Secure scalable policy-enforced distributed data processing
-
Algebraic Methods for Stronger Crypto (ALGSTRONGCRYPTO)
-
PRivacy preserving pOst-quantuM systEms from advanced crypTograpHic mEchanisms Using latticeS (PROMETHEUS)
-
Scalable Oblivious Data Analytics (SODA)
Related partners
-
IBM
-
Orange SA
-
Philips
-
Royal Holloway & Bedford New College, University of London
-
Ruhr-Universität Bochum, Germany
-
Scytl Secure Electronic Voting SA
-
Thales
-
Université de Rennes
-
Weizmann Institute
-
Ecole Normale Superieure
-
Ecole Polytechnique Federale de Lausanne
-
TNO
-
Technische Universiteit Eindhoven
-
Universidad Politecnica Catalunya