Is your vote truly secret? Ballot Secrecy iff Ballot Independence: Proving necessary conditions and analysing case studies. (arXiv:2311.12977v1 [cs.CR])

We formalise definitions of ballot secrecy and ballot independence by Smyth,
JCS'21 as indistinguishability games in the computational model of security.
These definitions improve upon Smyth, draft '21 to consider a wider class of
voting systems. Both Smyth, JCS'21 and Smyth, draft '21 improve on earlier
works by considering a more realistic adversary model wherein they have access
to the ballot collection. We prove that ballot secrecy implies ballot
independence. We say ballot independence holds if a system has non-malleable …

case case studies class computational conditions definitions draft games secrecy secret security studies systems vote voting voting systems