Sharing classical secrets with Calderbank-Shor-Steane codes

From MaRDI portal
Publication:4903097

DOI10.1103/PHYSREVA.80.022321zbMATH Open1255.81129arXiv0905.1661MaRDI QIDQ4903097FDOQ4903097


Authors: Andreas Klappenecker, P. Sarvepalli Edit this on Wikidata


Publication date: 19 January 2013

Published in: Physical Review A (Search for Journal in Brave)

Abstract: In this paper we investigate the use of quantum information to share classical secrets. While every quantum secret sharing scheme is a quantum error correcting code, the converse is not true. Motivated by this we sought to find quantum codes which can be converted to secret sharing schemes. If we are interested in sharing classical secrets using quantum information, then we show that a class of pure [[n,1,d]]q CSS codes can be converted to perfect secret sharing schemes. These secret sharing schemes are perfect in the sense the unauthorized parties do not learn anything about the secret. Gottesman had given conditions to test whether a given subset is an authorized or unauthorized set; they enable us to determine the access structure of quantum secret sharing schemes. For the secret sharing schemes proposed in this paper the access structure can be characterized in terms of minimal codewords of the classical code underlying the CSS code. This characterization of the access structure for quantum secret sharing schemes is thought to be new.


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




Recommendations




Cites Work


Cited In (24)





This page was built for publication: Sharing classical secrets with Calderbank-Shor-Steane codes

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