Description
Leader of the group Cryptology: Ronald Cramer.
News
Veni grants for Léo Ducas and Johannes Köster
The Netherlands Organisation for Scientific Research (NWO) has awarded Veni grants to Léo Ducas and Johannes Köster of CWI.
First book on quantum-secure multi-party computation
Ronald Cramer (Centrum Wiskunde & Informatica), Ivan Damgard and Jesper Nielsen (Aarhus University) recently published the first book ever on information-theoretically secure multiparty computation (MPC) – a subfield of cryptography that describes security systems that cannot even be broken by quantum computers or unlimited computing power.
Researchers urge: industry standard SHA-1 should be retracted sooner
An international team of cryptanalysts urges the industry today that SHA-1 internet security standard should be retracted sooner, since the cost of breaking it is significantly lower than previously thought.
Vision on Quantum-Safe Encryption in WIRED and Quanta magazine
Research results of CWI cryptologists Ronald Cramer and Léo Ducas on quantum-safe encryption were discussed in an article on WIRED on 19 September 2015.
Current events
QCrypt 2020: on-line Conference
- 2020-08-10T00:00:00+02:00
- 2020-08-14T23:59:59+02:00
QCrypt 2020: on-line Conference
Start: 2020-08-10 00:00:00+02:00 End: 2020-08-14 23:59:59+02:00
The annual QCrypt conference is the main international event that is dedicated to the latest developments in the field of quantum cryptography. Researchers from all over the world present their recent scientific discoveries in the field and companies display their latest relevant technology. The topic of the conference covers all aspects of cryptographic security in the presence of quantum devices, including - but not limited to - quantum key distribution, quantum randomness generation, and the impact of quantum computers on classical cryptography. The 10th anniversary edition of the conference, QCrypt 2020 will take place as an online event and is jointly organized by CWI, UvA and QuSoft.
The conference hosts researchers and scientists from the leading international academic research groups and engineers and industry representatives from international companies; all of which are interested in quantum cryptography as a practical technology and in the security of cryptographic schemes under quantum attacks.
All information (speakers, registration etc) can be found on our website.
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
-
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)
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