Description
Leader of the group Cryptology: Ronald Cramer.
News
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.
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.
Current events
PhD defence Max Fillinger (CR)
- 2019-03-19T10:00:00+01:00
- 2019-03-19T11:00:00+01:00
PhD defence Max Fillinger (CR)
Start: 2019-03-19 10:00:00+01:00 End: 2019-03-19 11:00:00+01:00
Everybody is welcome to attend the public defence of Max Fillinger (CWI & Universiteit Leiden)
of his thesis 'Two-Prover Bit-Commitments: Classical, Quantum and Non-Signaling'.
Promotor: Prof.dr. S. Fehr (CWI & Universiteit Leiden)
Promotiecommissie:
- Prof.dr. A. W. van der Vaart (Universiteit Leiden)
- Prof.dr. B. de Smit (Universiteit Leiden)
- Dr. S. Jeffery (CWI)
- Prof.dr. A. Kent (University of Cambridge)
- Prof.dr. S. Wolf (Universita della Svizzera italiana, Lugano)
- Web
- Email: Silvia Benschop
- Phone: 020 592 4032
-
iCal
Members
Associated Members
Publications
-
Albrecht, M, Ducas, L, Herold, G, Kirshanova, E, Postlethwaite, E.W, & Stevens, M.M.J. (2019). The General Sieve Kernel and New Records in Lattice Reduction.
-
Guruswami, V, Xing, C, & Yuan, C. (2018). How long can optimal locally repairable codes be?. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018) (pp. 41:1–41:11). doi:10.4230/LIPIcs.APPROX-RANDOM.2018.41
-
Cascudo, I, Cramer, R.J.F, Xing, C, & Yuan, C. (2018). Amortized complexity of information-theoretically secure MPC revisited. In Advances in Cryptology - CRYPTO 2018 (pp. 395–426). doi:10.1007/978-3-319-96878-0_14
-
Luo, Y, Xing, C, & Yuan, C. (2018). Optimal locally repairable codes of distance 3 and 4 via cyclic codes. IEEE Transactions on Information Theory. doi:10.1109/TIT.2018.2854717
-
Landerreche, E, & Stevens, M.M.J. (2018). On Immutability of Blockchains. In Reports of the European Society for Socially Embedded Technologies (Vol. 2). doi:10.18420/blockchain2018_04
-
Xiao, D, & Yu, Y. (2018). Klepto for Ring-LWE encryption. Computer Journal, 61(8), 1228–1239.
-
Xiao, D, Yu, Y, & Bi, J. (2018). A new discrete gaussian sampler over orthogonal lattices. IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, (11), 1880–1887.
-
Fehr, S. (2018). Classical Proofs for the Quantum Collapsing Property of Classical Hash Functions. In Theory of Cryptography Conference - TCC2018 (pp. 315–338).
-
Fehr, S, Karpman, P, & Mennink, B. (2018). Short Non-Malleable Codes from Related-Key Secure Block Ciphers. In IACR Transactions on Symmetric Cryptology (Vol. 2018).
-
Cramer, R.J.F, Damgård, I.B, Döttling, N.M, Giacomelli, I, & Xing, C. (2017). Linear-time non-malleable codes in the bit-wise independent tampering model. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence (pp. 1–25). doi:10.1007/978-3-319-72089-0_1
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
-
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
-
Ecole Polytechnique Federale de Lausanne
-
TNO
-
Technische Universiteit Eindhoven
-
Universidad Politecnica Catalunya
-
Universiteit van Amsterdam
-
Vrije Universiteit Amsterdam