Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently

M Jawurek, F Kerschbaum, C Orlandi - Proceedings of the 2013 ACM …, 2013 - dl.acm.org
Zero-knowledge protocols are one of the fundamental concepts in modern cryptography and
have countless applications. However, after more than 30 years from their introduction, there …

Atom: Horizontally scaling strong anonymity

A Kwon, H Corrigan-Gibbs, S Devadas… - Proceedings of the 26th …, 2017 - dl.acm.org
Atom is an anonymous messaging system that protects against traffic-analysis attacks.
Unlike many prior systems, each Atom server touches only a small fraction of the total …

sElect: a lightweight verifiable remote voting system

R Küsters, J Müller, E Scapin… - 2016 IEEE 29th …, 2016 - ieeexplore.ieee.org
Modern remote electronic voting systems, such as the prominent Helios system, are
designed to provide vote privacy and verifiability, where, roughly speaking, the latter means …

SoK: techniques for verifiable mix nets

T Haines, J Müller - 2020 IEEE 33rd Computer Security …, 2020 - ieeexplore.ieee.org
Since David Chaum introduced the idea of mix nets 40 years ago, they have become widely
used building blocks for privacy-preserving protocols. Several important applications, such …

Machine-checked proofs of privacy for electronic voting protocols

V Cortier, CC Drăgan, F Dupressoir… - … IEEE Symposium on …, 2017 - ieeexplore.ieee.org
We provide the first machine-checked proof of privacy-related properties (including ballot
privacy) for an electronic voting protocol in the computational model. We target the popular …

Did you mix me? formally verifying verifiable mix nets in electronic voting

T Haines, R Goré, B Sharma - 2021 IEEE Symposium on …, 2021 - ieeexplore.ieee.org
Verifiable mix nets, and specifically proofs of (correct) shuffle, are a fundamental building
block in numerous applications: these zero-knowledge proofs allow the prover to produce a …

A verifiable and practical lattice-based decryption mix net with external auditing

X Boyen, T Haines, J Müller - … : 25th European Symposium on Research in …, 2020 - Springer
Mix nets are often used to provide privacy in modern security protocols, through shuffling.
Some of the most important applications, such as secure electronic voting, require mix nets …

Formal analysis of chaumian mix nets with randomized partial checking

R Küsters, T Truderung, A Vogt - 2014 IEEE Symposium on …, 2014 - ieeexplore.ieee.org
Mix nets with randomized partial checking (RPC mix nets) have been introduced by
Jakobsson, Juels, and Rivest as particularly simple and efficient verifiable mix nets. These …

Efficient culpably sound NIZK shuffle argument without random oracles

P Fauzi, H Lipmaa - Cryptographers' Track at the RSA Conference, 2016 - Springer
One way to guarantee security against malicious voting servers is to use NIZK shuffle
arguments. Up to now, only two NIZK shuffle arguments in the CRS model have been …

Security analysis of accountable anonymity in dissent

E Syta, H Corrigan-Gibbs, SC Weng… - ACM Transactions on …, 2014 - dl.acm.org
Users often wish to communicate anonymously on the Internet, for example, in group
discussion or instant messaging forums. Existing solutions are vulnerable to misbehaving …