Quantum secret sharing via local operations and classical communication

Yang, Ying-Hui; Gao, Fei; Wu, Xia; Qin, Su Juan; Zuo, Hui Juan; Wen, Qiao Yan

doi:10.1038/srep16967

Cited by 59 publications

(28 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, it is hard to map the quantum state to n quantum states in coding. Later, some other threshold schemes are proposed with different physical characteristics, such as those in [25][26][27] benefit from continuous variable and in [28][29][30] construct from the ability of exactly distinguishing orthogonal multipartite entangled states under restricted local operation and classical communication. Some schemes [31][32][33][34][35] take advantage of the classical (t, n)-SS, which using phase shift operation to embed the secret and shares generated from classical (t, n)-SS into processed quantum state, so after sequential operations, participants can collaborate to recover secret.…”

Section: Comparisons and Discussionmentioning

confidence: 99%

Verifiable threshold quantum secret sharing with sequential communication

Miao

Hou

et al. 2018

Quantum Inf Process

View full text Add to dashboard Cite

A (t, n) threshold quantum secret sharing (QSS) is proposed based on a single d-level quantum system. It enables the (t, n) threshold structure based on Shamir's secret sharing and simply requires sequential communication in d-level quantum system to recover secret. Besides, the scheme provides a verification mechanism which employs an additional qudit to detect cheats and eavesdropping during secret reconstruction, and allows a participant to use the share repeatedly. Analyses show that the proposed scheme is resistant to typical attacks. Moreover, the scheme is scalable in participant number and easier to realize compared to related schemes. More generally, our scheme also presents a generic method to construct new (t, n) threshold QSS schemes based on d-level quantum system from other classical threshold secret sharing.

show abstract

Section: Comparisons and Discussionmentioning

confidence: 99%

Verifiable threshold quantum secret sharing with sequential communication

Miao

Hou

et al. 2018

Quantum Inf Process

View full text Add to dashboard Cite

show abstract

“…Moreover, further appealing applications conflicting the history are improved, such as quantum dense teleportation and coding. As far as this, three appealing branches of quantum cryptography are QKD [18][19][20][21], quantum secret sharing (QSS) [22][23][24][25] and quantum secure direct communication (QSDC) [26][27][28][29].…”

Section: Related Workmentioning

confidence: 99%

Quantum Diffie–Hellman Extended to Dynamic Quantum Group Key Agreement for e-Healthcare Multi-Agent Systems in Smart Cities

Naresh¹,

Nasralla

Reddi

et al. 2020

Sensors

View full text Add to dashboard Cite

Multi-Agent Systems can support e-Healthcare applications for improving quality of life of citizens. In this direction, we propose a healthcare system architecture named smart healthcare city. First, we divide a given city into various zones and then we propose a zonal level three-layered system architecture. Further, for effectiveness we introduce a Multi-Agent System (MAS) in this three-layered architecture. Protecting sensitive health information of citizens is a major security concern. Group key agreement (GKA) is the corner stone for securely sharing the healthcare data among the healthcare stakeholders of the city. For establishing GKA, many efficient cryptosystems are available in the classical field. However, they are yet dependent on the supposition that some computational problems are infeasible. In light of quantum mechanics, a new field emerges to share a secret key among two or more members. The unbreakable and highly secure features of key agreement based on fundamental laws of physics allow us to propose a Quantum GKA (QGKA) technique based on renowned Quantum Diffie–Hellman (QDH). In this, a node acts as a Group Controller (GC) and forms 2-party groups with remaining nodes, establishing a QDH-style shared key per each two-party. It then joins these keys into a single group key by means of a XOR-operation, acting as a usual group node. Furthermore, we extend the QGKA to Dynamic QGKA (DQGKA) by adding join and leave protocol. Our protocol performance was compared with existing QGKA protocols in terms of Qubit efficiency (QE), unitary operation (UO), unitary operation efficiency (UOE), key consistency check (KCC), security against participants attack (SAP) and satisfactory results were obtained. The security analysis of the proposed technique is based on unconditional security of QDH. Moreover, it is secured against internal and external attack. In this way, e-healthcare Multi-Agent System can be robust against future quantum-based attacks.

show abstract

“…In particular, on Hilbert space of d -level quantum system, the X gate and Z gate are represented by ref. 24 …”

Section: Preliminariesmentioning

confidence: 99%

(t, n) Threshold d-Level Quantum Secret Sharing

Song

Liu

Deng

et al. 2017

Sci Rep

View full text Add to dashboard Cite

Most of Quantum Secret Sharing(QSS) are (n, n) threshold 2-level schemes, in which the 2-level secret cannot be reconstructed until all n shares are collected. In this paper, we propose a (t, n) threshold d-level QSS scheme, in which the d-level secret can be reconstructed only if at least t shares are collected. Compared with (n, n) threshold 2-level QSS, the proposed QSS provides better universality, flexibility, and practicability. Moreover, in this scheme, any one of the participants does not know the other participants’ shares, even the trusted reconstructor Bob 1 is no exception. The transformation of the particles includes some simple operations such as d-level CNOT, Quantum Fourier Transform(QFT), Inverse Quantum Fourier Transform(IQFT), and generalized Pauli operator. The transformed particles need not to be transmitted from one participant to another in the quantum channel. Security analysis shows that the proposed scheme can resist intercept-resend attack, entangle-measure attack, collusion attack, and forgery attack. Performance comparison shows that it has lower computation and communication costs than other similar schemes when 2 < t < n − 1.

show abstract

Quantum secret sharing via local operations and classical communication

Cited by 59 publications

References 27 publications

Verifiable threshold quantum secret sharing with sequential communication

Verifiable threshold quantum secret sharing with sequential communication

Quantum Diffie–Hellman Extended to Dynamic Quantum Group Key Agreement for e-Healthcare Multi-Agent Systems in Smart Cities

(t, n) Threshold d-Level Quantum Secret Sharing

Contact Info

Product

Resources

About