A practical secret voting scheme for large scale elections
From MaRDI portal
Publication:4341689
Recommendations
Cited in
(65)- Conducting secret ballot elections in computer networks: Problems and solutions
- Cryptanalysis on Mu-Varadharajan's e-voting schemes
- Efficient voting with no selling of votes
- Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm
- A practical anonymous payment scheme for electronic commerce
- A secure voting scheme based on rational self-interest
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
- A new post-quantum voting protocol based on physical laws
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
- Computer science and decision theory
- An efficient multi-receipt mechanism for uncoercible anonymous electronic voting
- Post-quantum online voting scheme
- Electronic voting in a large-scale distributed system
- scientific article; zbMATH DE number 2085426 (Why is no real title available?)
- Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols
- A secure voting scheme for professional organizations for one occasion
- A secure anonymous internet electronic voting scheme based on the polynomial
- Protocol Verification Via Rigid/Flexible Resolution
- An implementation of a mix-net based network voting scheme and its use in a private organization
- A Framework for Automatically Checking Anonymity with μCRL
- scientific article; zbMATH DE number 5630773 (Why is no real title available?)
- Electronic voting scheme based on OT protocol
- Unification modulo homomorphic encryption
- Privacy and verifiability in voting systems: methods, developments and trends
- scientific article; zbMATH DE number 176563 (Why is no real title available?)
- A secure voting system on a public network
- A Verifiable Multi-Authority Secret Election Allowing Abstention from Voting
- scientific article; zbMATH DE number 2044526 (Why is no real title available?)
- Deducibility constraints and blind signatures
- Identity-based blind signature from lattices
- Paths, tree homomorphisms and disequalities for H₁-clauses
- On compositional reasoning about anonymity and privacy in epistemic logic
- Digital signatures
- Cryptographic voting -- a gentle introduction
- Automated verification of equivalence properties of cryptographic protocols
- Conditional Probabilities over Probabilistic and Nondeterministic Systems
- Compositional Methods for Information-Hiding
- A Latency-Free Election Scheme
- An anonymous and flexible í-out-of-n electronic voting scheme
- Information Security
- scientific article; zbMATH DE number 2219227 (Why is no real title available?)
- Financial Cryptography and Data Security
- scientific article; zbMATH DE number 2242705 (Why is no real title available?)
- Efficient round-optimal blind signatures in the standard model
- A Proof Theoretic Analysis of Intruder Theories
- Electronic jury voting protocols
- Provably secure randomized blind signature scheme based on bilinear pairing
- On the (im)possibility of secure ElGamal blind signatures
- A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling
- \textsf{CSI-Otter}: isogeny-based (partially) blind signatures from the class group action with a twist
- The Abe-Okamoto partially blind signature scheme revisited
- Rewriting Privacy
- Practical round-optimal blind signatures in the ROM from standard assumptions
- CSI-Otter: isogeny-based (partially) blind signatures from the class group action with a twist
- Concurrently secure blind Schnorr signatures
- Remote voting protocols. II
- On the unforgeability of the Chaum-Pedersen blind signature scheme
- Pairing-free blind signatures from CDH assumptions
- Pairing-free blind signatures from standard assumptions in the ROM
- Blind signatures from proofs of inequality
- Scan, shuffle, rescan: two-prover election audits with untrusted scanners
- Unforgeability of blind Schnorr in the limited concurrency setting
- The design of a secure and fair sealed-bid auction service
- Privacy preserving electronic data gathering
- Invariants for parameterised Boolean equation systems
This page was built for publication: A practical secret voting scheme for large scale elections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4341689)
