Description
Leader of the group Cryptology: Ronald Cramer.
News
How to share sensitive information safely?
“Data protection is now in the news more often than ever before”, Thijs Veugen, a senior researcher at TNO and part-time seconded in CWI’s Cryptology group says in his recent TNO Time column. “What should a company do if it wants to share information?" "Organizations can use secure multi-party computation to securely link the most sensitive databases together.”
EU PROMETHEUS project started to develop quantum-safe cryptography
In January 2018 the international PROMETHEUS project has started – a new four-year European H2020 project to prepare ourselves for the threats of the post-quantum era. Dutch research partners in this international project are TNO and CWI.
CRYPTO 2017 Best Paper Award for breaking SHA-1 security standard
A team of researchers from CWI and Google have won the CRYPTO 2017 Best Paper Award for being the first to break the SHA-1 internet security standard in practice. Marc Stevens (CWI) explained this research during a plenary talk at CRYPTO 2017 in Santa Barbara (USA).
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.
Members
Associated Members
Publications
-
Niu, X, Xing, C, & Yuan, C. (2020). Asymptotic Gilbert-Varshamov bound on frequency hopping sequences. IEEE Transactions on Information Theory, 66(2), 1213–1218. doi:10.1109/TIT.2019.2951383
-
Abspoel, M.A, Cramer, R.J.F, Damgård, I.B, Escudero, D, & Yuan, C. (2019). Efficient information-theoretic Secure Multiparty Computation over Z/pkZ via Galois rings. In Proceedings of the Theory of Cryptography Conference (pp. 471–501). doi:10.1007/978-3-030-36030-6_19
-
Ducas, L, Plancon, M.C.G, & Wesolowski, B.P.C. (2019). On the shortness of vectors to be found by the Ideal-SVP quantum algorithm. In Advances in Cryptology - CRYPTO 2019 (pp. 322–351). doi:10.1007/978-3-030-26948-7_12
-
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
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
-
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)
Related partners
-
ABN AMRO Bank
-
IBM
-
ING Bank
-
KLM
-
Orange SA
-
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