Jurlind Budurushi, Stephan Neumann, M. Olembo, M. Volkamer
{"title":"Pretty Understandable Democracy - A Secure and Understandable Internet Voting Scheme","authors":"Jurlind Budurushi, Stephan Neumann, M. Olembo, M. Volkamer","doi":"10.1109/ARES.2013.27","DOIUrl":null,"url":null,"abstract":"Internet voting continues to raise interest. A large number of Internet voting schemes are available, both in use, as well as in research literature. While these schemes are all based on different security models, most of these models are not adequate for high-stake elections. Furthermore, it is not known how to evaluate the understandability of these schemes (although this is important to enable voters' trust in the election result). Therefore, we propose and justify an adequate security model and criteria to evaluate understandability. We also describe an Internet voting scheme, Pretty Understandable Democracy, show that it satisfies the adequate security model and that it is more understandable than Pretty Good Democracy, currently the only scheme that also satisfies the proposed security model.","PeriodicalId":302747,"journal":{"name":"2013 International Conference on Availability, Reliability and Security","volume":"90 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Availability, Reliability and Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARES.2013.27","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24
Abstract
Internet voting continues to raise interest. A large number of Internet voting schemes are available, both in use, as well as in research literature. While these schemes are all based on different security models, most of these models are not adequate for high-stake elections. Furthermore, it is not known how to evaluate the understandability of these schemes (although this is important to enable voters' trust in the election result). Therefore, we propose and justify an adequate security model and criteria to evaluate understandability. We also describe an Internet voting scheme, Pretty Understandable Democracy, show that it satisfies the adequate security model and that it is more understandable than Pretty Good Democracy, currently the only scheme that also satisfies the proposed security model.
网络投票继续引起人们的兴趣。大量的互联网投票方案是可用的,无论是在使用中,还是在研究文献中。虽然这些方案都基于不同的安全模型,但大多数模型都不适合高风险的选举。此外,尚不知道如何评估这些方案的可理解性(尽管这对于使选民信任选举结果很重要)。因此,我们提出并证明了一个适当的安全模型和标准来评估可理解性。我们还描述了一个互联网投票方案,Pretty易懂的民主,表明它满足适当的安全模型,并且比Pretty Good Democracy更容易理解,后者是目前唯一满足所提出的安全模型的方案。