Reactive Garbling - Foundation, Instantiation, Application

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.

Intro
Reactive computation
Garbling scheme (GS)
Applications of garbling scheme
Insecure garbling scheme Pre-processing
Security definition
Global view of garbling scheme
What can RGS do that GS can't?
GS to RGS
Vectorised garbling scheme
Output encoding string
Linking algorithm
Reactive garbling scheme
Evaluation procedure
Confidentiality
Toy example
Applications Reactive two-party computation Black-box Watchlist
Realizing reactive 2PC
Enforcing input consistency
Preventing selective failure attacks
Summary