A new post-quantum voting protocol based on physical laws
From MaRDI portal
Publication:2101594
DOI10.1007/s11128-022-03628-0OpenAlexW4291274243WikidataQ114849333 ScholiaQ114849333MaRDI QIDQ2101594
Publication date: 6 December 2022
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-022-03628-0
physical lawspost-quantum securityactive defenseelectronic voting protocolpassive defensethree-pass protocol
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum anonymous voting with anonymity check
- The dining cryptographers problem: Unconditional sender and recipient untraceability
- Post-quantum RSA
- Grover meets Simon -- quantumly attacking the FX-construction
- Fundamentals of quantum information. Quantum computation, communication, decoherence and all that
- Towards quantum-based privacy and voting
- Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound
- Implementing Grover oracles for quantum key search on AES and LowMC
- Quantum attacks on some Feistel block ciphers
- Quantum voting scheme with Greenberger-Horne-Zeilinger states
- Quantum voting scheme based on locally indistinguishable orthogonal product states
- A secure quantum voting scheme based on quantum group blind signature
- Using Bernstein-Vazirani algorithm to attack block ciphers
- A Homomorphic LWE Based E-voting Scheme
- Receipt-free secret-ballot elections (extended abstract)
- Breaking Symmetric Cryptosystems Using Quantum Period Finding
- Multi-Authority Secret-Ballot Elections with Linear Work
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Introduction to post-quantum cryptography
- A practical secret voting scheme for large scale elections
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Anonymous Transmissions
