Multi-party quantum secret sharing based on logical GHZ-type states against collective noise

2021 ◽  
pp. 2150436
Author(s):  
Yi Xiang ◽  
Liang Tang ◽  
Ming-Qiang Bai ◽  
Zhi-Wen Mo

In this paper, we discussed the local preparation methods of two types of multi-qubit logical GHZ-type states using controlled quantum gates, and drew the corresponding quantum circuits. Subsequently, we investigated the measurement-related properties of logical GHZ-type state and thus proposed two multi-party quantum secret sharing schemes against collective-dephasing and collective-rotation noise, respectively. Further, we demonstrated that the schemes can effectively resist some familiar attack strategies. Finally, we analyzed the quantum efficiency of our schemes and made a comprehensive comparison with previous similar schemes.

2003 ◽  
Vol 5 ◽  
pp. 4-4 ◽  
Author(s):  
Andrew M Lance ◽  
Thomas Symul ◽  
Warwick P Bowen ◽  
Tomás Tyc ◽  
Barry C Sanders ◽  
...  

2008 ◽  
Vol 373 (1) ◽  
pp. 65-68 ◽  
Author(s):  
Tian-yin Wang ◽  
Qiao-yan Wen ◽  
Fei Gao ◽  
Song Lin ◽  
Fu-chen Zhu

2014 ◽  
Author(s):  
Hong Lai ◽  
Mehmet A. Orgun ◽  
Liyin Xue ◽  
Jinghua Xiao ◽  
Josef Pieprzyk

2001 ◽  
Vol 64 (4) ◽  
Author(s):  
Anderson Nascimento ◽  
Joern Mueller-Quade ◽  
Hideki Imai

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Yinxiang Long ◽  
Cai Zhang ◽  
Zhiwei Sun

AbstractIn this paper, a standard (3, 5)-threshold quantum secret sharing scheme is presented, in which any three of five participants can resume cooperatively the classical secret from the dealer, but one or two shares contain absolutely no information about the secret. Our scheme can be fulfilled by using the singular properties of maximally entangled 6-qubit states found by Borras. We analyze the scheme’s security by several ways, for example, intercept-and-resend attack, entangle-and-measure attack, and so on. Compared with the other standard threshold quantum secret sharing schemes, our scheme needs neither to use d-level multipartite entangled states, nor to produce shares by classical secret splitting techniques, so it is feasible to be realized.


2011 ◽  
Vol 83 (2) ◽  
pp. 025003 ◽  
Author(s):  
Yu-Guang Yang ◽  
Yi-Wei Teng ◽  
Hai-Ping Chai ◽  
Qiao-Yan Wen

2010 ◽  
Vol 81 (5) ◽  
Author(s):  
Pradeep Sarvepalli ◽  
Robert Raussendorf

2011 ◽  
Vol 11 (5&6) ◽  
pp. 434-443
Author(s):  
Tian-Yin Wang ◽  
Qiao-Yan Wen

The security of a kind of quantum secret sharing with single photons was analyzed recently, and it was shown that almost all the present schemes in this kind were not secure in the sense that an unauthorized set of participants can gain access to the dealer's secret without introducing any error. In this paper, we give a general model for this kind of quantum secret sharing. Then we analyze the conditions that make it immune to all the present attacks. Finally, we give a feasible way to design secure quantum secret sharing schemes in the model.


2005 ◽  
Vol 5 (1) ◽  
pp. 68-79 ◽  
Author(s):  
H. Imai ◽  
J. Mueller-Quade ◽  
A.C.A. Nascimento ◽  
P. Tuyls ◽  
A. Winter

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.


Sign in / Sign up

Export Citation Format

Share Document