key: 2013-ballot-independence-for-election-schemes
type: inproceedings
title: Ballot secrecy and ballot independence coincide
authors:
  - Ben Smyth
  - David Bernhard
year: 2013
month: 6
booktitle: "ESORICS'13: 18th European Symposium on Research in Computer Security"
series: LNCS
volume: "8134"
pages: 463--480
publisher: Springer
doi: 10.1007/978-3-642-40203-6_26
description: >-
  This paper presents a formal definition of ballot independence as a cryptographic game and proves
  that ballot secrecy implies ballot independence.
keywords: >-
  ballot independence, ballot secrecy, elections, election schemes, electronic voting, e-voting,
  Helios, controlled malleability, malleability
abstract: >-
  <p>We study ballot independence for election schemes:</p> <ul> <li> We formally define ballot
  independence as a cryptographic game and prove that ballot secrecy implies ballot
  independence.</li> <li> 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.</li> <li> We prove that ballot independence is sufficient
  for ballot secrecy under practical assumptions.</li> </ul> <p>Our results show that ballot
  independence is necessary in election schemes satisfying ballot secrecy. Furthermore, our
  sufficient conditions will enable simpler proofs of ballot secrecy.</p>
supersededby:
  - key: 2014-ballot-independence-for-election-schemes
    text: ePrint article
  - key: 2015-ballot-secrecy
    text: extension
links:
  - file: Smyth13-ballot-independence.pdf
    text: Draft
  - url: https://doi.org/10.1007/978-3-642-40203-6_26
    text: Official version