Communication Efficient Quantum Secret Sharing
Kaushik Senthoor, Pradeep Kiran Sarvepalli

TL;DR
This paper introduces a class of quantum secret sharing schemes that significantly reduce communication costs during secret reconstruction by allowing non-minimal authorized sets, leveraging staircase codes.
Contribution
It proposes communication efficient quantum secret sharing schemes based on staircase codes, reducing communication overhead compared to standard schemes, and proves their optimality.
Findings
Reduces communication complexity by a factor of O(k) for certain parameters.
Allows recovery of a secret with fewer communicated qudits than standard schemes.
Achieves optimal communication cost for secret reconstruction.
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 communication efficient quantum secret sharing schemes where . Using the proposed construction, we can recover a secret of qudits by communicating qudits whereas using the standard quantum secret sharing requires qudits to be…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
