Open AccessPosted Content
Electronic Jury Voting Protocols.
Alejandro Hevia,Marcos Kiwi +1 more
Reads0
Chats0
TLDR
In this article, a robust and universally verifiable membership testing scheme (MTS) was proposed that allows a collection of voters to cast votes and determine whether their tally belongs to some pre-specified small set (e.g., exceeds a given threshold).Abstract:
This work stresses the fact that all current proposals for electronic voting schemes disclose the final tally of the votes. In certain situations, like jury voting, this may be undesirable. We present a robust and universally verifiable membership testing scheme (MTS) that allows, among other things, a collection of voters to cast votes and determine whether their tally belongs to some pre-specified small set (e.g., exceeds a given threshold)--our scheme discloses no additional information than that implied from the knowledge of such membership. We discuss several extensions of our basic MTS. All the constructions presented combine features of two parallel lines of research concerning electronic voting schemes, those based on MIX-networks and in homomorphic encryption.read more
Citations
More filters
Book ChapterDOI
Multiplicative homomorphic e-voting
TL;DR: A new e-voting scheme based on multiplicative homomorphism is proposed, where in the tallying phase, a decryption is performed to recover the product of the votes, instead of the sum of them.
Proceedings ArticleDOI
Kryvos: Publicly Tally-Hiding Verifiable E-Voting
Nicolas Huber,Ralf Kuesters,Toomas Krips,Julian Liedtke,Johannes Karl Martin Mueller,Daniel Rausch,Pascal Reisert,Andreas Vogt +7 more
TL;DR: Kryvos proposes the first provably secure verifiable e-voting system, called Kryvos, which directly targets publicly tally-hiding elections and provides an extensive evaluation which shows that KryVos is practical and able to handle a large number of candidates, complex voting methods and result functions.
Patent
Integrated shuffle validity proving device, proof integrating device, integrated shuffle validity verifying device, and mix net system
TL;DR: In this paper, an ordinal number κ which is an integer representing an order is provided correspondingly to an integrated shuffle validity proving device (300) which has a permutation proof commitment unit (310).
BBB-Voting: Self-Tallying End-to-End Verifiable 1-out-of- k Blockchain-Based Boardroom Voting
TL;DR: In this paper , the authors present BBB-Voting, an equivalent blockchain-based approach for decentralized voting such as OVN, but in contrast to it, BBBVoting supports 1-out-of-k choices and provides robustness that enables recovery from stalling participants.