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.



No vacancies currently.


Cum laude for new method making parallel programming easier

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.

Cum laude for new method making parallel programming easier - Read More…

Current events

Amsterdam Coordination Group (ACG) Talk by Lisa Kohl

  • 2021-07-27T13:30:00+02:00
  • 2021-07-27T15:00:00+02:00
July 27 Tuesday

Start: 2021-07-27 13:30:00+02:00 End: 2021-07-27 15:00:00+02:00

Via Zoom

On 27 July 13:30 Lisa Kohl will give a talk titled Correlated Pseudorandom Functions from Variable-Density Learning Parity with Noise.

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


Associated Members



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