This paper discovers that insecure voting systems can be proven to satisfy global verifiability, a new definition is needed
We explore global verifiability; discovering that voting systems vulnerable to attack can be proven to satisfy that security notion, whereas many secure systems cannot. We conclude that current definitions are unsuitable for the analysis of voting systems, fuelling the exploration for a suitable definition.
@article{Smyth19-surveying-global-verifiability,
title = {{Surveying global verifiability}},
year = {2020}, author = {Ben Smyth}, doi = {10.1016/j.ipl.2020.106000},
url = {./},
url-pdf = {./files/surveying-global-verifiability.pdf},
url-bib = {./files/surveying-global-verifiability.bib},
url-yaml = {./files/surveying-global-verifiability.yml},
url-md = {./files/surveying-global-verifiability.md}
}