Description
Leader of the group Cryptology: Ronald Cramer.
News
CWI and Google research team wins Pwnie Award for Best Cryptographic Attack
Researchers at CWI and Google have won the Pwnie Award for Best Cryptographic Attack at the BlackHat USA security conference. They were awarded the prize for being the first to break the SHA-1 internet security standard in practice.
Marc Stevens’ project awarded funding in ‘Big Data: real time ICT for logistics’ programme
NWO has granted five applications within the ‘Big Data: real time ICT for logistics’ research programme. CWI’s Marc Stevens is the main applicant of one of the five granted research projects: 'Secure scalable policy-enforced distributed data processing'.
Cécile Pierrot wins Cercle K2 Cybersecurity Trophy 2017
Cécile Pierrot from the Cryptology research group at CWI won the first Cybersecurity Trophy granted by Cercle K2. This French think tank awards prizes in 22 topics every two years. It aims at stimulating interdisciplinarity and promoting young researchers. The Cybersecurity Trophy 2017 rewarded Pierrot’s PhD thesis, which she defended at UPMC in Paris on 25 November 2016. The jury praised her for both theoretical and practical impacts of her results.
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.
Members
Associated Members
Publications
-
Xing, C, & Yuan, C. (2019). Construction of optimal locally recoverable codes and connection with hypergraph. In Leibniz International Proceedings in Informatics, LIPIcs. doi:10.4230/LIPIcs.ICALP.2019.98
-
Abspoel, M.A, Bouman, N.J, Schoenmakers, L.A.M, & de Vreede, N. (2019). Fast secure comparison for medium-sized integers and its application in binarized neural networks. In Topics in Cryptology – CT-RSA 2019 (pp. 453–472). doi:10.1007/978-3-030-12612-4_23
-
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
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
-
Cryptanalysis of Lattice-based Cryptography ()
-
Secure scalable policy-enforced distributed data processing ()
-
Samenwerkingsovereenkomst met TNO vwb promotieonderzoek Thomas Attema
-
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
-
ABN AMRO Bank
-
IBM
-
ING Bank
-
KLM
-
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
-
TNO
-
Universidad Politecnica Catalunya
-
Universiteit van Amsterdam
-
Vrije Universiteit Amsterdam