Encryption mechanisms for receipt-free and perfectly private verifiable elections
From MaRDI portal
Publication:6547983
Recommendations
Cites work
- Belenios: a simple private and verifiable electronic voting system
- Efficent receipt-free voting based on homomorphic encryption
- Efficient Non-interactive Proof Systems for Bilinear Groups
- scientific article; zbMATH DE number 1676659 (Why is no real title available?)
- scientific article; zbMATH DE number 1186931 (Why is no real title available?)
- scientific article; zbMATH DE number 1149900 (Why is no real title available?)
- Linearly homomorphic structure-preserving signatures and their applications
- List signature schemes
- Multi-authority secret-ballot elections with linear work
- Pairing-Friendly Elliptic Curves of Prime Order
- Quasi-adaptive NIZK for linear subspaces revisited
- Receipt-free secret-ballot elections (extended abstract)
- Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
- Signatures on randomizable ciphertexts
- Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
- Traceable receipt-free encryption
Cited in
(4)
This page was built for publication: Encryption mechanisms for receipt-free and perfectly private verifiable elections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547983)