A practical secret voting scheme for large scale elections

DOI10.1007/3-540-57220-1_66zbMath1096.68612OpenAlexW1479744988MaRDI QIDQ4341689

Atsushi Fujioka, Kazuo Ohta, Tatsuaki Okamoto

Publication date: 14 January 1998

Published in: Advances in Cryptology — AUSCRYPT '92 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-57220-1_66

Mathematics Subject Classification ID

Voting theory (91B12) Data encryption (aspects in computer science) (68P25)

Related Items

A practical anonymous payment scheme for electronic commerce, A secure anonymous internet electronic voting scheme based on the polynomial, Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm, An efficient multi-receipt mechanism for uncoercible anonymous electronic voting, Electronic jury voting protocols, Provably secure randomized blind signature scheme based on bilinear pairing, Post-quantum online voting scheme, Privacy and verifiability in voting systems: methods, developments and trends, Protocol Verification Via Rigid/Flexible Resolution, 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, Cryptanalysis on Mu-Varadharajan's e-voting schemes, Deducibility constraints and blind signatures, Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols, Identity-based blind signature from lattices, On compositional reasoning about anonymity and privacy in epistemic logic, Invariants for parameterised Boolean equation systems, Computer science and decision theory, A Framework for Automatically Checking Anonymity with μCRL, Conditional Probabilities over Probabilistic and Nondeterministic Systems, Compositional Methods for Information-Hiding, Paths, tree homomorphisms and disequalities for -clauses, Automated Verification of Equivalence Properties of Cryptographic Protocols, A Proof Theoretic Analysis of Intruder Theories, An anonymous and flexible í-out-of-n electronic voting scheme, Round-optimal blind signatures in the plain model from classical and quantum standard assumptions, Unification Modulo Homomorphic Encryption, Digital Signatures, Efficient Round-Optimal Blind Signatures in the Standard Model, Cryptographic Voting — A Gentle Introduction, A new post-quantum voting protocol based on physical laws, The design of a secure and fair sealed-bid auction service, Privacy preserving electronic data gathering, Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model