Name
Abstract | ||
|---|---|---|
Secure multiparty computational geometry is an essential field of secure multiparty computation, which computes a computation geometric problem without revealing any private information of each party. Secure two-party distance computation is a primitive of secure multiparty computational geometry, which computes the distance between two points without revealing each point’s location information (i.e., coordinate). Secure two-party distance computation has potential applications with high secure requirements in military, business, engineering and so on. In this paper, we present a quantum solution to secure two-party distance computation by subtly using quantum private query. Compared to the classical related protocols, our quantum protocol can ensure higher security and better privacy protection because of the physical principle of quantum mechanics. |
Year | DOI | Venue |
|---|---|---|
2017 | https://doi.org/10.1007/s11128-017-1766-9 | Quantum Information Processing |
Keywords | Field | DocType |
Secure multiparty computation,Computational geometry,Quantum private query,Secure two-party distance | Quantum,Secure multi-party computation,Quantum mechanics,Computational geometry,Commitment scheme,Theoretical computer science,Quantum algorithm,Secure two-party computation,Computation,Physics,Quantum network | Journal |
Volume | Issue | ISSN |
16 | 12 | 1570-0755 |
Citations | PageRank | References |
1 | 0.43 | 7 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhen-wan Peng | 1 | 1 | 1.45 |
| runhua shi | 2 | 25 | 9.65 |
| Hong Zhong | 3 | 90 | 18.46 |
| Jie Cui | 4 | 153 | 21.52 |
| Shun Zhang | 5 | 43 | 9.92 |