Description
Leader of the group Cryptology: Ronald Cramer.
Vacancies
PhD student on the subject of topic of security, privacy and trust of distributed systems
Centrum Wiskunde & Informatica (CWI) has a vacancy in the Cryptology research group for a talented PhD student, on the subject of topic of security, privacy and trust of distributed systems.
News
David Chaum and Guido van Rossum awarded Dijkstra Fellowship
Centrum Wiskunde & Informatica (CWI) will grant the honorary title ‘Dijkstra Fellow’ for the first time in its history. This edition the Dijkstra Fellowship will be awarded to David Chaum and Guido van Rossum.
IBM to deploy quantum-proof cryptography co-developed with CWI and RU
Together with CWI, RU and other international partners, IBM Research has developed quantum-safe algorithms for securing data. IBM has now implemented these algorithms in the world’s first quantum computing safe tape drive.
CWI researcher designs award-winning cryptographic lottery algorithm
Benjamin Wesolowski (CWI) developed a new key ingredient for cryptographic lottery machines and received the Best Young Researcher Paper Award at Eurocrypt 2019. His results can be used for more sustainable blockchain technology.
Researchers hail demise of online security algorithm
An international team of mathematicians has hailed the end of a variant of a code that is widely used to protect online transactions. The five researchers are from EPFL, CWI and the universities of Surrey and Passau.
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