Главная
Study mode:
on
1
Intro
2
Ideal World
3
Real World
4
Reality
5
Assumptions
6
Unfair Noisy Channels (Stronger Model) [DKS99]
7
25 Years of Research
8
Warmup: Elastic Erasure Channel
9
Protocol
10
Receiver Security
11
Sender Security
12
Elastic Binary Symmetric Channel
13
Capacity of a Channel
14
Main Idea
15
Graph Code Length: 2
16
Graph Code Length: 7
17
Thank You!
Description:
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.

Secure Computation from Elastic Noisy Channels

TheIACR
Add to list