An implementation of a universally verifiable electronic voting scheme based on shuffling
From MaRDI portal
Publication:2995360
DOI10.1007/3-540-36504-4_2zbMATH Open1275.94028OpenAlexW1603776707MaRDI QIDQ2995360FDOQ2995360
Authors: Jun Furukawa, Hiroshi Miyauchi, Kengo Mori, Satoshi Obana, Kazue Sako 
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
Recommendations
- Verifiable elections that scale for free
- An implementation of a mix-net based network voting scheme and its use in a private organization
- scientific article; zbMATH DE number 1842502
- Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle
Cryptography (94A60) Voting theory (91B12) Authentication, digital signatures and secret sharing (94A62)
Cited In (7)
- Privacy and verifiability in voting systems: methods, developments and trends
- Verifiable elections that scale for free
- Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security
- A verifiable secret shuffle of homomorphic encryptions
- A Commitment-Consistent Proof of a Shuffle
- An Improved Electronic Voting Scheme without a Trusted Random Number Generator
- An implementation of a mix-net based network voting scheme and its use in a private organization
This page was built for publication: An implementation of a universally verifiable electronic voting scheme based on shuffling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2995360)
