Description
Leader of the group Cryptology: Ronald Cramer.
News
Renowned scientists and policy advisors speak at CWI Lectures on Privacy and Security
Our privacy, a fundamental right, is threatened by surveillance and smart algorithms. Can our privacy be salvaged from 'intelligent' machines? During the CWI Lectures 2018 four renowned scientists and policy advisors discuss the state of the art in protecting privacy. Keynote speakers: Marc Rotenberg (USA), Jan Camenisch (Switzerland), Adam Smith (USA) and Ed Felten (USA), former advisor of Barack Obama.
Serge Fehr appointed as Professor Quantum Information Theory
Serge Fehr (CWI, UL) has been appointed as Professor Quantum Information Theory at the Leiden Mathematical Institute (MI) since 1 June 2018. His research is focused on quantum cryptology.
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.
Members
Associated Members
Publications
-
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
-
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
-
Ducas, L. (2017). Advances on quantum cryptanalysis of ideal lattices. Nieuw Archief voor Wiskunde, 5/18, 184–189.
-
de Boer, K, & Pagano, C. (2017). Calculating the power residue symbol and ibeta: Applications of computing the group structure of the principal units of a p-adic number field completion. In Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC (pp. 117–124). doi:10.1145/3087604.3087637
-
Bos, J.W, Ducas, L, Kiltz, E, Lepoint, T, Lyubashevsky, V, Schanck, J.M, … Stehle, D. (2017). CRYSTALS - Kyber: A CCA-secure Module-Lattice-Based KEM. Cryptology ePrint Archive.
-
Canteaut, A, Lambooij, E, Neves, S, Rasoolzadeh, S, Sasaki, Y, & Stevens, M.M.J. (2017). Refined Probability of Differential Characteristics Including Dependency Between Multiple Rounds. IACR Transactions on Symmetric Cryptology, 2017(2), 203–227. doi:10.13154/tosc.v2017.i2.203-227
-
Cramer, R.J.F, Damgård, I.B, Xing, C, & Yuan, C. (2017). Amortized complexity of zero-knowledge proofs revisited: Achieving linear soundness slack. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence. doi:10.1007/978-3-319-56620-7_17
-
Fehr, S, & Salvail, L. (2017). Quantum authentication and encryption with key recycling. In Lecture Notes in Computer Science. doi:10.1007/978-3-319-56617-7_11
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
-
IBM
-
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