Improvement of Efficient Multiparty Quantum Secret Sharing Based on Bell States and Continuous Variable Operations

2014 ◽  
Vol 53 (7) ◽  
pp. 2231-2235 ◽  
Author(s):  
Gan Gao
2007 ◽  
Vol 24 (12) ◽  
pp. 3312-3315 ◽  
Author(s):  
Han Lian-Fang ◽  
Liu Yi-Min ◽  
Yuan Hao ◽  
Zhang Zhan-Jun

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

2011 ◽  
Vol 284 (6) ◽  
pp. 1711-1713 ◽  
Author(s):  
Tian-Yin Wang ◽  
Qiao-Yan Wen ◽  
Fu-Chen Zhu

2018 ◽  
Vol 32 (25) ◽  
pp. 1850294 ◽  
Author(s):  
Bingren Chen ◽  
Wei Yang ◽  
Liusheng Huang

A recent paper proposed a semi-quantum secret sharing (SQSS) scheme based on Bell states [A. Yin et al., Mod. Phys. Lett. B. https://doi.org/10.1142/S0217984917501500 ]. This protocol was presumed that only the sender has the quantum power and all participants perform classical operations. However, we find this protocol is not that secure as it is expected. We can utilize the intercept-resend method to attack this scheme. Then, we give an improvement strategy based on semi-quantum key distribution, which ensures that the new scheme resists the attack we have proposed.


2020 ◽  
Vol 10 (7) ◽  
pp. 2411
Author(s):  
Yijun Wang ◽  
Bing Jia ◽  
Yun Mao ◽  
Xuelin Wu ◽  
Ying Guo

Quantum secret sharing (QSS) can usually realize unconditional security with entanglement of quantum systems. While the usual security proof has been established in theoretics, how to defend against the tolerable channel loss in practices is still a challenge. The traditional ( t , n ) threshold schemes are equipped in situation where all participants have equal ability to handle the secret. Here we propose an improved ( t , n ) threshold continuous variable (CV) QSS scheme using weak coherent states transmitting in a chaining channel. In this scheme, one participant prepares for a Gaussian-modulated coherent state (GMCS) transmitted to other participants subsequently. The remaining participants insert independent GMCS prepared locally into the circulating optical modes. The dealer measures the phase and the amplitude quadratures by using double homodyne detectors, and distributes the secret to all participants respectively. Special t out of n participants could recover the original secret using the Lagrange interpolation and their encoded random numbers. Security analysis shows that it could satisfy the secret sharing constraint which requires the legal participants to recover message in a large group. This scheme is more robust against background noise due to the employment of double homodyne detection, which relies on standard apparatuses, such as amplitude and phase modulators, in favor of its potential practical implementations.


Sign in / Sign up

Export Citation Format

Share Document