Explore a detailed presentation of the paper "On the Round Complexity of OT Extension" by Sanjam Garg, Mohammad Mahmoody, Daniel Masny, and Izaak Meckler, delivered at Crypto 2018. Delve into the authors' research on oblivious transfer (OT) extension protocols and their round complexity. Gain insights into the latest advancements in cryptographic techniques and their implications for secure multiparty computation. Learn about the challenges and potential solutions in reducing the number of rounds required for OT extension, a crucial component in many cryptographic protocols.
Overview
Syllabus
On the Round Complexity of OT Extension
Taught by
TheIACR
Related Courses
-
Blazing Fast OT for Three-Round UC OT Extension
-
Two-Round Multiparty Secure Computation from Minimal Assumptions
-
Two Round Multiparty Secure Computation Minimizing Public Key Operations
-
The Exact Round Complexity of Secure Computation
-
K-Round Multiparty Computation from K-Round Oblivious Transfer via Garbled Interactive Circuits
-
Malicious for Free OT Extension - The Pipe is the Limit
