Shuffling and Friends

on YouTube ↗40m

" summary

Paper presents a lattice-based verifiable shuffle for known content that combines Baum et al. commitments and Lyubashevsky–Neven verifiable encryption to build an e‑voting system with return codes; implementation reports 32 ms per vote and 17 KB per vote, about five times faster and ≥50% smaller than del Pino et al. A separate argument replaces N challenges with only two verifier challenges via PM‑evidential polynomials (Phi_i = X^i + Y). A cryptanalysis shows how non‑membership witnesses let an attacker recover Alpha from few non-membership witnesses (and reconstruct CRS‑based secrets) and proposes fixes.

AI-written summary · about

" chapters (15)

1. 0:00Intro
2. 0:30Outline
3. 1:56Overview
4. 3:23Primitives
5. 4:13Shuffle Protocol
6. 6:24Voting System
7. 8:58Performance
8. 10:36Introduction
9. 13:15The general approach
10. 14:55The Verificatum approach
11. 17:03PM-evidential polynomials
12. 22:02Accumulators
13. 28:36Au et al. DUA - The CRS-based construction
14. 30:26The Witness Forgery Attack - Key Idea
15. 31:45Conclusions

" related talks

• 58mKeynote: Who cares about Democracy?A/Prof Vanessa Teague · linux.conf.au 2020
• 39mWhen Is a Proof Actually Not?Vanessa Teague · WOOT '20
• 58mBlockchains and Publicly-Verifiable LotteriesJoseph Bonneau · Blockchain in Society: Applications, Economics, Law, and Ethics 2019
• 01h 08mSecure Computation 1Peter Scholl · Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025
• 01h 03mTowards a White-Box Secure Fiat-Shamir TransformationGal Arnon · Proofs (Simons Institute)
• 01h 09mCrypto + ML 1Shafi Goldwasser · Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025
• 26mPractical, Efficient ZKPs, Economic and Social ProcessesMichael Rabin · KARPfest80
• 13mSurvey of Privacy Solutions for Minimizing MEVMikerah · MEV.wtf Summit 2021