A Secure Quantum Voting Scheme Based on Orthogonal Product States

Du, Gang; Zhou, Bao-Min; Ma, Chunguang; Zhang, Shuang; Li, Juyan

doi:10.1007/s10773-021-04763-7

Cited by 6 publications

(1 citation statement)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since then a large number of new protocols for anonymous voting have been designed, but an unconditionally secure and practical quantum voting protocol has remained elusive till this date [14][15][16][17][18]. More recently, there has been a heightened interest in the quantum anonymous voting protocols with a flurry of papers [19][20][21][22][23][24][25][26][27][28][29][30][31][32]. These voting schemes can be classified in different categories on the basis of required quantum resources, nature of ballots, number of candidates, conditions to be satisfied, and so on.…”

Section: Introductionmentioning

confidence: 99%

Quantum anonymous veto: A set of new protocols

Mishra,

Thapliyal,

Parakh

et al. 2021

Preprint

View full text Add to dashboard Cite

We propose a set of protocols for quantum anonymous veto (QAV) broadly categorized under the probabilistic, iterative, and deterministic schemes. The schemes are based upon different types of quantum resources. Specifically, they may be viewed as single photon-based, bipartite and multipartite entangled states-based, orthogonal state-based and conjugate coding-based. The set of the proposed schemes is analyzed for all the requirements of a valid QAV scheme (e.g., privacy, verifiability, robustness, binding, eligibility and correctness). The proposed schemes are observed to be more efficient in comparison to the existing QAV schemes and robust up to the moderate decoherence rate. In addition, a trade-off between correctness and robustness of the probabilistic QAV schemes is observed. Further, the multipartite dense coding based determinsitic QAV scheme is most efficient scheme among the set of schemes proposed here. A bipartite entanglement based iterative scheme employing dense coding is yet another efficient and practical scheme. The intrinsic connections between dining cryptographer-net with anonymous veto-net is also explored in the process of designing new protocols.

show abstract