Practical secure two-party computation and applications
Secure two-party computation allows two mutually distrusting parties to securely compute a function on their private input data. This has various applications such as privacy-preserving biometric authentication, auctions, common contact discovery, or scheduling of appointments.
In this lecture we survey the main protocols for securely computing arbitrary functions such as Yao?s garbled circuits, the protocol of Goldreich-Micali-Wigderson, homomorphic encryption and arithmetic sharing. We also show techniques and tools that allow to arbitrarily combine these protocols in order to benefit from their respective advantages. An important class of functions is private set intersection for which we show specific protocols whose performance is by orders of magnitudes better than using generic protocols. We conclude with hardware-assisted cryptographic protocols that overcome limitations of software-only protocols and allow solutions with better communication and computation complexities.
- T. Schneider. Practical secure two-party computation and applications. Slides from the EWSCS 2016 course.
- Lecture 1: Introduction [pdf]
- Lecture 2: Private set intersection [pdf]
- Lecture 3: Tools and applications [pdf]
- Lecture 4: Hardware-assisted cryptographic protocols [pdf]
- Videos from the lectures.
May 7, 2016 13:03 Europe/Helsinki (GMT +03:00)
local organizers, ewscs16(at)cs.ioc.ee
EWSCS'16 page: //cs.ioc.ee/ewscs/2016/