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:0905.1661 · Physical Review A

Sharing classical secrets with Calderbank-Shor-Steane codes

Pradeep Kiran Sarvepalli, Andreas Klappenecker

Published Aug 18, 2009• 46 citations
arXivHTMLPDF

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}$ Calderbank-Shor-Steane (CSS) codes can be converted to perfect secret sharing schemes. These secret sharing schemes are perfect in the sense that 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 notable.

DOI
10.1103/physreva.80.022321

Related papers

Communication Efficient Quantum Secret Sharing via Extended CSS Codes

Kaushik Senthoor, Pradeep Kiran Sarvepalli

Recently, a class of quantum secret sharing schemes called communication efficient quantum threshold secret sharing schemes (CE-QTS) was introduced. These schemes reduced the communication cost during secret recovery. In this paper, we introduce a general class of communication efficient quantum secret sharing schemes (CE-QSS) which include both threshold and non-threshold schemes. We propose a framework for constructing CE-QSS schemes to generalize the earlier construction of CE-QTS schemes which was based on the staircase codes. The main component in this framework is a class of quantum codes which we call the extended Calderbank-Shor-Steane codes. These extended CSS codes could have other applications. We derive a bound on communication cost for CE-QSS schemes. Finally, we provide a construction of CE-QSS schemes meeting this bound using the proposed framework.

IEEE Journal on Selected Areas in Communications•Mar 29, 2024•14 citations

Concatenating Extended CSS Codes for Communication Efficient Quantum Secret Sharing

Kaushik Senthoor, Pradeep Kiran Sarvepalli

Recently, a class of quantum secret sharing schemes called communication efficient quantum threshold secret sharing schemes (CE-QTS) was introduced. These schemes reduced the quantum communication cost during secret recovery in quantum threshold secret sharing schemes. However, non-threshold schemes are known to have less storage cost compared to threshold schemes. This motivates us to extend the idea of communication efficiency to non-threshold schemes as well. In this paper, we introduce a general class of communication efficient quantum secret sharing schemes (CE-QSS) which include both threshold and non-threshold schemes. Specifically, we provide a framework for constructing CE-QSS schemes by concatenating a pair of CSS codes. The main component in this framework is a new class of Calderbank-Shor-Steane (CSS) codes called the extended CSS codes.

arXiv:2211.06910•International Symposium on Turbo Codes and Iterative Information Processing•Sep 4, 2023•5 citations

Nonthreshold quantum secret-sharing schemes in the graph-state formalism

Pradeep Kiran Sarvepalli

In a recent work, Markham and Sanders proposed a framework to study quantum secret-sharing (QSS) schemes using graph states. This framework unified three classes of QSS protocols, namely, sharing classical secrets over private and public channels, and sharing quantum secrets. However, previous work on graph-state secret sharing mostly focused on threshold schemes. In this paper, we focus on general access structures. We show how to realize a large class of arbitrary access structures using the graph-state formalism. We show an equivalence between $[[n,1]]$ binary quantum codes and graph-state secret-sharing schemes sharing one bit. We also establish a similar (but restricted) equivalence between a class of $[[n,1]]$ Calderbank-Shor-Steane codes and graph-state QSS schemes sharing one qubit. With these results we are able to construct a large class of graph-state quantum secret-sharing schemes with arbitrary access structures.

arXiv:1202.3433•Physical Review A•Oct 1, 2012•52 citations

Quantum Secure Direct Communication Using Quantum Calderbank-Shor-Steane Error Correcting Codes

吕欣

The notion of quantum secure direct communication (QSDC) has been introduced recently in quantum cryptography as a replacement for quantum key distribution, in which two communication entities exchange secure classical messages without establishing any shared keys previously. In this paper, a quantum secure direct communication scheme using quantum Calderbank-Shor-Steane (CSS) error correction codes is proposed. In the scheme, a secure message is first transformed into a binary error vector and then encrypted (decrypted) via quantum coding (decoding) procedures. An adversary Eve, who has controlled the communication channel, can't recover the secrete messages because she doesn't know the deciphering keys. Security of this scheme is based on the assumption

Journal of Software•Jan 1, 2006•18 citations

Accessing quantum secrets via local operations and classical communication

Vlad Gheorghiu, Barry C. Sanders

Quantum secret-sharing and quantum error-correction schemes rely on multipartite decoding protocols, yet the nonlocal operations involved are challenging and sometimes infeasible. Here we construct a quantum secret-sharing protocol with a reduced number of quantum communication channels between the players. We introduce a scheme based on embedding a classical linear code into a quantum error-correcting code and then mapping the latter to a quantum secret-sharing protocol. In contrast to the Calderbank-Shor-Steane construction, we do not impose any restriction on the classical code; our protocol works with any arbitrary linear code. Our work paves the way towards the more general problem of simplifying the decoding of quantum error-correcting codes.

