K-Round Multiparty Computation from K-Round Oblivious Transfer via Garbled Interactive Circuits
Offered By: TheIACR via YouTube
Course Description
Overview
Explore a groundbreaking cryptographic research presentation from Eurocrypt 2018 that introduces a novel approach to k-Round Multiparty Computation using k-Round Oblivious Transfer through Garbled Interactive Circuits. Delve into the innovative work of Fabrice Benhamouda and Huijia Lin as they present their findings on this advanced topic in cryptography. Gain insights into the theoretical foundations and potential applications of this cutting-edge research in secure multiparty computation protocols.
Syllabus
k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits
Taught by
TheIACR
Related Courses
Fast Secure Computation for Small Population over the InternetAssociation for Computing Machinery (ACM) via YouTube Stacked Garbling for Disjunctive Zero-Knowledge Proofs
TheIACR via YouTube GAZELLE - A Low Latency Framework for Secure Neural Network Inference
USENIX via YouTube Laconic Conditional Disclosure of Secrets and Applications
IEEE via YouTube Garbling Gadgets for Boolean and Arithmetic Circuits
Association for Computing Machinery (ACM) via YouTube