Webinar - Ankündigung:

am 14. Oktober 2025, wird ein Webinar zum Thema - MATLAB Grader und seine Intergration in ILIAS - stattfinden: hier geht´s zur Anmeldung.

2400088 – Seminar Secure Multipary 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, building on the lecture "Kryptographische Protokolle", we examine modern protocols for secure multiparty computation of arbitrary functions. It is recommended to attend the lecture “Kryptographische Protkolle” before taking this seminar.

Allgemeine Informationen

Wichtige Informationen
Timeline/Deadlines
29.10.2025 15:45 - Kick-off Meeting
16.01.2026: Handouts due
21.01.2026 15:45 - Presentation Topic 1
28.01.2026 15:45 - Presentation Topic 2
04.02.2026 15:45 - Presentation Topic 3
11.02.2026 15:45 - Presentation Topic 4
18.02.2026 15:45 - Presentation Topic 5
Kursprogramm
In this seminar, students prepare a topic and give a 45 minute talk about it, followed by roughly 15 minutes of discussion, accompanied by an extended handout (6-8 pages) covering definitions used and giving an overview of the topic.
The talk should be in the style of a lecture, teaching the assigned topic to the other participants of the seminar.
The talks will be given in english.

Topics:

IKNP OT-Extension
The goal of this presentation is to first motivate the idea behind extending OTs and then explain the OT-extension protocol of Ishai, Kilian, Nissim and Petrank.

Optimizing Garbled Circuits
In this presentation, various improvements on the basic garbled circuit protocol are explained:
the free-XOR optimization
the 2-row-reduction
FleXor
half-gates
(if time allows) Three Halves Make a Whole

The IPS Compiler
In this presentation, the IPS compiler to achieve active security against up to n−1 corruptions (with n parties) is presented.
The compiler combines a protocol that has passive security against n−1 corruptions and a protocol with active security for a honest majority.

The SPDZ Protocol
The goal of this presentation is to explain the SPDZ (pronounced "Speedz") protocol, a highly efficient protocol based on arithmetic secret sharing preprocessing model, where input-independent preprocessing takes place in an offline-phase with computational security, while an information-theoretic online-phase enables fast evaluation.
To this end, first the requirements towards the offline phase and the resulting precomputed values are presented, and then the online phase is explained.
Finally, if time allows, a short overview of the preprocessing phase is given.

Efficient Three-Party Honest Majority MPC against Malicious Adversaries
This presentation shows how to make use of the fact that in a three-party honest majority protocol only a single party can be corrupted.

MPC from Threshold Fully Homomorphic Encryption
This presentation is to explain a way of constructing multiparty computation protocols using threshold fully homomorphic encryption schemes, as well as a construction for an FHE scheme, that can be used in the former construction to obtain a round-efficient MPC scheme.
The presentation focuses on the distributed key-generation and decryption of the FHE scheme.

Sharing Transformation and Dishonest Majority MPC with Packed Secret Sharing
In this presentation, the goal is to understand the new technique called sharing transformation, sparsely packed Shamir sharing and packed Beaver triples. In particular, the presentation should explain how to achieve a communication complexity of O(1) field elements per multiplication gate across all parties in the dishonest majority setting.

Veranstaltungsdaten

Abschluß
Master
Veranstaltungsart
Seminar
Modulart
Wahlfach
Ort
Raum 252 Geb. 50.34
Termin
siehe Infoseite
Zyklus
Block

Allgemein

Sprache
Deutsch
Copyright
All rights reserved

Kontakt

Name
Markus Raiber
Zuständigkeit
Seminarorganisation
E-Mail
markus.raiber@kit.edu
Sprechstunde
auf Anfrage

Verfügbarkeit

Zugriff
Unbegrenzt – wenn online geschaltet
Aufnahmeverfahren
Sie können diesem Kurs direkt beitreten.
Zeitraum für Beitritte
Bis: 1. Nov 2025, 00:00
Freie Plätze
1
Veranstaltungszeitraum
1. Okt 2025 - 31. Mär 2026

Für Kursadministration freigegebene Daten

Daten des Persönlichen Profils
Anmeldename
Vorname
Nachname
E-Mail
Matrikelnummer

Zusätzliche Informationen

Objekt-ID
3604799