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

On a relation between verifiable secret sharing schemes and a class of error-correcting schemes

Ventzislav Nikov, Svetla Nikova⋆

Published Jan 1, 2003• 7 citations
OpenAlex

Related papers

Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes

Claude Crépeau, Daniel Gottesman, Adam Smith

arXiv:quant-ph/0503139•Lecture notes in computer science•Jan 1, 2005•51 citations

Verifiable hybrid secret sharing with few qubits

Victoria Lipińska, Gláucia Murta, Jérémy Ribeiro +1 more

We consider the task of sharing a secret quantum state in a quantum network in a verifiable way. We propose a protocol that achieves this task, while reducing the number of required qubits, as compared to the existing protocols. To achieve this, we combine classical encryption of the quantum secret with an existing verifiable quantum secret sharing scheme based on Calderbank-Shor-Steane quantum error correcting codes. In this way we obtain a verifiable hybrid secret sharing scheme for sharing qubits, which combines the benefits of quantum and classical schemes. Our scheme does not reveal any information to any group of less than half of the $n$ nodes participating in the protocol. Moreover, for sharing a one-qubit state each node needs a quantum memory to store $n$ single-qubit shares, and requires a workspace of at most $3n$ qubits in total to verify the quantum secret. Importantly, in our scheme an individual share is encoded in a single qubit, as opposed to previous schemes requiring $\mathrm{\ensuremath{\Omega}}(logn)$ qubits per share. Furthermore, we define a ramp verifiable hybrid scheme. We give explicit examples of various verifiable hybrid schemes based on existing quantum error correcting codes.

arXiv:1911.09470•Physical Review A•Mar 20, 2020•28 citations

On the classification of ideal secret sharing schemes

Ernest F. Brickell, Daniel M. Davenport

Journal of Cryptology•Jan 1, 1991•294 citations

On the Classification of Ideal Secret Sharing Schemes

Ernest F. Brickell, Daniel M. Davenport

Springer eBooks•Nov 8, 2007•21 citations

Secret Sharing and Error Correcting

Svetla Nikova⋆, Ventzislav Nikov

The goal of this paper is to present a survey on certain recent developments in the theory of unconditional Multi Party Computation (MPC) and Secret Sharing Schemes (SSS) related to Error Correcting Codes.

NATO science for peace and security series. D, Information and communication security•Jan 1, 2009•1 citation

On the classification of ideal secret sharing schemes (extended abstract)

Ernest F. Brickell, Daniel M. Davenport

International Cryptology Conference•Jul 1, 1989•7 citations
We consider the task of sharing a secret quantum state in a quantum network in a verifiable way. We propose a protocol that achieves this task, while reducing the number of required qubits, as compared to the existing protocols. To achieve this, we combine classical encryption of the quantum secret with an existing verifiable quantum secret sharing scheme based on Calderbank-Shor-Steane quantum error correcting codes. In this way we obtain a verifiable hybrid secret sharing scheme for sharing qubits, which combines the benefits of quantum and classical schemes. Our scheme does not reveal any information to any group of less than half of the nnn nodes participating in the protocol. Moreover, for sharing a one-qubit state each node needs a quantum memory to store nnn single-qubit shares, and requires a workspace of at most 3n3n3n qubits in total to verify the quantum secret. Importantly, in our scheme an individual share is encoded in a single qubit, as opposed to previous schemes requiring $\mathrm{\ensuremath{\Omega}}(logn)$ qubits per share. Furthermore, we define a ramp verifiable hybrid scheme. We give explicit examples of various verifiable hybrid schemes based on existing quantum error correcting codes.