Classical access structures of ramp secret sharing based on quantum stabilizer codes

Research output: Contribution to journalConference article in Journalpeer-review

1 Citation (Scopus)
19 Downloads (Pure)

Abstract

In this paper, we consider to use the quantum stabilizer codes as secret sharing schemes for classical secrets. We give necessary and sufficient conditions for qualified and forbidden sets in terms of quantum stabilizers. Then, we give a Gilbert–Varshamov-type sufficient condition for existence of secret sharing schemes with given parameters, and by using that sufficient condition, we show that roughly 19% of participants can be made forbidden independently of the size of classical secret, in particular when an n-bit classical secret is shared among n participants having 1-qubit share each. We also consider how much information is obtained by an intermediate set and express that amount of information in terms of quantum stabilizers. All the results are stated in terms of linear spaces over finite fields associated with the quantum stabilizers.

Original languageEnglish
Article number9
JournalQuantum Information Processing
Volume19
Issue number1
Pages (from-to)1-16
Number of pages16
ISSN1570-0755
DOIs
Publication statusPublished - 1 Jan 2020
EventInternational Workshop on Coding and Cryptography - Saint-Jacut-de-la-Mer, France
Duration: 31 Mar 20195 Apr 2019
Conference number: 11
https://www.lebesgue.fr/content/sem2019-WCC-program

Workshop

WorkshopInternational Workshop on Coding and Cryptography
Number11
Country/TerritoryFrance
CitySaint-Jacut-de-la-Mer
Period31/03/201905/04/2019
Internet address

Keywords

  • Gilbert–Varshamov bound
  • Quantum error-correcting code
  • Secret sharing

Fingerprint

Dive into the research topics of 'Classical access structures of ramp secret sharing based on quantum stabilizer codes'. Together they form a unique fingerprint.

Cite this