YoVDO

On the Exact Round Complexity of Self Composable Two Party Computation

Offered By: TheIACR via YouTube

Tags

Conference Talks Courses Cryptography Courses Theoretical Computer Science Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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

Applied Cryptography
University of Virginia via Udacity
Cryptography II
Stanford University via Coursera
Coding the Matrix: Linear Algebra through Computer Science Applications
Brown University via Coursera
Cryptography I
Stanford University via Coursera
Unpredictable? Randomness, Chance and Free Will
National University of Singapore via Coursera