Name
Abstract | ||
|---|---|---|
In a rational protocol, players are supposed to be rational, rather than honest, semi-honest or dishonest. This kind of protocols is practical and important, but seldom researched in quantum computation field. In this paper, a multifunctional rational quantum secure multi-party computation protocol is investigated. Firstly, a rational quantum summation protocol is proposed. Secondly, the protocol is generalized to a rational quantum multi-party computation protocol. The computation which is homomorphic can be resolved by our protocol. Thirdly, from the view of utilities, correctness, Nash equilibrium and fairness, analyses show that our protocol is rational. Besides, our protocol is also proved to be secure, efficient and practical. Our research will promote the development of rational quantum multi-party protocol. |
Year | DOI | Venue |
|---|---|---|
2018 | https://doi.org/10.1007/s11128-018-1967-x | Quantum Information Processing |
Keywords | Field | DocType |
Quantum secure multi-party computation,Rational player,Multifunctional function,Homomorphic computation | Quantum,Homomorphic encryption,Secure multi-party computation,Quantum mechanics,Correctness,Quantum computer,Theoretical computer science,Nash equilibrium,Computation,Physics | Journal |
Volume | Issue | ISSN |
17 | 8 | 1570-0755 |
Citations | PageRank | References |
0 | 0.34 | 12 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhao Dou | 1 | 13 | 3.02 |
| Gang Xu | 2 | 36 | 18.66 |
| Xiu-Bo Chen | 3 | 163 | 36.11 |
| Xinxin Niu | 4 | 211 | 33.93 |
| Yixian Yang | 5 | 1121 | 140.62 |