Special Seminar: Peter Scholl "Efficient Secure Computation: Past, Present and Future"

This talk is arranged at the Department of Computer Science and it's open to everyone free-of-charge. The talk will take place at 09:00 (sharp!) in hall AS1, TUAS building.

Efficient Secure Computation: Past, Present and Future

Peter Scholl


Secure multi-party computation (MPC) allows a set of parties to jointly compute a function on their private inputs, whilst leaking no further information on their inputs other than what can be learnt from the output. Secure computation techniques have many applications towards reducing the privacy and security risks from the vast amounts of personal data being stored today, as well as enabling new applications, by allowing data processing without the underlying plaintext being kept in any single place.

In this talk I will start with an introduction to the problem of secure computation, and a short survey of the progress that has been made in improving its efficiency in recent years. This will be focused around my research in designing improved building blocks and protocols. I will illustrate this with a few highlights based on my work on efficient oblivious transfer protocols, general-purpose MPC with desirable properties, and techniques from lattice-based cryptography. Along the way I will also discuss future research directions, which are needed to lower the cost and expand the scope of applications where secure computation can be used, to make the most out of this promising technology.


Peter Scholl is a postdoctoral researcher at Aarhus University working in the area of secure computation. Previously, he was a postdoc at the University of Bristol, where he completed his Ph.D. in 2016 with Prof. Nigel Smart. He has worked extensively on bringing the theory of secure multi-party computation into practice with more efficient protocols and implementations, as well as related technologies such as oblivious transfer and homomorphic encryption. His work on the popular SPDZ protocol won the best paper award at ESORICS 2013, and now enjoys widespread usage in various implementations.

  • Published:
  • Updated:
URL copied!