Explore a conference talk on optimizing authenticated garbling techniques for faster secure two-party computation. Delve into the research presented by Jonathan Katz, Samuel Ranellucci, Mike Rosulek, and Xiao Wang at Crypto 2018. Learn about the background of authenticated garbling, its application in distributed computation, and the improved authentication methods proposed. Discover how the researchers reduced the copper table and implemented various optimizations to enhance the efficiency of secure two-party computation protocols. Gain insights into cutting-edge cryptographic techniques that contribute to more secure and efficient distributed systems.
Optimizing Authenticated Garbling for Faster Secure Two Party Computation
Overview
Syllabus
Introduction
Background
Authenticated Garbling
Distributed Computation
Improved Authentication
Reduced Copper Table
Optimizations
Taught by
TheIACR
Related Courses
-
Reactive Garbling - Foundation, Instantiation, Application
-
Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ
-
On the Power of Secure Two Party Computation
-
Secure Two-Party Computation - Part II
-
Secure Two-Party Computation - Part I
-
On the Exact Round Complexity of Secure Three Party Computation
