Secure Computation
In the setting of secure multiparty computation, two or more parties with private inputs wish to compute some joint function of their inputs. The security requirements of such a computation are privacy (meaning that the parties learn the output and nothing more), correctness (meaning that the output is correctly distributed), independence of inputs, and more. Due to its generality, secure computation is a central tool in cryptography.
In this seminar, we focus on the case of two parties. Topics will include Oblivious Transfer, Garbled Circuits and Secret-Sharing based MPC, and range from an introduction of the techniques to state-of-the-art protocols.
In this seminar, students have to prepare a topic and give a 60 minute talk about it, accompanied by an extended handout (6-8 pages) covering definitions used and giving an overview of the topic.
The talks will be weekly, on Thrursday from 14:00 to 15:30, the seminar will be in english.
Status: Offline