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
Farhad Arbab honoured by Sharif University of Technology
CWI researcher Farhad Arbab was honoured by Sharif University of Technology in Iran as one of its fifty most outstanding alumni over the past fifty years. The alumni were selected for both their technical achievements and service to the society.
Cum laude for new method making parallel programming easier
Due to the increase of multicore processors used in smart phones, game consoles and other computers, parallel programming has become increasingly important. To prevent software errors, concurrent calculations must always exactly be executed in the correct order. This is not easy, because existing programming techniques for enforcing such orders - interaction protocols - are very hard to use. PhD student Sung-Shik Jongmans of Centrum Wiskunde & Informatica and Leiden University investigated a new programming method to simplify this.
FACS Best Paper Award for Formal Methods researchers
During the FACS2015 conference three researchers associated with the CWI Formal Methods research group were awarded the Best Paper Award for their article ‘Composing Constraint Automata, State-by-State’. The conference was held in Niterói, Brazil, from 14-16 October 2015.
Cum laude for PhD student Jurriaan Rot
Infinite data structures can be studied with a simplified technique, thanks to research done by PhD student Jurriaan Rot. He received his PhD degree with honours (cum laude) for his thesis ‘Enhanced Coinduction’ at Leiden University on 15 October 2015. This thesis belongs to the 5% best dissertations in the field of computer science.
Current events
Amsterdam Coordination Group (ACG) Talk by Lisa Kohl
- 2021-07-27T13:30:00+02:00
- 2021-07-27T15:00:00+02:00
Amsterdam Coordination Group (ACG) Talk by Lisa Kohl
Start: 2021-07-27 13:30:00+02:00 End: 2021-07-27 15:00:00+02:00
On 27 July 13:30 Lisa Kohl will give a talk titled Correlated Pseudorandom Functions from Variable-Density Learning Parity with Noise.
https://cwi-nl.zoom.us/j/85074346559?pwd=dXdZWVpHWXFuMlk4SEFqbFRzTGJOZz09
Abstract:
Correlated randomness is a ubiquitous resource in cryptography. A one-time pad, namely a pair of identical random keys, enables perfectly secure communication. More complex forms of correlated randomness can similarly facilitate protocols for secure multiparty computation that allow two or more parties to jointly compute a function of secret inputs revealing nothing beyond the output. An example for a useful correlation is oblivious transfer, where one party is given two random bits (s_0,s_1) and another party gets (b,s_b) for a random bit b.
In this work we initiate the study of correlated pseudorandom functions that offer the ability to generate an essentially unbounded amount of correlated pseudorandomness from short correlated keys using only local computation. We present efficient constructions of correlated pseudorandom functions for a broad class of useful correlations, including oblivious transfer, from a variable-density variant of the learning parity with noise assumption.
This is joint work with Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai and Peter Scholl.
About Amsterdam Coordination Group Talks
ACGs are biweekly colloquium organized in the Computer Security group. You can find a list of our previous speakers at
https://event.cwi.nl/acg/category/presentations.
- Email: Benjamin Lion
-
iCal
Members
Associated Members
Publications
-
Dokter, K.P.C, Gadducci, F, Lion, B, & Santini, F. (2021). Soft constraint automata with memory. Journal of Logical and Algebraic Methods in Programming, 118. doi:10.1016/j.jlamp.2020.100615
-
de Boer, F.S, Bonsangue, M.M, Johnsen, E.B, Pun, V.K.I, Tapia Tarifa, S.L, & Tveito, L. (2020). SymPaths: Symbolic Execution Meets Partial Order Reduction. In W Ahrendt, B Beckert, R Bubel, R Hähnle, & M Ulbrich (Eds.), Deductive Software Verification: Future Perspectives (pp. 313–338). doi:10.1007/978-3-030-64354-6_13
-
Hiep, H.A, Bian, J, de Boer, F.S, & de Gouw, C.P.T. (2020). A Tutorial on Verifying LinkedList Using KeY. In Deductive Software Verification: Future Perspectives. doi:10.1007/978-3-030-64354-6_9
-
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
-
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
-
Hiep, H.A, Maathuis, O, Bian, J, de Boer, F.S, van Eekelen, M, & de Gouw, C.P.T. (2020). Verifying OpenJDK's LinkedList using KeY. In TACAS 2020: Tools and Algorithms for the Construction and Analysis of Systems (pp. 217–234). doi:10.1007/978-3-030-45237-7_13
-
Serbanescu, V.N, & de Boer, F.S. (2020). On the nature of cooperative scheduling in active objects. In Proceedigns of the 35th Annual ACM Symposium on Applied Computing (pp. 1322–1329). doi:10.1145/3341105.3373896
-
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
-
Azadbakht, K. (2019, December 11). Asynchronous programming in the abstract behavioural specification language.
-
de Boer, F.S, & Hiep, H.A. (2019). Axiomatic characterization of trace reachability for concurrent objects. In Proceedings of the 15th International Conference on integrated Formal Methods (pp. 157–174). doi:10.1007/978-3-030-34968-4_9
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