On the Round Complexity of OT Extension

On the Round Complexity of OT Extension

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.