Privacy-preserving Computations

In this workshop you will be introduced to the topic of privacy-preserving computations, the challenges and its applications. During the case we bring together content and current events, giving you the task of using your mathematical skills to find the right solution. So, if you are keen to be surprised by a content-based, topical case, come to the case of TNO and take up the challenge!

About TNO

TNO is innovation, and that's why we always respond to the things going on around us. If you take part in the TNO workshop, then we'll give you a challenging case on privacy-preserving computations. Privacy-preserving computation is a subfield of cryptography with the goal of creating methods for parties to jointly analyze their inputs while keeping those inputs private. An example is Yao's Millionaires' problem, where two millionaires are interested to know which of them is richer without revealing their actual wealth. Recently, privacy-preserving computation took a flight; many academic advancements have been made and therefore also many practical use cases are being developed.

About the speakers

Maran van Heesch and Thomas Attema are scientists at TNO with a strong focus on cryptography. Maran received her BSc and MSc in Industrial and Applied Mathematics from the TU/e and an MSc in Econometrics from Tilburg University. Thomas received his BSc and MSc in Mathematics from Utrecht University and is currently pursuing his PhD at the Cryptology Group at CWI Amsterdam. Within TNO they work in projects applying MPC in use cases from Dutch financials and the medical domain. Besides MPC they also do research in the field of (post-)quantum cryptography and quantum computing.