Continuous Variable Quantum Secret Sharing with Chinese Remainder Theorem

2019 ◽  
Vol 58 (12) ◽  
pp. 3986-3997 ◽  
Author(s):  
Ye Kang ◽  
Qin Liao ◽  
Jian Geng ◽  
Ying Guo
2019 ◽  
Vol 10 (1) ◽  
pp. 189
Author(s):  
Ye Kang ◽  
Ying Guo ◽  
Hai Zhong ◽  
Guojun Chen ◽  
Xiaojun Jing

The dishonest participants have many advantages to gain others’ shares by cheating in quantum secret sharing (QSS) protocols. However, the traditional methods such as identity authentication and message authentication can not resolve this problem due to the reason that the share has already been released to dishonest participants before realizing the deception. In this paper, a continuous variable QSS (CVQSS) scheme is proposed with fairness which ensures all participants can acquire or can not acquire the secret simultaneously. The quantum channel based on two-mode squeezing states provides secure communications through which it can send shares successfully, as long as setting the squeezing and modulation parameters according to the quantum channel transmission efficiency and the Shannon information of shares. In addition, the Chinese Remainder Theorem (CRT) can provides tunable threshold structures according to demands of the complex quantum network and the strategy for fairness can be incorporated with other sharing schemes, resulting in perfect compatibility for practical implementations.


2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Yao-Hsin Chou ◽  
Guo-Jyun Zeng ◽  
Xing-Yu Chen ◽  
Shu-Yu Kuo

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.


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

2011 ◽  
Vol 55 (4) ◽  
pp. 573-578 ◽  
Author(s):  
Qian Su ◽  
Rong-Hua Shi ◽  
Ying Guo ◽  
Moon Ho Lee

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