Reducing the Quantum Communication Cost of Quantum Secret Sharing

DOI10.1109/TIT.2012.2205895zbMATH Open1364.81103arXiv1108.5541OpenAlexW2034467573MaRDI QIDQ2989756FDOQ2989756

Authors: Ben Fortescue, Gilad Gour 

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: We demonstrate a new construction for perfect quantum secret sharing (QSS) schemes based on imperfect "ramp" secret sharing combined with classical encryption, in which the individual parties' shares are split into quantum and classical components, allowing the former to be of lower dimension than the secret itself. We show that such schemes can be performed with smaller quantum components and lower overall quantum communication than required for existing methods. We further demonstrate that one may combine both imperfect quantum and imperfect classical secret sharing to produce an overall perfect QSS scheme, and that examples of such scheme (which we construct) can have the smallest quantum and classical share components possible for their access structures, something provably not achievable using perfect underlying schemes. Our construction has significant potential for being adapted to other QSS schemes based on stabiliser codes.

Full work available at URL: https://arxiv.org/abs/1108.5541

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Authentication, digital signatures and secret sharing (94A62)

Cited In (7)

• A novel three-party quantum secret sharing scheme based on Bell state sequential measurements with application in quantum image sharing
• High-capacity (2,3) threshold quantum secret sharing based on asymmetric quantum lossy channels
• Authenticable quantum scheme for secret sharing based on local distinguishability
• Quantum-secret-sharing scheme based on local distinguishability of orthogonal seven-qudit entangled states
• Quantum direct secret sharing with efficient eavesdropping-check and authentication based on distributed fountain codes
• Searching for optimal quantum secret sharing scheme based on local distinguishability
• Computing on quantum shared secrets for general quantum access structures

This page was built for publication: Reducing the Quantum Communication Cost of Quantum Secret Sharing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989756)