Secure Computation from Elastic Noisy Channels

Explore secure computation techniques using elastic noisy channels in this 24-minute conference talk from Eurocrypt 2016. Delve into the concepts of ideal and real world models, unfair noisy channels, and elastic erasure channels. Learn about receiver and sender security, elastic binary symmetric channels, and channel capacity. Examine the main ideas behind graph code lengths and their implications for secure computation. Gain insights from 25 years of research in this field, presented by Dakshita Khurana, Hemanta K. Maji, and Amit Sahai.

Intro
Ideal World
Real World
Reality
Assumptions
Unfair Noisy Channels (Stronger Model) [DKS99]
25 Years of Research
Warmup: Elastic Erasure Channel
Protocol
Receiver Security
Sender Security
Elastic Binary Symmetric Channel
Capacity of a Channel
Main Idea
Graph Code Length: 2
Graph Code Length: 7
Thank You!