An Efficient Pairing Based Shuffle Argument

Explore a presentation on an efficient pairing-based shuffle argument, delivered at Asiacrypt 2017. Delve into the research of Prastudy Fauzi, Helger Lipmaa, Janno Siim, and Michal Zajac as they discuss their paper's findings. Examine key concepts such as e-Voting, non-interactive arguments, and security models. Investigate the research question and current state of the art in the field. Learn about the Generic Bilinear Group Model (GBGM) and understand the main structure of the argument, including permutation matrix, consistency, and same message arguments. Gain insights into the implementation of this efficient shuffle argument and its potential applications in cryptography and secure voting systems.

Motivation: e-Voting
Non-Interactive Argument
Security Model
Research Question
State of The Art
Generic Bilinear Group Model GBGM
Main Structure of Argument
Permutation Matrix Argument
Consistency Argument
Same Message Argument
Implementation