On the Exact Round Complexity of Self Composable Two Party Computation
Offered By: TheIACR via YouTube
Course Description
Overview
Explore a comprehensive analysis of self-composable two-party computation in this 21-minute conference talk presented at Eurocrypt 2017. Delve into the intricacies of concurrent security, consecutive security, and XP security as discussed by authors Sanjam Garg, Susumu Kiyoshima, and Omkant Pandey. Gain insights into their motivation, overall approach, and combined results, including the development of a compiler and simulator. Examine the technical aspects and key remarks before concluding with a summary of this significant contribution to cryptographic research.
Syllabus
Introduction
Concurrent Security
Consecutive Security
XP Security
Motivation
Remarks
Overall Approach
Combined Results
Compiler
Simulator
Technicality
Summary
Taught by
TheIACR
Related Courses
Automata TheoryStanford University via edX Intro to Theoretical Computer Science
Udacity Computing: Art, Magic, Science
ETH Zurich via edX 理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX Quantitative Formal Modeling and Worst-Case Performance Analysis
EIT Digital via Coursera