arXiv (All)
open access
A self-tallying quantum anonymous voting protocol for multiple-selection elections
Self-tallying quantum anonymous voting (SQAV) has drawn considerable attention since it was proposed. However, constrained by design challenges, all existing protocols only accommodate single-selection voting and cannot support multi-selection voting. In this paper, we propose a SQAV protocol with m
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Efficient Quantum Voting with Information-Theoretic Security#1014435
- What does monogamy in higher powers of a correlation measure mean?#1035234
- Quantum Sampling of Random Spanning Trees via Amortized Data Structures#1154574
- A Survey on Quantum-Safe Cryptographic Mechanisms: Building Blocks and Applications#999974
- A Code-Agnostic Graph Neural Network Decoder from the Detection Error Model#1156954
Record · ID 1145002
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive