Recommendations
Cites work
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Coercion-resistant electronic elections
- Designated verifier proofs and their applications
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle
- Efficient, Robust and Constant-Round Distributed RSA Key Generation
- How to challenge and cast your e-vote
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 1583771 (Why is no real title available?)
- scientific article; zbMATH DE number 1676659 (Why is no real title available?)
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 177618 (Why is no real title available?)
- scientific article; zbMATH DE number 1256680 (Why is no real title available?)
- scientific article; zbMATH DE number 1304185 (Why is no real title available?)
- Minimum disclosure proofs of knowledge
- New receipt-free voting scheme using double-trapdoor commitment
- Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
Cited in
(6)- How (not) to achieve both coercion resistance and cast as intended verifiability in remote evoting
- Cast-as-intended: a formal definition and case studies
- Internet voting protocol based on improved implicit security
- Strategies for voter-initiated election audits
- Coercion resistant end-to-end voting
- How to challenge and cast your e-vote
This page was built for publication: How to challenge and cast your e-vote
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5857773)
