Secure Multi-Party Computation

Course Outline

Secure two-party computation is motivated by Yao’s millionaires problem: suppose that two millionaires would like to know who is richter without revealing their own wealth. This idea can be formulated more general: Consider Alice has private input x and Bob has input y and they wish to compute the function f(x,y) securely. This lecture gives a comprehensive introduction to secure two and multi-party computation. Basic knowledge in cryptography is required as we will cover the following topics:

  • Security definition of secure two and multi-party computation
  • Yao’s garbled circuit
  • Optimizations for Yao’s garbled circuit
  • General transformations for malicious security
  • Applications of secure two- and multi-party computation
  • Selected state-of-the-art results

General Information

  • First lecture: TBA
  • Instructor: Prof. Dr. Dominique Schröder
  • Lecture: Thursday 10.15 – 11.45, room 02.133-113
  • Tutorial: Monday 16:15 – 17:45, room 02.134-113
  • ECTS credits: 5
  • Language: English
  • Office hours:
  • StudOn