Description
Leader of the group Cryptology: Ronald Cramer.
Vacancies
No vacancies currently.
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
-
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
-
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
-
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
-
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
-
Attema, T, & Cramer, R.J.F. (2020). Compressed σ-protocol theory and practical application to plug & play secure algorithmics. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence. doi:10.1007/978-3-030-56877-1_18
-
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
-
Wisiol, N, Mühl, C, Pirnay, N, Nguyen, P.H, Margraf, M, Seifert, J.-P, … Rührmair, U. (2020). Splitting the Interpose PUF: A Novel Modeling Attack Strategy. IACR Transactions on Cryptographic Hardware and Embedded Systems, 2020(3). doi:10.13154/tches.v2020.i3.97-120
-
van Woerden, W.P.J. (2020). An upper bound on the number of perfect quadratic forms. Advances in Mathematics, 365. doi:10.1016/j.aim.2020.107031
-
Canetti, R, van Dijk, M.E, Maleki, H, Rührmair, U, & Schaumont, P. (2020). Using Universal Composition to Design and Analyze Secure Complex Hardware Systems. In Proceedings of 2020 Design, Automation & Test in Europe Conference & Exhibition (DATE). doi:10.23919/DATE48585.2020.9116295
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)
-
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