Converting (n, n)-Multiple Secret Sharing into More Friendly Appearance using Chinese Remainder Theorem and Boolean Operations

Author(s):  
Heri Prasetyo ◽  
Didi Rosiyadi
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.


2007 ◽  
Vol 40 (10) ◽  
pp. 2776-2785 ◽  
Author(s):  
Daoshun Wang ◽  
Lei Zhang ◽  
Ning Ma ◽  
Xiaobo Li

2019 ◽  
Vol 473 ◽  
pp. 13-30 ◽  
Author(s):  
Xingxing Jia ◽  
Daoshun Wang ◽  
Daxin Nie ◽  
Xiangyang Luo ◽  
Jonathan Zheng Sun

Sign in / Sign up

Export Citation Format

Share Document