Secure multiparty computation
Secure multi-party computation (MPC) has evolved from a theoretical curiosity in the 1980s to a tool for building real systems today. Over years of development, MPC has been one of the most active research areas in both theoretical and applied cryptography. This course introduces several important MPC protocols and methods for improving the efficiency of privacy-preserving applications built using MPC.
Lecturer
Date
19th February ~ 7th May, 2025
Location
| Weekday | Time | Venue | Online | ID | Password |
|---|---|---|---|---|---|
| Wednesday | 13:30 - 16:55 | A14-201 | ZOOM 03 | 242 742 6089 | BIMSA |
Prerequisite
Linear Algebra, Abstract Algebra
Reference
A Pragmatic Introduction to Secure Multi-Party Computation, David Evans, Vladimir Kolesnikov and Mike Rosulek
Audience
Undergraduate
, Advanced Undergraduate
, Graduate
, Postdoc
, Researcher
Video Public
No
Notes Public
No
Language
Chinese
Lecturer Intro
The research of Dongyu Wu focuses on post-quantum cryptography, secure multi-party computation and algebraic combinatorics. He is now working on VOLE based MPC protocols, algebraic cryptanalysis of multivariate-based cryptography, and the structure of stable limit DAHA.