The authors present the first post-quantum secure end-to-end verifiable e-voting protocol whose security relies on the NP-hard multivariate quadratic (MQ) problem using standard cryptographic primitives.
Generic construction of 1-out-of-n oblivious signatures.IEICE TRANSACTIONS on Information and Systems, 105(11):1836– 1844
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Post-Quantum Secure End-to-End Verifiable E-Voting Protocol Based on Multivariate Polynomials
The authors present the first post-quantum secure end-to-end verifiable e-voting protocol whose security relies on the NP-hard multivariate quadratic (MQ) problem using standard cryptographic primitives.