Coercion-Resistant Electronic Elections
From MaRDI portal
Publication:3569101
DOI10.1007/978-3-642-12980-3_2zbMath1284.68247OpenAlexW2986698110MaRDI QIDQ3569101
Markus Jakobsson, Ari Juels, Dario Catalano
Publication date: 17 June 2010
Published in: Towards Trustworthy Elections (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12980-3_2
Related Items
Protecting the privacy of voters: new definitions of ballot secrecy for e-voting, Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm, How (not) to achieve both coercion resistance and cast as intended verifiability in remote evoting, Polynomial runtime and composability, Cast-as-intended: a formal definition and case studies, Short paper: ballot secrecy for liquid democracy, Surveying definitions of election verifiability, One vote is enough for analysing privacy, Surveying global verifiability, Exploiting re-voting in the Helios election system, Efficient VSS free of computational assumption, Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols, Secret, verifiable auctions from elections, Verifiable Elections That Scale for Free, Ceremonies for End-to-End Verifiable Elections, A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting, How to Challenge and Cast Your e-Vote, Designated-verifier linkable ring signatures
