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.
Incoercible Multi Party Computation and Universally Composable Receipt Free Voting
Overview
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
-
Secure Computation: Part II
-
Secure Computation: Part I
-
A Simpler Variant of Universally Composable Security for Standard Multiparty Computation
-
BeleniosRF - A Non-Interactive Receipt-Free Electronic Voting Scheme
-
Computer Aided Verification and Software Synthesis for Secure Multi Party Computation Protocols
-
Multi-Party Computation 2 - Continued
