Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1904.11114 · Designs Codes and Cryptography

Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets

Ryutaroh Matsumoto

Published Mar 27, 2020• 2 citations
arXivHTMLPDF

Abstract

Abstract We improve the flexibility in designing access structures of quantum stabilizer-based secret sharing schemes for classical secrets, by introducing message randomization in their encoding procedures. We generalize the Gilbert–Varshamov bound for deterministic encoding to randomized encoding of classical secrets. We also provide an explicit example of a ramp secret sharing scheme with which multiple symbols in its classical secret are revealed to an intermediate set, and justify the necessity of incorporating strong security criterion of conventional secret sharing. Finally, we propose an explicit construction of strongly secure ramp secret sharing scheme by quantum stabilizers, which can support twice as large classical secrets as the McEliece–Sarwate strongly secure ramp secret sharing scheme of the same share size and the access structure.

DOI
10.1007/s10623-020-00751-w

Related papers

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

Ryutaroh Matsumoto

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.

arXiv:1811.05217•Quantum Information Processing•Nov 26, 2019•6 citations

Quantum strongly secure ramp secret sharing

Paul Zhang, 隆太郎 松本, Ryutaroh Matsumoto

Quantum secret sharing is a scheme for encoding a quantum state (the secret) into multiple shares and distributing them among several participants. If a sufficient number of shares are put together, then the secret can be fully reconstructed. If an insufficient number of shares are put together however, no information about the secret can be revealed. In quantum ramp secret sharing, partial information about the secret is allowed to leak to a set of participants, called an unqualified set, that cannot fully reconstruct the secret. By allowing this, the size of a share can be drastically reduced. This paper introduces a quantum analog of classical strong security in ramp secret sharing schemes. While the ramp secret sharing scheme still leaks partial information about the secret to unqualified sets of participants, the strong security condition ensures that qudits with critical information can no longer be leaked.

•Jan 1, 2015•6 citations

Generalized semiquantum secret-sharing schemes

Vlad Gheorghiu

We investigate quantum secret-sharing schemes constructed from ${[[n,k,\ensuremath{\delta}]]}_{D}$ nonbinary stabilizer quantum error-correcting codes with carrier qudits of prime dimension $D$. We provide a systematic way of determining the access structure, which completely determines the forbidden and intermediate structures. We then show that the information available to the intermediate structure can be fully described and quantified by what we call the information group, a subgroup of the Pauli group of $k$ qudits, and we employ this group structure to construct a method for hiding the information from the intermediate structure via twirling of the information group and sharing of classical bits between the dealer and the players. Our scheme allows for the transformation of a ramp (intermediate) quantum secret-sharing scheme into a semiquantum perfect secret-sharing scheme with the same access structure as the ramp one but without any intermediate subsets, and is optimal in the amount of classical bits the dealer has to distribute.

arXiv:1204.1072•Physical Review A•May 15, 2012•32 citations

Quantum Stabilizer Codes Can Realize Access Structures Impossible by Classical Secret Sharing

Ryutaroh Matsumoto

We show a simple example of a secret sharing scheme encoding classical secret to quantum shares that can realize an access structure impossible by classical information processing with limitation on the size of each share. The example is based on quantum stabilizer codes.

arXiv:1701.02911•IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2017•4 citations

Reducing the Quantum Communication Cost of Quantum Secret Sharing

Ben Fortescue, Gilad Gour

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 schemes (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 stabilizer codes.

arXiv:1108.5541•IEEE Transactions on Information Theory•Jun 27, 2012•39 citations

Quantum Anonymous Secret Sharing with Permutation Invariant Codes

Varin Sikand, Andrew Nemec

Quantum secret sharing schemes are a family of quantum cryptographic protocols which provide secure quantum encodings, mapping one secret to multiple shares of information such that the original secret cannot be accessed without an authorized set of shares present for decoding. In this work, we describe a protocol that enables sender-anonymity during the secret decoding process. By using permutation-invariant QEC codes along with a set of anonymous quantum transmission algorithms, we construct a quantum anonymous secret sharing scheme that achieves sender-anonymity. We quantify information leakage in ramp quantum secret sharing schemes via the quantum conditional min-entropy, justifying it as a valid measure of leaked information by relating it to the Knill-Laflamme quantum error correction conditions. Finally, we evaluate several permutation-invariant codes using this measure to make observations on the information leakage of intermediate shares for each quantum anonymous secret sharing scheme.

quant-pharXiv:2604.27284•May 1, 2026•0 citations
Abstract We improve the flexibility in designing access structures of quantum stabilizer-based secret sharing schemes for classical secrets, by introducing message randomization in their encoding procedures. We generalize the Gilbert–Varshamov bound for deterministic encoding to randomized encoding of classical secrets. We also provide an explicit example of a ramp secret sharing scheme with which multiple symbols in its classical secret are revealed to an intermediate set, and justify the necessity of incorporating strong security criterion of conventional secret sharing. Finally, we propose an explicit construction of strongly secure ramp secret sharing scheme by quantum stabilizers, which can support twice as large classical secrets as the McEliece–Sarwate strongly secure ramp secret sharing scheme of the same share size and the access structure.
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.
Quantum secret sharing is a scheme for encoding a quantum state (the secret) into multiple shares and distributing them among several participants. If a sufficient number of shares are put together, then the secret can be fully reconstructed. If an insufficient number of shares are put together however, no information about the secret can be revealed. In quantum ramp secret sharing, partial information about the secret is allowed to leak to a set of participants, called an unqualified set, that cannot fully reconstruct the secret. By allowing this, the size of a share can be drastically reduced. This paper introduces a quantum analog of classical strong security in ramp secret sharing schemes. While the ramp secret sharing scheme still leaks partial information about the secret to unqualified sets of participants, the strong security condition ensures that qudits with critical information can no longer be leaked.
We investigate quantum secret-sharing schemes constructed from ${[[n,k,\ensuremath{\delta}]]}_{D}$ nonbinary stabilizer quantum error-correcting codes with carrier qudits of prime dimension DDD. We provide a systematic way of determining the access structure, which completely determines the forbidden and intermediate structures. We then show that the information available to the intermediate structure can be fully described and quantified by what we call the information group, a subgroup of the Pauli group of kkk qudits, and we employ this group structure to construct a method for hiding the information from the intermediate structure via twirling of the information group and sharing of classical bits between the dealer and the players. Our scheme allows for the transformation of a ramp (intermediate) quantum secret-sharing scheme into a semiquantum perfect secret-sharing scheme with the same access structure as the ramp one but without any intermediate subsets, and is optimal in the amount of classical bits the dealer has to distribute.
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 schemes (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 stabilizer codes.
Quantum secret sharing schemes are a family of quantum cryptographic protocols which provide secure quantum encodings, mapping one secret to multiple shares of information such that the original secret cannot be accessed without an authorized set of shares present for decoding. In this work, we describe a protocol that enables sender-anonymity during the secret decoding process. By using permutation-invariant QEC codes along with a set of anonymous quantum transmission algorithms, we construct a quantum anonymous secret sharing scheme that achieves sender-anonymity. We quantify information leakage in ramp quantum secret sharing schemes via the quantum conditional min-entropy, justifying it as a valid measure of leaked information by relating it to the Knill-Laflamme quantum error correction conditions. Finally, we evaluate several permutation-invariant codes using this measure to make observations on the information leakage of intermediate shares for each quantum anonymous secret sharing scheme.