Making Code Voting Secure Against Insider Threats Using Unconditionally Secure MIX Schemes and Human PSMT Protocols
Autor: | Yvo Desmedt, Stelios Erotokritou |
---|---|
Rok vydání: | 2015 |
Předmět: | |
Zdroj: | Lecture Notes in Computer Science ISBN: 9783319222691 VOTE-ID |
DOI: | 10.1007/978-3-319-22270-7_7 |
Popis: | It is clear to the public that when it comes to privacy, computers and "secure" communication over the Internet cannot fully be trusted. Chaum introduced code voting as a solution for using a possibly infected-by-malware device to cast a vote in an electronic voting application. He trusted the mail system. However, a conspiracy between the mail system and the recipient of the cast ballots breaks privacy. Considering a t-bounded passive adversary, we remove the trust in the mail. We propose both single and multi-seat elections, using PSMT protocols SCN 2012 where with the help of visual aids, humans can carry out mod10 addition correctly with a 99i¾?% degree of accuracy. We introduce an unconditionally secure MIX based on the combinatorics of set systems. |
Databáze: | OpenAIRE |
Externí odkaz: |