A novel quantum scheme for secure two-party distance computation

Quantum secure multi-party computational geometry based on multi-party summation and multiplication

“…, t, so the communication complexity of this protocol is O (t), which is only proportional to t. Note that t is the minimum number of TP required to recover secrets, which can be adjusted according to needs. The results computed by previous protocols [13,14,25] are estimated values, and their accuracy has positive correlation with the size of the database, while the results in our protocol are accurate. In previous protocols, the space of the participants' coordinates was evenly divided into N cells.…”

“…The communication complexity can be defined as the total number of communication times. Under this definition, the complexities of the existing protocols are O (log N) and O (N log N), which are mentioned in [13,14,25]. This is because all three protocols are based on QPQs, and quantum messages need to be exchanged during QPQ.…”

“…Quantum secure multi-party computational geometry (QSMCG) is a branch of QSMC, which mainly contains geometry related problems including the distance between two points [13,14], the intersection of two polygons [15], and the determination of the relative position of geometric objects such as secure points [16], lines [17], and planes [18][19][20][21][22]. At present, the research of QSMCG mainly focuses on quantum secure two-party distance computation (QS2PDC).…”

“…At present, the research of QSMCG mainly focuses on quantum secure two-party distance computation (QS2PDC). In 2017, the QS2PDC protocol was designed by Peng et al [13] for the first time. Shortly after, Chen et al [14] proved that Peng's protocol had security problems and then proposed a new protocol based on the dichotomy and quantum private query (QPQ) [23,24].…”

Efficient quantum private comparison protocol utilizing single photons and rotational encryption

“…They endow quantum computing with absolute security. With this advantage, a huge number of quantum cryptography protocols have been proposed to solve cryptography challenges, embracing quantum secure direct communication (QSDC), [5][6][7][8] quantum secret sharing (QSS), [9][10][11][12] and quantum key distribution (QKD), [13][14][15][16][17] as well as quantum secure multiparty computation (QSMPC), [18][19][20][21][22][23][24] etc.…”