Download

Abstract

We study ballot independence for election schemes:

We formally define ballot independence as a cryptographic game and prove that ballot secrecy implies ballot independence.

We introduce a notion of controlled malleability and show that it is sufficient for ballot independence. We also show that non-malleable ballots are sufficient, but not necessary, for ballot independence.

We prove that ballot independence is sufficient for ballot secrecy under practical assumptions.