Communication Efficient Quantum Secret Sharing

Abstract

In the standard model of quantum secret sharing, typically, one is interested in minimal authorized sets for the reconstruction of the secret. In such a setting, reconstruction requires the communication of all the shares of the corresponding authorized set. If we allow for non-minimal authorized sets, then we can trade off the size of the authorized sets with the amount of communication required for reconstruction. Based on the staircase codes, proposed by Bitar and El Rouayheb, we propose a class of quantum threshold secret sharing schemes that are also communication efficient. We call them $((k,2k-1,d))$ communication efficient quantum secret sharing schemes where $k\le d\le 2k-1$. Using the proposed construction, we can recover a secret of $d-k+1$ qudits by communicating $d$ qudits whereas using the standard $((k,2k-1))$ quantum secret sharing requires $k(d-k+1)$ qudits to be communicated. In other words, to share a secret of one qudit, the standard quantum secret sharing requires $k$ qudits whereas the proposed schemes communicate only $\frac{d}{d-k+1}$ qudits per qudit in the communication complexity. Proposed schemes can reduce communication overheads by a factor $O(k)$ with respect to standard schemes, when $d$ equals $2k-1$. Further, we show that our schemes have optimal communication cost for secret reconstruction.

arXiv comment6 pages, LaTeX. Slightly revised presentation. Corrected proof of Theorem 2, no change in final results

References in corpus (18)

• Quantum Cryptography
• Quantum secret sharing
• A Two-Step Quantum Direct Communication Protocol Using Einstein-Podolsky-Rosen Pair Block
• How to share a quantum secret
• Secure direct communication using entanglement
• Deterministic Secure Direct Communication Using Entanglement
• On the Theory of Quantum Secret Sharing
• Graph States for Quantum Secret Sharing
• Single Qubit Quantum Secret Sharing
• Quantum Cryptography Beyond Quantum Key Distribution
• Practical private database queries based on a quantum key distribution protocol
• Quantum private queries
• Experimental demonstration of four-party quantum secret sharing
• Experimental demonstration of graph-state quantum secret sharing
• Efficient Quantum Circuits for Non-Qubit Quantum Error-Correcting Codes
• Quantum Secret Sharing Schemes and Reversibility of Quantum Operations
• Reducing the quantum communication cost of quantum secret sharing
• Quantum Strongly Secure Ramp Secret Sharing

Cited by in corpus (5)

• Conditional quantum one-time pad
• A quantum secret sharing scheme with verifiable function
• Efficient source-independent quantum conference key agreement
• Advance sharing of quantum shares for quantum secrets
• Exchange-Symmetrized Qudit Bell Bases and Bell-State Distinguishability