<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Secure and Verifiable Electronic Voting in Practice: the use of vVote in the Victorian State Election · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1504.07098/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1504.07098/feed.xml" rel="self" type="application/rss+xml" /><item><title>Secure and Verifiable Electronic Voting in Practice: the use of vVote in the Victorian State Election — mentioned by rstuart4133</title><link>https://news.ycombinator.com/item?id=17730681</link><guid isPermaLink="false">urn:hackerpapers:mention:1504.07098:17730681</guid><pubDate>Fri, 10 Aug 2018 04:28:54 GMT</pubDate><description>&lt;p&gt;I&amp;#x27;m a software engineer too. Unlike the chorus of voices here I don&amp;#x27;t believe it is impossible to develop good voting software. In fact it&amp;#x27;s already been done. The algorithms required to do it have been invented, so in a sense technical problem and has already been solved. Look up &amp;quot;end to end verifiable voting&amp;quot;. Turns out that Ken Thompson&amp;#x27;s &amp;quot;reflections on trust&amp;quot; don&amp;#x27;t apply to these systems: you can run them on utterly untrusted hardware. They use cryptography or course, and like a lot of cryptography (eg, zero knowledge proofs) it first looks magic, but when you take the time to understand…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1504.07098/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CR</category></item></channel></rss>
