Description
Leader of the group Cryptology: Ronald Cramer.
Vacancies
No vacancies currently.
News
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.
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.
Members
Associated Members
Publications
-
Abspoel, M.A, Attema, T, & Rambaud, M. (2021). Brief announcement: Malicious security comes for free in consensus with leaders. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (pp. 195–198). doi:10.1145/3465084.3467953
-
Chung, K.-M, Fehr, S, Huang, Y.-H, & Liao, T.-N. (2021). On the compressed-oracle technique, and post-quantum security of proofs of sequential work. In Proceedings of EUROCRYPT 2021 (pp. 598–629). doi:10.1007/978-3-030-77886-6_21
-
Abspoel, M.A, Dalskov, A, Escudero, D, & Nof, A. (2021). An efficient passive-to-active compiler for honest-majority MPC over rings. In Proceedings of the International Conference on Applied Cryptography and Network Security (pp. 122–152). doi:10.1007/978-3-030-78375-4_6
-
Guruswami, V, Resch, N.A, & Xing, C. (2021). Lossless dimension expanders via linearized polynomials and subspace designs. Combinatorica, 2021. doi:10.1007/s00493-020-4360-1
-
Kopparty, S, Resch, N.A, Ron-Zewi, N, Saraf, S, & Silas, S. (2021). On list recovery of high-rate tensor codes. IEEE Transactions on Information Theory, 67(1), 296–316. doi:10.1109/TIT.2020.3023962
-
Fehr, S, & Yuan, C. (2020). Robust secret sharing with almost optimal share size and security against rushing adversaries. In TCC 2020: Theory of Cryptography (pp. 470–498). doi:10.1007/978-3-030-64381-2_17
-
Cramer, R.J.F, Xing, C, & Yuan, C. (2020). On the complexity of arithmetic secret sharing. In TCC 2020: Theory of Cryptography (pp. 444–469). doi:10.1007/978-3-030-64381-2_16
-
Jin, C, Burleson, W, van Dijk, M.E, & Rührmair, U. (2020). Erasable PUFs: Formal treatment and generic design. In ASHES 2020 - Proceedings of the 4th ACM Workshop on Attacks and Solutions in Hardware Security (pp. 21–33). doi:10.1145/3411504.3421215
-
Wesolowski, B.P.C. (2020). Efficient Verifiable Delay Functions. Journal of Cryptology, 33(4), 2113–2147. doi:10.1007/s00145-020-09364-x
-
Don, J.W, Fehr, S, & Majenz, C. (2020). The measure-and-reprogram technique 2.0: Multi-round Fiat-Shamir and more. In CRYPTO 2020: Advances in Cryptology (pp. 602–631). doi:10.1007/978-3-030-56877-1_21
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
-
Samenwerkingsovereenkomst met TNO vwb promotieonderzoek Thomas Attema ()
-
Secure scalable policy-enforced distributed data processing ()
-
Algebraic Methods for Stronger Crypto (ALGSTRONGCRYPTO)
-
A Reduction Theory for Codes and Lattices in Cryptography (ARTICULATE)
-
Hybrid Approach for quantum-safe Public Key Infrastructure Development for Organisations (HAPKIDO)
-
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