2021
DOI: 10.1007/s11128-021-03048-6
|View full text |Cite
|
Sign up to set email alerts
|

A quantum voting protocol using single-particle states

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
11
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 22 publications
(14 citation statements)
references
References 32 publications
0
11
0
Order By: Relevance
“…The research task of QMSC is to solve the problem of collaborative computing among multiple mutually distrusted players while ensuring the confidentiality of their privacy inputs. As the study develops in depth, researchers have further applied QSMC to establish secure schemes for various computing scenarios in distributed networks, such as anonymous voting [1,2], private comparison [3,4], and secure multiparty summation [5][6][7]. Within them, quantum secure multiparty summation (QSMS) is the most essential primitive in QSMC, which can be extended to other multiparty computations.…”
Section: Introductionmentioning
confidence: 99%
“…The research task of QMSC is to solve the problem of collaborative computing among multiple mutually distrusted players while ensuring the confidentiality of their privacy inputs. As the study develops in depth, researchers have further applied QSMC to establish secure schemes for various computing scenarios in distributed networks, such as anonymous voting [1,2], private comparison [3,4], and secure multiparty summation [5][6][7]. Within them, quantum secure multiparty summation (QSMS) is the most essential primitive in QSMC, which can be extended to other multiparty computations.…”
Section: Introductionmentioning
confidence: 99%
“…It can enable n participants to jointly calculate a summation without revealing any participant’s secret to others. Quantum summation can be applied to a variety of fields, such as quantum voting [ 15 , 16 , 17 , 18 ], quantum anonymous ranking [ 19 , 20 ], and quantum private equality comparison [ 21 , 22 , 23 ]. Designing efficient and practical quantum summation protocols is thus significant.…”
Section: Introductionmentioning
confidence: 99%
“…It is important to improve its scalability in various voting scenes. Recently, Li et al [24] adopted grouping strategy to improve the efficiency of distributed quantum voting protocol. Hence, it is worth considering how to adopt grouping strategy to improve the practicality of our traveling quantum anonymous voting scheme.…”
Section: Introductionmentioning
confidence: 99%