How Private Is Anonymous Voting? ——An Introduction to Theory of Shuffle Model
- Pengcheng Su, Peking University
- Time: 2026-06-26 16:00
- Host: Turing Class Research Committee
- Venue: Room 204, Courtyard No.5, Jingyuan
Abstract
The shuffle model serves as an abstract representation of anonymity mechanisms. It assumes the existence of a secure, anonymous channel that randomly permutes all users' messages before publication, capturing a wide range of application scenarios such as anonymous voting, honeypots/honeywords, honey encryption, and Shuffle Differential Privacy (Shuffle-DP).A fundamental question arises: Just how secure is anonymous voting? In an anonymous vote with $n$ participants, is the probability of my message being pinpointed exactly $1/n$? How many bits of information are actually leaked? What if an adversary possesses rich prior knowledge? In this talk, I will introduce the foundations of the shuffle model and present our latest theoretical advancements—a comprehensive framework that provides answers to all of these questions.
Biography
Pengcheng Su is a 2022 Ph.D. student at the School of Computer Science, Peking University, advised by Prof. Ping Wang and Assistant Researcher Haibo Cheng. His research focuses on cryptography and the theory of differential privacy. He also has broad interests in learning theory and other areas of theoretical computer science.