A novel quantum solution to secure two-party distance computation

Peng, Zhen-wan; Shi, Ronghua; Wang, Pan-hong; Zhang, Shun

doi:10.1007/s11128-018-1911-0

Cited by 8 publications

(4 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…, 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.…”

Section: ) Performancementioning

confidence: 59%

“…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.…”

Section: ) Performancementioning

confidence: 99%

“…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]. In the same year, Peng et al [25] discussed a new QS2PDC protocol, which uses quantum-key-distribution-based (QKD-based) QPQ [26]. Since then, many researches on QS2PDC have focused on QPQ [27], which requires both parties to jointly establish a database, and then obtain the distance by repeatedly querying the database.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

Dou,

Wang,

Liu

et al. 2024

Quantum Sci. Technol.

View full text Add to dashboard Cite

Secure multi-party computational geometry is a branch of secure multi-party computation, which is applied in many important fields. But up to now, the research on how to solve this problem with quantum methods has just started. Therefore, we study the design of quantum secure multi-party computational geometry protocols in this paper. As the foundation, we extend the two-party summation and multiplication protocols proposed by Sutradhar and Om to multi-party protocols. Then we propose three new quantum secure multi-party computational geometry protocols. Our proposed quantum secure two-party distance computation protocol has improvement in efficiency and accuracy. And the proposed quantum secure multi-party polytope volume computation protocol as well as the quantum secure circle-circle intersection area computation protocol are designed for the first time. Moreover, these protocols are designed to use multi-TP, which solves the problem of intermediate value leakage in computation. The correctness, security and performance of all these protocols are analyzed.

show abstract

Section: ) Performancementioning

confidence: 59%

Section: ) Performancementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

Dou,

Wang,

Liu

et al. 2024

Quantum Sci. Technol.

View full text Add to dashboard Cite

show abstract

“…In our protocol, each player knows only his share, even the reconstructor knows only his share. In this protocol, we use some basic operations i.e., protocol-I of Shi et al [51], CN OT gate [37], secure communication [72,6,55,50,61,46,38,75,21,73,64,63,65], entangle state [71,53,54,7,45,52,59,58,57,49,47,42,48,56], Quantum Fourier Transform (QF T ) [19] and Inverse Quantum Fourier Transform (QF T −1 ) [19], to transform the particles. We use a quantum approach in classical secret sharing to combine the benefits of both classical and quantum secret sharing, preventing attacks such as Intercept-Resend (IR), Intercept, Entangle-Measure (EM), Forgery, Collision, and Collusion.…”

Section: Introductionmentioning

confidence: 99%

An Efficient Simulation of Quantum Secret Sharing

Sutradhar¹,

Om²

2021

Preprint

View full text Add to dashboard Cite

In quantum cryptography, quantum secret sharing (QSS) is a fundamental primitive. QSS can be used to create complex and secure multiparty quantum protocols. Existing QSS protocols are either at the (n, n) threshold 2 level or at the (t, n) threshold d level with a trusted player, where n denotes the number of players and t denotes the threshold number of players. Here, we propose a secure d-level QSS protocol for sharing a secret with efficient simulation. This protocol is more secure, flexible, and practical as compared to the existing QSS protocols: (n, n) threshold 2-level and (t, n) threshold d-level with a trusted player. Further, it does not disclose any information about the secret to players. Its security analysis shows that the intercept-resend, intercept, entangle-measure, forgery, collision and collusion attacks are not possible in this protocol.

show abstract