Description
Leader of the group Computer Security: Marten van Dijk.
The Computer Security group contributes to making our society a safe place with digital and physical infrastructures that can be trusted to have the best interest of citizens and industry in mind. Our work constructively contributes new mechanisms and solutions to security problems.
We are committed to bringing rigorous cryptographic style thinking to security engineering. We study, analyze, and design secure computing environments from various perspectives such as secure processor architectures and cyber physical system security but also secure machine learning functionalities. We provide a holistic approach and use various techniques for reasoning about security, safety, and resilience ranging from formal methods to cryptographic proofs.
Vacancies
No vacancies currently.
News
Better parallel programming with help of ABS language
Current programming languages cannot use the full potential power of manycore chips. Keyvan Azadbakht studied the formal programming language ABS and extended the programming model and analysis techniques. He defended his PhD thesis on 11 December.
Grant for CWI to improve Next Generation Internet
NLnet Foundation awarded CWI with a grant to develop a replacement for a decades-old application programming technique for communication on the internet. This might result in an alternative to deep packet inspection for network operators that better protects privacy for users.
Symposium celebrating life and achievements of Farhad Arbab
On Friday 25 May 2018 CWI organizes a farewell symposium on the occasion of the retirement of Farhad Arbab, ‘It's All About Coordination’. Farhad Arbab has been a researcher at CWI for 28 years and a professor at Leiden University since 2004. He is most known for his work on coordination languages in software engineering, particularly Reo, and in concurrency and software composition.
CWI unveils real nature of Eilenberg-type correspondences
After almost forty years, a well-known theorem in algebra about 'Eilenberg-type correspondences' is finally fully understood. Julian Salamanca, PhD student at CWI in Amsterdam, made a unified theory that explained their real nature. He defends his thesis 'Coequations and Eilenberg-type correspondences' on 24 April 2018 at Radboud University in Nijmegen.
Members
Associated Members
Publications
-
Mahmood, K, Nguyen, P.H, Nguyen, L.M, Nguyen, T, & van Dijk, M.E. (2021). Besting the black-box: Barrier zones for adversarial example defense. IEEE Access, 10, 1451–1474. doi:10.1109/ACCESS.2021.3138966
-
Yang, Z, Jin, C, Ning, J, Li, Z, Dinh, T.T.A, & Zhou, J. (2021). Group Time-based One-Time Passwords and its application to efficient privacy-preserving Proof of Location. In Proceedings of the Annual Computer Security Applications Conference (pp. 497–512). doi:10.1145/3485832.3488009
-
Lion, B, Arbab, F, & Talcott, C. (2021). A semantic model for interacting cyber-physical systems. In Electronic Proceedings in Theoretical Computer Science (pp. 77–95). doi:10.4204/EPTCS.347.5
-
Yang, Z, Bao, Z, Jin, C, Liu, Z, & Zhou, J. (2021). PLCrypto: A symmetric cryptographic library for Programmable Logic Controllers. IACR Transactions in Symmetric Cryptology, 2021(3), 170–217. doi:10.46586/tosc.v2021.i3.170-217
-
Yang, Z, Yin, C, Jin, C, Ning, J, & Zhou, J. (2021). Lightweight delegated authentication with identity fraud detection for cyber-physical systems. In Proceedings of the ACM Cyber-Physical System Security Workshop. doi:10.1145/3457339.3457984
-
Albert, E, Bezirgiannis, N, de Boer, F.S, & Martin-Martin, E. (2020). A formal, resource consumption-preserving translation from actors with cooperative scheduling to Haskell. Fundamenta Informaticae, 177(3-4), 203–234. doi:10.3233/FI-2020-1988
-
Hiep, H.A, Bian, J, de Boer, F.S, & de Gouw, C.P.T. (2020). History-based specification and verification of Java Collections in KeY. In Integrated Formal Methods (pp. 199–217). doi:10.1007/978-3-030-63461-2_11
-
de Boer, F.S, & Hiep, H.A. (2020). History-based specification and verification of Java collections in KeY (keynote). In FTfJP 2020 - Proceedings of the 22nd ACM SIGPLAN International Workshop on Formal Techniques for Java-Like Programs, FTfJP 2020, co-located with ECOOP 2020/SPLASH 2020 (pp. 2–3). doi:10.1145/3427761.3432349
-
Pham, N.H, Nguyen, L.M, Phan, D.T, Nguyen, P.H, van Dijk, M.E, & Tran-Dinh, Q. (2020). A Hybrid Stochastic Policy Gradient Algorithm for Reinforcement Learning. In Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics.
-
Endrullis, J, Klop, J.W, & Overbeek, R. (2020). Decreasing diagrams for confluence and commutation. Logical Methods in Computer Science, 16(1). doi:10.23638/LMCS-16(1:23)2020
Software
Extensible Coordination Tools: plug-ins for the Eclipse platform
ECT: The Extensible Coordination Tools consist of a set of plug-ins for the Eclipse platform to facilitate development of concurrency protocols and distributed applications based on the coordination language Reo.
SAGA: A run-time verifier for Java programs
SAGA is a run-time verifier for single-threaded as well as multi-threaded Java programs.
Current projects with external funding
-
Evolutionary changes in Distributed Analysis (ECiDA)
-
Reowolf 2.0: decentralized, synchronous, multi-party Internet communication (Reowolf 2.0)
Related partners
-
Anchormen
-
Vitens