@techreport{Smyth19-Athena-voting-system,
  author = {Ben Smyth},
  title = {{Athena:}}
        # {{ A verifiable, coercion-resistant voting system with linear complexity}},
  year = {2019},
  month = {July},
  number = {2019/761},
  institution = {Cryptology ePrint Archive},
  url = {https://publications.bensmyth.com/2019-Athena-voting-system/},
  url-pdf = {https://publications.bensmyth.com/files/Smyth19-Athena-voting-system.pdf},
  url-bib = {https://publications.bensmyth.com/files/Smyth19-Athena-voting-system.bib},
  url-yaml = {https://publications.bensmyth.com/files/Smyth19-Athena-voting-system.yml},
  url-md = {https://publications.bensmyth.com/files/Smyth19-Athena-voting-system.md},
  note = {Cryptology ePrint Archive version: https://eprint.iacr.org/2019/761/},
  keywords = {Civitas, Cobra, coercion resistance, complexity, elections, election scheme, electronic voting, e-voting, Juels Catalao Jakobsson, linear, linear complexity, privacy, provable security, secrecy, Selections, voting},
  abstract = {Seminal work by Juels, Catalano \& Jakobsson delivered a verifiable, coercion-resistant voting system with quadratic complexity. This manuscript attempts to advance the state-of-the-art by delivering a voting system with equivalent security and linear complexity.}
}