Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Journal of Theoretical Physics

A Multi-party Quantum Key Agreement Protocol Based on Shamir’s Secret Sharing

Lei Li, Zhi Li

Published Jul 8, 2019• 6 citations
Publisher
DOI
10.1007/s10773-019-04187-4

Related papers

Unconditional Secure Topology-hiding Broadcast Via Shamir’s Secret Sharing

Bo Mi, Bingqing Wu, Fengtian Kuang +3 more

Secure Multi-Party Computation is a hot topic in recent years. However, though Secure Multi-Party Computation allows each participant to calculate without making their information known to other nodes, the underlying topology of their network is prone to exposure. Inspired by Tal Moran, Bo Mi et al. designed a broadcast protocol based on NTRUEcrypt, which realized topology-hiding but relying on a third party. In view of this shortcoming, we proposed a topology-hiding broadcast protocol based on Shamir's Secret Sharing scheme with self-adaptive paradigm. Security and performance analyses demonstrated that our scheme is unconditional secure and computationally light-weighted.

IEEE Data Driven Control and Learning Systems Conference (DDCLS)•Nov 20, 2020•0 citations

Multi-party Quantum Key Agreement Protocol with Authentication

Yiting Wu, Hong Chang, Gongde Guo +1 more

arXiv:2103.12252•International Journal of Theoretical Physics•Oct 5, 2021•16 citations

Improved Multi-party Quantum Key Agreement with Four-qubit Cluster States

Hussein Abulkasim, Eatedal A. Alabdulkreem, Safwat H. Hamad

Quantum key agreement is a promising key establishing protocol that can play a significant role in securing 5G/6G communication networks. Recently, Liu et al. (Quantum Information Processing 18(8):1-10, 2019) proposed a multi-party quantum key agreement protocol based on four-qubit cluster states was proposed. The aim of their protocol is to agree on a shared secret key among multiple remote participants. Liu et al. employed four-qubit cluster states to be the quantum resources and the X operation to securely share a secret key. In addition, Liu et al.'s protocol guarantees that each participant makes an equal contribution to the final key. The authors also claimed that the proposed protocol is secure against participant attack and dishonest participants cannot generate the final shared key alone. However, we show here that Liu et al. protocol is insecure against a collusive attack, where dishonest participants can retrieve the private inputs of a trustworthy participant without being caught. Additionally, the corresponding modifications are presented to address these security flaws in Liu et al.'s protocol.

Computers, materials & continua/Computers, materials & continua (Print)•Jan 1, 2022•2 citations

Efficient multi-party quantum secret-sharing protocol

Xiangjun Xin, Fan He, Qiu Shujing +2 more

Chinese Journal of Physics•Oct 9, 2024•15 citations

Efficient multi-party computation with collusion-deterred secret sharing

Zhaohong Wang, Ying Luo, Sen-ching S. Cheung

Many secure multiparty computation (SMC) protocols use Shamir's Secret Sharing (SSS) scheme as a building block. Unlike other cryptographic SMC techniques such as garbled circuits (GC), SSS requires no data expansion and achieves information theoretic security. A weakness of SSS is the possibility of collusion attacks from participants. In this paper, we propose an evolutionary game-theoretic (EGT) approach to deter collusion in SSS-based protocols. First, we consider the possibility of detecting the leak of secret data caused by collusion, devise an explicit retaliation mechanism, and show that the evolutionary stable strategy of this game is not to collude if the technology to detect the leakage of secret is readily available. Then, we consider the situation in which data-owners are unaware of the leakage and thereby unable to retaliate. Such behaviors are deterred by injecting occasional fake collusion requests, and detected by a censorship scheme that destroys subliminal communication. Comparison results show that our collusion-deterred SSS system significantly outperforms GC, while game simulations confirm the validity of our EGT framework on modeling collusion behaviors.

IEEE International Conference on Acoustics Speech and Signal Processing•May 1, 2014•12 citations

Dynamic Multi-Party Quantum Key Agreement Protocol Based on Commutative Encryption

Shyam R. Sihare

International Journal of Theoretical Physics•Sep 29, 2022•12 citations
Secure Multi-Party Computation is a hot topic in recent years. However, though Secure Multi-Party Computation allows each participant to calculate without making their information known to other nodes, the underlying topology of their network is prone to exposure. Inspired by Tal Moran, Bo Mi et al. designed a broadcast protocol based on NTRUEcrypt, which realized topology-hiding but relying on a third party. In view of this shortcoming, we proposed a topology-hiding broadcast protocol based on Shamir's Secret Sharing scheme with self-adaptive paradigm. Security and performance analyses demonstrated that our scheme is unconditional secure and computationally light-weighted.
Quantum key agreement is a promising key establishing protocol that can play a significant role in securing 5G/6G communication networks. Recently, Liu et al. (Quantum Information Processing 18(8):1-10, 2019) proposed a multi-party quantum key agreement protocol based on four-qubit cluster states was proposed. The aim of their protocol is to agree on a shared secret key among multiple remote participants. Liu et al. employed four-qubit cluster states to be the quantum resources and the X operation to securely share a secret key. In addition, Liu et al.'s protocol guarantees that each participant makes an equal contribution to the final key. The authors also claimed that the proposed protocol is secure against participant attack and dishonest participants cannot generate the final shared key alone. However, we show here that Liu et al. protocol is insecure against a collusive attack, where dishonest participants can retrieve the private inputs of a trustworthy participant without being caught. Additionally, the corresponding modifications are presented to address these security flaws in Liu et al.'s protocol.
Many secure multiparty computation (SMC) protocols use Shamir's Secret Sharing (SSS) scheme as a building block. Unlike other cryptographic SMC techniques such as garbled circuits (GC), SSS requires no data expansion and achieves information theoretic security. A weakness of SSS is the possibility of collusion attacks from participants. In this paper, we propose an evolutionary game-theoretic (EGT) approach to deter collusion in SSS-based protocols. First, we consider the possibility of detecting the leak of secret data caused by collusion, devise an explicit retaliation mechanism, and show that the evolutionary stable strategy of this game is not to collude if the technology to detect the leakage of secret is readily available. Then, we consider the situation in which data-owners are unaware of the leakage and thereby unable to retaliate. Such behaviors are deterred by injecting occasional fake collusion requests, and detected by a censorship scheme that destroys subliminal communication. Comparison results show that our collusion-deterred SSS system significantly outperforms GC, while game simulations confirm the validity of our EGT framework on modeling collusion behaviors.