Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

A Shuffle Argument Secure in the Generic Model

TheIACR via YouTube

Overview

Explore a talk from Asiacrypt 2016 on shuffle arguments secure in the generic model. Delve into e-voting motivation, simple mix-nets, and CRS-based shuffle arguments. Examine zero-knowledge in the CRS model, bilinear pairings, and various assumptions. Compare non-generic and generic model approaches, focusing on the Generic Bilinear Group Model. Investigate soundness in GBGM, the intuition behind constructing arguments, and subarguments including 1-sparsity. Learn about solving systems of polynomial equations in this cryptographic context.

Syllabus

Intro
A BIT OF MOTIVATION: E-VOTING
SIMPLE MIX-NETS
CRS-BASED SHUFFLE ARGUMENTS
ZERO KNOWLEDGE: CRS MODEL
BILINEAR PAIRINGS
ASSUMPTIONS & PAIRINGS
NON-GENERIC APPROACH
GENERIC MODEL APPROACH
GENERIC BILINEAR GROUP MODEL Meta-Assumption: adversary only has access to
SOUNDNESS IN GBGM
INTUITION: CONSTRUCTING ARGUMENT
SUBARGUMENTS
1-SPARSITY ARGUMENT
SOLVING SYSTEM OF POL. EQUATIONS
SOLVING...

Taught by

TheIACR

Reviews

Start your review of A Shuffle Argument Secure in the Generic Model

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.