Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Non Interactive Multiparty Computation Without Correlated Randomness

TheIACR via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a groundbreaking paper on non-interactive multiparty computation without correlated randomness in this 23-minute conference talk from Asiacrypt 2017. Delve into the innovative work by Halevi, Ishai, Jain, Komargodski, Sahai, and Yogev as they present their findings on this cutting-edge cryptographic topic. Gain insights into the paper's key components, including the introduction, organizational structure, underlying assumptions, and various extensions. Examine the techniques employed, the concept of honesty in the protocol, and the proof methodology. Investigate the malicious case scenario and the final circuit design. Analyze the interaction patterns discussed and absorb the concluding remarks that highlight the significance of this research in the field of cryptography.

Syllabus

Intro
Non interactive organization
Assumptions
Extensions
Techniques
Honesty
Proof
Malicious case
Final circuit
Interaction patterns
Conclusion

Taught by

TheIACR

Reviews

Start your review of Non Interactive Multiparty Computation Without Correlated Randomness

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.