About our research
Research institute
This Master's specialisation is offered in close collaboration with the Institute for Computing and Information Sciences (iCIS), more specifically the Digital Security department within iCIS. iCIS aims to improve the fundamentals of software development via formal, mathematically founded theories, methods, and tools that support the specification, design, analysis, and evaluation of computer-based systems.
Institute for Computing and Information Sciences
Digital Security department
The Digital Security department works on a broad range of topics in computer security, including applied cryptography, security protocols, smartcards and RFID, and the security and correctness of software. We are also interested in societal aspects of digital security, such asprivacy and e-voting, and interaction with disciplines outside computer science such as cryptography and law.
Digital Security works on a broad range of topics in cyber security that includes:
- Applied cryptography
- Security protocols
- Smartcards and RFID
- Security and correctness of software
- Privacy
- E-voting
- Cryptography
- Cyber law
Student projects
A large part of this programme is focused on research. Examples of student projects are listed below. You can find more student projects at the Digital Security department.
In PubHubs hubs, users are identified by a (shortened) hash, like a3g-a48, to, in principle, prevent impersonation. “In principle”, because it’s unlikely that you’d remember another user’s hash, let alone notice when it’s changed. That’s why we’re considering using an ‘identicon’ like the one used by GitHub (and others), but we see two problems: (1) How to prevent users from being assigned an identicon they consider offensive? (For example, one having the colors of an opposing soccer team.), and (2) Is it feasible for an attacker obtain an identicon that’s close enough to another person’s identicon, by registering a whole bunch of user accounts.
If you are interested in this topic, please send an email to dr. Bram Westerbaan.
The mirror theory of Patarin stated the following: Consider bit strings and additions of those bit strings (e.g. 1011 + 1100 = 0111). Consider the following system of equations: P_1 + Q_1 = h_1, P_2 + Q_2 = h_2, P_3 + Q_3 = h_3, ... P_l + Q_l = h_l, where h_1,...,h_l are given. The mirror theory states a LOWER bound on the number of solutions {P_1,...,P_l,Q_1,...,Q_l} that satisfy these equations and where the P_i's are distinct and the Q_i's are distinct. See also Section 1.1. Theorem 2 in that paper states a lower bound for a general setting, but the proof is disputed. A proof has later been given. The goal of the thesis would be to simulate this, e.g., make a smart computer program for small scale bit strings and number of equations that derives the actual lower bound.
If you are interested in this topic, please send an email to dr. Bart Mennink.
There are many real-world applications that make use of cryptography. Students that are interested in investigating such an application can make a proposal and formulate a research question and come to us. We will then do our best to supervise an interesting bachelor thesis. In the past we had some interesting bachelor theses in this category on bluetooth authentication, key management in the signal protocol, email phishing prevention, security of car key fobs, etc.
If you are interested in this topic, please send an email to Prof. Joan Daemen.