Multi-Authority Secret-Ballot Elections with Linear Work
From MaRDI portal
Publication:2876888
DOI10.1007/3-540-68339-9_7zbMath1304.94044OpenAlexW2128227627WikidataQ57567966 ScholiaQ57567966MaRDI QIDQ2876888
Matthew Franklin, Ronald Cramer, Berry Schoenmakers, Mordechai M. Yung
Publication date: 20 August 2014
Published in: Advances in Cryptology — EUROCRYPT ’96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-68339-9_7
Related Items (21)
Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment ⋮ Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares ⋮ Electronic jury voting protocols ⋮ Reconciling non-malleability with homomorphic encryption ⋮ Message-Restriction-Free Commitment Scheme Based on Lattice Assumption ⋮ Privacy and verifiability in voting systems: methods, developments and trends ⋮ Information-Theoretic Security Without an Honest Majority ⋮ Group homomorphic encryption: characterizations, impossibility results, and applications ⋮ Leakage-resilient ring signature schemes ⋮ Grid-Obstacle Representations with Connections to Staircase Guarding ⋮ Single authority electronic voting based on elliptic curves ⋮ Benaloh’s Dense Probabilistic Encryption Revisited ⋮ Secret, verifiable auctions from elections ⋮ Ceremonies for End-to-End Verifiable Elections ⋮ New receipt-free voting scheme using double-trapdoor commitment ⋮ Efficient Binary Conversion for Paillier Encrypted Values ⋮ Efficient and Decentralized Polling Protocol for General Social Networks ⋮ On Constructing Homomorphic Encryption Schemes from Coding Theory ⋮ On Application of Elliptic Curves in Some Electronic Voting Protocols ⋮ A new post-quantum voting protocol based on physical laws ⋮ General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting
This page was built for publication: Multi-Authority Secret-Ballot Elections with Linear Work
