Pages that link to "Item:Q3569101"
From MaRDI portal
The following pages link to Coercion-Resistant Electronic Elections (Q3569101):
Displaying 18 items.
- Efficient VSS free of computational assumption (Q663418) (← links)
- Protecting the privacy of voters: new definitions of ballot secrecy for e-voting (Q832400) (← links)
- Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm (Q1643980) (← links)
- Exploiting re-voting in the Helios election system (Q1711416) (← links)
- Secret, verifiable auctions from elections (Q1749541) (← links)
- Designated-verifier linkable ring signatures (Q2104415) (← links)
- How (not) to achieve both coercion resistance and cast as intended verifiability in remote evoting (Q2149844) (← links)
- Surveying global verifiability (Q2203597) (← links)
- Polynomial runtime and composability (Q2392095) (← links)
- Cast-as-intended: a formal definition and case studies (Q2670847) (← links)
- Short paper: ballot secrecy for liquid democracy (Q2670854) (← links)
- Surveying definitions of election verifiability (Q2671813) (← links)
- Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols (Q3304811) (← links)
- A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting (Q3600375) (← links)
- Verifiable Elections That Scale for Free (Q4916026) (← links)
- Ceremonies for End-to-End Verifiable Elections (Q5738760) (← links)
- How to Challenge and Cast Your e-Vote (Q5857773) (← links)
- One vote is enough for analysing privacy (Q6173285) (← links)