Leakage-Tolerant Computation with Input-Independent Preprocessing

Explore leakage-tolerant computation with input-independent preprocessing in this 20-minute conference talk from Crypto 2014. Delve into multi-party computation in the presence of leakage, examining the model of leakage tolerance and previous work in the field. Learn about one-time preprocessing without leakage, input encoding, and computation with bounded leakage. Discover the main results and key ingredients, including a leakage-tolerant protocol for f(x,x2) assuming no corruptions. Understand the basic idea behind implementing encoding via 2-party leakage-tolerant computation and explore the BGJK encoding process, including steps independent of x and aggregation.

Intro
Multi-Party Computation
MPC in the Presence of Leakage
This Work in a Nutshell
Outline
The Model: Leakage Tolerance Garg-Jain-Sahal, B-Canetti-Halevi
Previous Work
One-time Preprocessing: no leakage
Input Encoding: no leakage
Computation:bounded leakage
Main Result
Ingredient 1: LT Protocol for f(x,x2) Assuming no Corruptions
Basic Idea
Implementing Enc via 2-party LT 12
The BGJK Encoding
Step 1: Independent of x
Step 2: Aggregation