Description
Leader of the group Cryptology: Ronald Cramer.
News
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.
Cryptographic security at the speed of light
When people who distrust each other want to securely cooperate, they can use cryptographic 'commitment schemes'. Max Fillinger (CWI) designed and analyzed relativistic commitment schemes. He defends his PhD thesis 'Bit-Commitments: Classical, Quantum and Non-Signaling' on 19 March.
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.
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