An Implementation of a Universally Verifiable Electronic Voting Scheme Based on Shuffling

DOI10.1007/3-540-36504-4_2zbMath1275.94028OpenAlexW1603776707MaRDI QIDQ2995360

Jun Furukawa, Satoshi Obana, Kazue Sako, Kengo Mori, Hiroshi Miyauchi

Publication date: 20 April 2011

Published in: Financial Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-36504-4_2

zbMATH Keywords

shufflevotingprivacyelectionzero-knowledge proofmix-net

Mathematics Subject Classification ID

Voting theory (91B12) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (4)

A verifiable secret shuffle of homomorphic encryptions ⋮ Privacy and verifiability in voting systems: methods, developments and trends ⋮ A Commitment-Consistent Proof of a Shuffle ⋮ Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security

This page was built for publication: An Implementation of a Universally Verifiable Electronic Voting Scheme Based on Shuffling