arXiv (All)
open access
Efficient Quantum Voting with Information-Theoretic Security
Ensuring security and integrity of elections constitutes an important challenge with wide-ranging societal implications. Classically, security guarantees can be ensured based on computational complexity, which may be challenged by quantum computers. We show that the use of quantum networks can enabl
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
- A self-tallying quantum anonymous voting protocol for multiple-selection elections#1145002
- A Survey on Quantum-Safe Cryptographic Mechanisms: Building Blocks and Applications#999974
- Need for Coherent Access in Constructing Quantum Cryptography#1154562
- Need for Coherent Access in Constructing Quantum Cryptography#1136750
- Algebraic Kolmogorov--Arnold representation theorem for quantum measurement#1083111
Record · ID 1014435
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