Главная
Study mode:
on
1
Intro
2
Reactive computation
3
Garbling scheme (GS)
4
Applications of garbling scheme
5
Insecure garbling scheme Pre-processing
6
Security definition
7
Global view of garbling scheme
8
What can RGS do that GS can't?
9
GS to RGS
10
Vectorised garbling scheme
11
Output encoding string
12
Linking algorithm
13
Reactive garbling scheme
14
Evaluation procedure
15
Confidentiality
16
Toy example
17
Applications Reactive two-party computation Black-box Watchlist
18
Realizing reactive 2PC
19
Enforcing input consistency
20
Preventing selective failure attacks
21
Summary
Description:
Explore the foundations, instantiation, and applications of Reactive Garbling in this 21-minute conference talk by Jesper Buus Nielsen and Samuel Ranellucci at Asiacrypt 2016. Delve into reactive computation, garbling schemes, and their applications. Examine the security definitions, global view, and capabilities of Reactive Garbling Schemes (RGS) compared to traditional Garbling Schemes (GS). Learn about vectorised garbling, output encoding, and the linking algorithm. Understand the evaluation procedure, confidentiality aspects, and a toy example. Discover applications in reactive two-party computation, black-box watchlists, and techniques for enforcing input consistency and preventing selective failure attacks.

Reactive Garbling - Foundation, Instantiation, Application

TheIACR
Add to list