Receipt-free secret-ballot elections (extended abstract)
From MaRDI portal
Publication:2817648
DOI10.1145/195058.195407zbMath1344.68029OpenAlexW2003593381MaRDI QIDQ2817648
Publication date: 1 September 2016
Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/195058.195407
Specification and verification (program logics, model checking, etc.) (68Q60) Network protocols (68M12)
Related Items
Protecting the privacy of voters: new definitions of ballot secrecy for e-voting, An efficient multi-receipt mechanism for uncoercible anonymous electronic voting, Prêt à voter with Paillier encryption, Efficient cryptosystems from \(2^k\)-th power residue symbols, Electronic jury voting protocols, Provably secure randomized blind signature scheme based on bilinear pairing, Reconciling non-malleability with homomorphic encryption, Secure multiparty computations without computers, Quantum private comparison protocol with the random rotation, Surveying definitions of election verifiability, Privacy and verifiability in voting systems: methods, developments and trends, Explainable arguments, Протоколы дистанционного голосования. I;Remote voting protocols. I, Traceable receipt-free encryption, One vote is enough for analysing privacy, Group homomorphic encryption: characterizations, impossibility results, and applications, Cryptanalysis on Mu-Varadharajan's e-voting schemes, Two Generic Constructions of Probabilistic Cryptosystems and Their Applications, Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol, Benaloh’s Dense Probabilistic Encryption Revisited, A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols, Secret, verifiable auctions from elections, Verifiable Elections That Scale for Free, Ceremonies for End-to-End Verifiable Elections, New receipt-free voting scheme using double-trapdoor commitment, Dissertation A research of information hiding and attachment on digital cash and electronic votes, Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol, A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting, Linearly Homomorphic Encryption from $$\mathsf {DDH}$$, Natural strategic ability, A Commitment-Consistent Proof of a Shuffle, On Constructing Homomorphic Encryption Schemes from Coding Theory, Easy intruder deduction problems with homomorphisms, A new post-quantum voting protocol based on physical laws, General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting, Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
