Controlled teleportation of an arbitrary n-qubit quantum information using quantum secret sharing of classical message

2006 ◽  
Vol 352 (1-2) ◽  
pp. 55-58 ◽  
Author(s):  
Zhan-jun Zhang
Keyword(s):  
Quantum Information ◽  
Secret Sharing ◽  
Quantum Secret Sharing ◽  
Controlled Teleportation

scholarly journals Multiparty weighted threshold quantum secret sharing based on the Chinese remainder theorem to share quantum information

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Yao-Hsin Chou ◽  
Guo-Jyun Zeng ◽  
Xing-Yu Chen ◽  
Shu-Yu Kuo
Keyword(s):  
Quantum Information ◽  
Phase Shift ◽  
Quantum State ◽  
Secret Sharing ◽  
Chinese Remainder Theorem ◽  
Security Analysis ◽  
Quantum Secret Sharing ◽  
Security Protocol ◽  
Multiple Quantum ◽  
Cryptographic Primitive

AbstractSecret sharing is a widely-used security protocol and cryptographic primitive in which all people cooperate to restore encrypted information. The characteristics of a quantum field guarantee the security of information; therefore, many researchers are interested in quantum cryptography and quantum secret sharing (QSS) is an important research topic. However, most traditional QSS methods are complex and difficult to implement. In addition, most traditional QSS schemes share classical information, not quantum information which makes them inefficient to transfer and share information. In a weighted threshold QSS method, each participant has each own weight, but assigning weights usually costs multiple quantum states. Quantum state consumption will therefore increase with the weight. It is inefficient and difficult, and therefore not able to successfully build a suitable agreement. The proposed method is the first attempt to build multiparty weighted threshold QSS method using single quantum particles combine with the Chinese remainder theorem (CRT) and phase shift operation. The proposed scheme allows each participant has its own weight and the dealer can encode a quantum state with the phase shift operation. The dividing and recovery characteristics of CRT offer a simple approach to distribute partial keys. The reversibility of phase shift operation can encode and decode the secret. The proposed weighted threshold QSS scheme presents the security analysis of external attacks and internal attacks. Furthermore, the efficiency analysis shows that our method is more efficient, flexible, and simpler to implement than traditional methods.

scholarly journals Localizing and excluding quantum information; or, how to share a quantum secret in spacetime

Quantum ◽  
2019 ◽  
Vol 3 ◽  
pp. 196
Author(s):  
Patrick Hayden ◽  
Alex May
Keyword(s):  
Quantum Information ◽  
Quantum System ◽  
Secret Sharing ◽  
Quantum Secret Sharing ◽  
Secret Sharing Scheme ◽  
Access Structures ◽  
Sharing Scheme ◽  
Assembly Tasks ◽  
Quantum Secret Sharing Scheme

When can quantum information be localized to each of a collection of spacetime regions, while also excluded from another collection of regions? We answer this question by defining and analyzing the localize-exclude task, in which a quantum system must be localized to a collection of authorized regions while also being excluded from a set of unauthorized regions. This task is a spacetime analogue of quantum secret sharing, with authorized and unauthorized regions replacing authorized and unauthorized sets of parties. Our analysis yields the first quantum secret sharing scheme for arbitrary access structures for which the number of qubits required scales polynomially with the number of authorized sets. We also study a second related task called state-assembly, in which shares of a quantum system are requested at sets of spacetime points. We fully characterize the conditions under which both the localize-exclude and state-assembly tasks can be achieved, and give explicit protocols. Finally, we propose a cryptographic application of these tasks which we call party-independent transfer.

An information theoretical model for quantum secret sharing schemes

2005 ◽  
Vol 5 (1) ◽  
pp. 68-79 ◽  
Author(s):  
H. Imai ◽  
J. Mueller-Quade ◽  
A.C.A. Nascimento ◽  
P. Tuyls ◽  
A. Winter
Keyword(s):  
Quantum Information ◽  
Theoretical Model ◽  
Secret Sharing ◽  
Quantum Secret Sharing ◽  
Error Correcting Codes ◽  
Secret Sharing Schemes ◽  
Secret Sharing Scheme ◽  
Sharing Scheme ◽  
Quantum Error ◽  
Quantum Secret Sharing Scheme

Similarly to earlier models for quantum error correcting codes, we introduce a quantum information theoretical model for quantum secret sharing schemes. This model provides new insights into the theory of quantum secret sharing. By using our model, among other results, we give a shorter proof of Gottesman's theorem that the size of the shares in a quantum secret sharing scheme must be as large as the secret itself. Also, we introduced approximate quantum secret sharing schemes and showed robustness of quantum secret sharing schemes by extending Gottesman's theorem to the approximate case.

REEXAMINING THE SECURITY OF THE RECONSTRUCTION PHASE OF THE HILLERY-BUZĚK-BERTHIAUME QUANTUM SECRET-SHARING PROTOCOL

2009 ◽  
Vol 07 (07) ◽  
pp. 1357-1362
Author(s):  
YU-GUANG YANG ◽  
WEI-FENG CAO ◽  
QIAO-YAN WEN
Keyword(s):  
Quantum Information ◽  
Secret Sharing ◽  
Quantum Secret Sharing ◽  
Secret Key ◽  
Participant Attack ◽  
Secret Reconstruction ◽  
Almost All

The participant attack is the most serious threat for quantum secret-sharing protocols. However, it is only during the transmission of quantum information carriers that attention is paid to this kind of attack in the existing quantum secret-sharing protocols. The security considerations of the secret reconstruction phase of quantum secret-sharing protocols against this kind of attack are neglected. We demonstrate our viewpoint by taking the scheme of Hillery, Buzěk, and Berthiaume (HBB) [Phys. Rev. A59 (1999) 18–29] as an example. By telling a lie in the reconstruction phase, a dishonest participant can easily attain the entire secret key instead of eavesdropping during the transmission awkwardly, whereas the honest one cannot judge whether the dishonest one tells the truth and the obtained secret random key is identical to what the secret distributor owns because of lack of verification mechanism in the HBB protocol. It is not difficult to find that almost all the quantum secret-sharing protocols have such disadvantages. Our viewpoint presented may be useful for the design of other similar protocols.

High-capacity three-party quantum secret sharing with superdense coding

2009 ◽  
Vol 18 (11) ◽  
pp. 4690-4694 ◽  
Author(s):  
Gu Bin ◽  
Li Chuan-Qi ◽  
Xu Fei ◽  
Chen Yu-Lin
Keyword(s):  
Secret Sharing ◽  
High Capacity ◽  
Quantum Secret Sharing ◽  
Superdense Coding
Sign in / Sign up

Export Citation Format

Share Document