3 papers
cs.CR2026
On the Necessity of Pre-agreed Secrets for Thwarting Last-minute Coercion: Vulnerabilities and Lessons From the Loki E-voting Protocol
Jingxin Qiao, Myrto Arapinis, Thomas Zacharias
Coercion-resistance (CR) is a crucial security property in e-voting systems. It ensures that an attacker cannot compel a voter to vote in a specific way by using threats or rewards…
quant-ph2021
A Unified Framework For Quantum Unforgeability
Mina Doosti, Mahshid Delavar, Elham Kashefi +1
In this paper, we continue the line of work initiated by Boneh and Zhandry at CRYPTO 2013 and EUROCRYPT 2013 in which they formally define the notion of unforgeability against quan…
quant-ph2018
Definitions and Analysis of Quantum E-voting Protocols
Myrto Arapinis, Elham Kashefi, Nikolaos Lamprou +1
Recent advances indicate that quantum computers will soon be reality. Motivated by this ever more realistic threat for existing classical cryptographic protocols, researchers have…