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

Building Geospatial Apps on Postgres, PostGIS, & Citus at Large Scale
Microsoft via YouTube
Unlocking the Power of ML for Your JavaScript Applications with TensorFlow.js
TensorFlow via YouTube
Managing the Reactive World with RxJava - Jake Wharton
ChariotSolutions via YouTube
What's New in Grails 2.0
ChariotSolutions via YouTube
Performance Analysis of Apache Spark and Presto in Cloud Environments
Databricks via YouTube