Stacked Garbling for Disjunctive Zero-Knowledge Proofs

Learn about stacked garbling for disjunctive zero-knowledge proofs in this 22-minute conference talk presented at Eurocrypt 2020. Explore the key concepts behind this cryptographic technique, including garbled circuits, conditional branching, and oblivious transfer. Discover how the authors, David Heath and Vladimir Kolesnikov, introduce a novel approach to handling disjunctive statements in zero-knowledge proofs. Follow the presentation from the introduction and background to the motivation, key ideas, and implementation details. Gain insights into the representation of circuits, encryption methods, and pseudorandom seeds used in this innovative approach. Understand the process of stacked garbling, unstack operations, and the resulting improvements in efficiency. Conclude with an overview of the results and potential applications of this technique in cryptographic protocols.

Introduction
Background
Motivation
Garbled Circuits
Sending the Material
The Key Idea
Representation
Conditional Branching
Two Circuits
Encryption as Strings
Pseudorandom Seeds
Stacked Garbling
oblivious transfer
seed
unstack
results
conclusion