Explore a conference talk on oblivious transfer (OT) extension protocols, focusing on a novel three-round universally composable (UC) OT extension. Learn about secure two-party computation, motivations for OT extension, various protocol types, and round complexity. Discover the presenters' contributions, comparisons with existing methods, and insights into the KOS OT extension. Examine weaker requirements for seed OT protocols, efficiency considerations, and potential improvements. Conclude with open questions and references for further research in this cryptographic field.
Overview
Syllabus
Intro
Secure Two Party Computation
Motivating Oblivious Transfer Extension
Types of Oblivious Transfer Extension Protocols
OT Extension for small number of OTS
Round Complexity of OT Extension
Our Contributions
Comparison
KOS OT Extension (Cont.)
Weaker Requirements from Seed OT Protocol
Attempt towards our Seed OT Protocol (Cont.)
Efficiency
Open questions
References
Taught by
TheIACR
Related Courses
-
Secure Computation: Part I
-
Two-Round Multiparty Secure Computation from Minimal Assumptions
-
On the Round Complexity of OT Extension
-
Statistical Zaps and New Oblivious Transfer Protocols
-
MASCOT - Faster Malicious Arithmetic Secure Computation with Oblivious Transfer
-
On the Exact Round Complexity of Secure Three Party Computation
