YoVDO

Incoercible Multi Party Computation and Universally Composable Receipt Free Voting

Offered By: TheIACR via YouTube

Tags

Conference Talks Courses Cryptography Courses Secure Computation Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the concept of Incoercible Multi Party Computation and its application to universally composable receipt-free voting in this 23-minute conference talk. Delve into the definition of incoercibility, various types of coercion, and the UC C-Incoercibility framework. Learn about a Receipt-Free IUC (CIUC) Protocol and discuss conclusions and open problems in this field of cryptography and secure voting systems.

Syllabus

Intro
Incoercible MPC
Defining Incoercibility
Coercion Types Coercion Request Request to Execute a Different Protocol
The Definition - UC C-Incoercibility
A Receipt-Free IUC (CIUC) Protocol
Conclusions and Open Problems


Taught by

TheIACR

Related Courses

Applied Cryptography
University of Virginia via Udacity FHE and Private Set Intersection
Simons Institute via YouTube Homomorphic Encryption in the SPDZ Protocol for MPC
Simons Institute via YouTube Compressing Vector OLE
Association for Computing Machinery (ACM) via YouTube Secure Outsourced Matrix Computation and Application to Neural Networks
Association for Computing Machinery (ACM) via YouTube