arXiv:1305.0805•Physical Review A•Aug 30, 2013•26 citations

Quantum secret sharing for general access structures

Adam D. Smith

We explore the conversion of classical secret-sharing schemes to quantum ones, and how this can be used to give efficient QSS schemes for general adversary structures. Our first result is that quantum secret-sharing is possible for any structure for which no two disjoint sets can reconstruct the secret (this was also proved, somewhat differently, by D. Gottesman). To obtain this we show that a large class of linear classical SS schemes can be converted into quantum schemes of the same efficiency. We also give a necessary and sufficient condiion for the direct conversion of classical schemes into quantum ones, and show that all group homomorphic schemes satisfy it.

arXiv:quant-ph/0001087•Jan 24, 2000•57 citations
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{[[n,1,d]]}_{q}[[n,1,d]]q​ Calderbank-Shor-Steane (CSS) codes can be converted to perfect secret sharing schemes. These secret sharing schemes are perfect in the sense that 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 notable.
Recently, a class of quantum secret sharing schemes called communication efficient quantum threshold secret sharing schemes (CE-QTS) was introduced. These schemes reduced the communication cost during secret recovery. In this paper, we introduce a general class of communication efficient quantum secret sharing schemes (CE-QSS) which include both threshold and non-threshold schemes. We propose a framework for constructing CE-QSS schemes to generalize the earlier construction of CE-QTS schemes which was based on the staircase codes. The main component in this framework is a class of quantum codes which we call the extended Calderbank-Shor-Steane codes. These extended CSS codes could have other applications. We derive a bound on communication cost for CE-QSS schemes. Finally, we provide a construction of CE-QSS schemes meeting this bound using the proposed framework.
Recently, a class of quantum secret sharing schemes called communication efficient quantum threshold secret sharing schemes (CE-QTS) was introduced. These schemes reduced the quantum communication cost during secret recovery in quantum threshold secret sharing schemes. However, non-threshold schemes are known to have less storage cost compared to threshold schemes. This motivates us to extend the idea of communication efficiency to non-threshold schemes as well. In this paper, we introduce a general class of communication efficient quantum secret sharing schemes (CE-QSS) which include both threshold and non-threshold schemes. Specifically, we provide a framework for constructing CE-QSS schemes by concatenating a pair of CSS codes. The main component in this framework is a new class of Calderbank-Shor-Steane (CSS) codes called the extended CSS codes.
In a recent work, Markham and Sanders proposed a framework to study quantum secret-sharing (QSS) schemes using graph states. This framework unified three classes of QSS protocols, namely, sharing classical secrets over private and public channels, and sharing quantum secrets. However, previous work on graph-state secret sharing mostly focused on threshold schemes. In this paper, we focus on general access structures. We show how to realize a large class of arbitrary access structures using the graph-state formalism. We show an equivalence between [[n,1]][[n,1]][[n,1]] binary quantum codes and graph-state secret-sharing schemes sharing one bit. We also establish a similar (but restricted) equivalence between a class of [[n,1]][[n,1]][[n,1]] Calderbank-Shor-Steane codes and graph-state QSS schemes sharing one qubit. With these results we are able to construct a large class of graph-state quantum secret-sharing schemes with arbitrary access structures.
The notion of quantum secure direct communication (QSDC) has been introduced recently in quantum cryptography as a replacement for quantum key distribution, in which two communication entities exchange secure classical messages without establishing any shared keys previously. In this paper, a quantum secure direct communication scheme using quantum Calderbank-Shor-Steane (CSS) error correction codes is proposed. In the scheme, a secure message is first transformed into a binary error vector and then encrypted (decrypted) via quantum coding (decoding) procedures. An adversary Eve, who has controlled the communication channel, can't recover the secrete messages because she doesn't know the deciphering keys. Security of this scheme is based on the assumption
Quantum secret-sharing and quantum error-correction schemes rely on multipartite decoding protocols, yet the nonlocal operations involved are challenging and sometimes infeasible. Here we construct a quantum secret-sharing protocol with a reduced number of quantum communication channels between the players. We introduce a scheme based on embedding a classical linear code into a quantum error-correcting code and then mapping the latter to a quantum secret-sharing protocol. In contrast to the Calderbank-Shor-Steane construction, we do not impose any restriction on the classical code; our protocol works with any arbitrary linear code. Our work paves the way towards the more general problem of simplifying the decoding of quantum error-correcting codes.
We explore the conversion of classical secret-sharing schemes to quantum ones, and how this can be used to give efficient QSS schemes for general adversary structures. Our first result is that quantum secret-sharing is possible for any structure for which no two disjoint sets can reconstruct the secret (this was also proved, somewhat differently, by D. Gottesman). To obtain this we show that a large class of linear classical SS schemes can be converted into quantum schemes of the same efficiency. We also give a necessary and sufficient condiion for the direct conversion of classical schemes into quantum ones, and show that all group homomorphic schemes satisfy it.