Efficient Zero-Knowledge Argument for Correctness of a S

Explore a talk from Eurocrypt 2012 on efficient zero-knowledge arguments for correctness of shuffles. Delve into the authors' motivation, focusing on e-voting applications and EIGamal encryption in mix-nets. Examine the problem of corrupt mix-servers and the proposed solution using zero-knowledge arguments. Learn about key contributions, commitment schemes, and techniques for achieving sublinear cost. Understand the shuffle argument, notation, and multi-exponentiation argument ideas. Discover methods for reducing prover computation and compare implementation results with existing approaches in this 21-minute presentation on cryptographic advancements.

Intro
Motivation - e-voting
Background - EIGamal encryption
Mix-net
Problem: Corrupt mix-server
Solution: Zero-knowledge argument
Our contribution
Commitments
Techniques - Sublinear cost
Shuffle argument
Notation
Multi-exponentiation argument idea
Reducing the prover's computation
Implementation
Comparison