Lindell, Pinkas: „A Proof of Yao's Protocol for Secure Two-Party Computation“

05.09.2018 10:00-11:00

Lindell, Pinkas: „A Proof of Yao's Protocol for Secure Two-Party Computation“

05.09.2018, 10:00 – 11:00

Speaker: Amos Treiber and Christian Weinert, ENCRYPTO, TU Darmstadt | Location: Mornewegstraße 32 (S4|14), Room 5.3.01, Darmstadt

Organizer: Felix Günther and Christian Janson, CROSSING/TU Darmstadt


Abstract

This talk is the fifth one in the seminar series „Reading the Crypto Classics“ for the summer term 2018. The idea of this seminar is to jointly read classical milestone papers in the area of cryptography, to discuss their impact and understand their relevance for current research areas. The seminar is running as an Oberseminar, but at the same time meant to be a joint reading group seminar of the CROSSING Special Interest Group on Advanced Cryptography with all interested CROSSING members being invited to participate.

This issue will cover the paper

Lindell, Pinkas: „A Proof of Yao's Protocol for Secure Two-Party Computation“ (JoC 2009), DOI: 10.1007/s00145-008-9036-8

with the following abstract:

„In the mid 1980s, Yao presented a constant-round protocol for securely computing any two-party functionality in the presence of semi-honest adversaries (FOCS 1986). In this paper, we provide a complete description of Yao’s protocol, along with a rigorous proof of security. Despite the importance of Yao’s protocol to the theory of cryptography and in particular to the field of secure computation, to the best of our knowledge, this is the first time that an explicit proof of security has been published.“

See https://wiki.crossing.tu-darmstadt.de/mediawiki/index.php/Science:_SIGs#Seminar:_Reading_the_Crypto_Classics

zur Liste