scholarly journals Quantum secret sharing via local operations and classical communication

2015 ◽  
Vol 5 (1) ◽  
Author(s):  
Ying-Hui Yang ◽  
Fei Gao ◽  
Xia Wu ◽  
Su-Juan Qin ◽  
Hui-Juan Zuo ◽  
...  
Keyword(s):  
Secret Sharing ◽  
Quantum Secret Sharing ◽  
Classical Communication

Quantum vernam cipher

2002 ◽  
Vol 2 (1) ◽  
pp. 14-34
Author(s):  
D. W. Leung
Keyword(s):  
Secret Sharing ◽  
Secure Communication ◽  
Quantum Secret Sharing ◽  
Message Authentication ◽  
Classical Communication ◽  
Transmission Errors ◽  
Cipher Text ◽  
Secret Communication ◽  
Quantum Analog

We discuss aspects of secure quantum communication by proposing and analyzing a quantum analog of the Vernam cipher (one-time-pad). The quantum Vernam cipher uses entanglement as the key to encrypt quantum information sent through an insecure quantum channel. First, in sharp contrast with the classical Vernam cipher, the quantum key can be recycled securely. We show that key recycling is intrinsic to the quantum cipher-text, rather than using entanglement as the key. Second, the scheme detects and corrects for arbitrary transmission errors, and it does so using only local operations and classical communication (LOCC) between the sender and the receiver. The application to quantum message authentication is discussed. Quantum secret sharing schemes with similar properties are characterized. We also discuss two general issues, the relation between secret communication and secret sharing, the classification of secure communication protocols.

(t,n) Threshold d-level QSS based on QFT

2020 ◽  
Vol 20 (11&12) ◽  
pp. 957-968
Author(s):  
Sarbani Roy ◽  
Sourav Mukhopadhyay
Keyword(s):  
Quantum Computation ◽  
Secret Sharing ◽  
Fourier Transformation ◽  
Quantum Secret Sharing ◽  
Communication Security ◽  
Local Measurement ◽  
Classical Communication ◽  
Quantum Fourier Transformation ◽  
Important Branch ◽  
Threshold Schemes

Quantum secret sharing (QSS) is an important branch of secure multiparty quantum computation. Several schemes for (n, n) threshold QSS based on quantum Fourier transformation (QFT) have been proposed. Inspired by the flexibility of (t, n) threshold schemes, Song {\it et al.} (Scientific Reports, 2017) have proposed a (t, n) threshold QSS utilizing QFT. Later, Kao and Hwang (arXiv:1803.00216) have identified a {loophole} in the scheme but have not suggested any remedy. In this present study, we have proposed a (t, n)threshold QSS scheme to share a d dimensional classical secret. This scheme can be implemented using local operations (such as QFT, generalized Pauli operators and local measurement) and classical communication. Security of the proposed scheme is described against outsider and participants' eavesdropping.

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.

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

Quantum secret sharing

2002 ◽  
Author(s):  
Guo-Ping Guo ◽  
Guangcan Guo
Keyword(s):  
Secret Sharing ◽  
Quantum Secret Sharing

Local distinguishability of Dicke states in quantum secret sharing

2017 ◽  
Vol 381 (11) ◽  
pp. 998-1002 ◽  
Author(s):  
Jing-Tao Wang ◽  
Gang Xu ◽  
Xiu-Bo Chen ◽  
Xing-Ming Sun ◽  
Heng-Yue Jia
Keyword(s):  
Secret Sharing ◽  
Quantum Secret Sharing ◽  
Dicke States

A SIMPLE AND SECURE QUANTUM SECRET SHARING SCHEME BASED ON PRODUCT STATES

2012 ◽  
Vol 10 (03) ◽  
pp. 1250031 ◽  
Author(s):  
JUAN XU ◽  
HANWU CHEN ◽  
ZHIHAO LIU
Keyword(s):  
Secret Sharing ◽  
Partial Information ◽  
Information Leakage ◽  
Quantum Secret Sharing ◽  
Secret Sharing Scheme ◽  
Distribution Strategy ◽  
Sharing Scheme ◽  
Coding Method ◽  
Orthogonal Set ◽  
Quantum Secret Sharing Scheme

Based on an orthogonal set of product states of two three-state particles, a new quantum secret sharing scheme is proposed, which uses a novel distribution strategy so that continuous and independent measurements, rather than particle-wise coordinated ones, are performed. As a result, it is convenient and efficient to implement. The scheme is also secure against several common attacks and gets rid of partial-information leakage due to the revised coding method. Moreover, the quantitative analysis shows that the security can be further improved by using more product states from appropriate multiple sets.

Sign in / Sign up

Export Citation Format

Share Document