YoVDO

Blazing Fast OT for Three-Round UC OT Extension

Offered By: TheIACR via YouTube

Tags

Oblivious Transfer Courses Cryptography Courses Secure Computation Courses Protocol Design Courses

Course Description

Overview

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.

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

Applied Cryptography
University of Virginia via Udacity
Cryptography II
Stanford University via Coursera
Coding the Matrix: Linear Algebra through Computer Science Applications
Brown University via Coursera
Cryptography I
Stanford University via Coursera
Unpredictable? Randomness, Chance and Free Will
National University of Singapore via Coursera