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

International Cryptology Conference

On the Classification of Idea Secret Sharing Schemes

Ernest F. Brickell, Daniel M. Davenport

Published Jul 1, 1989• 12 citations
OpenAlex

Related papers

On the Classification of Ideal Secret Sharing Schemes

Ernest F. Brickell, Daniel M. Davenport

Springer eBooks•Nov 8, 2007•22 citations

On the classification of ideal secret sharing schemes

Ernest F. Brickell, Daniel M. Davenport

Journal of Cryptology•Jan 1, 1991•291 citations

Generalized secret sharing

Alexander Dibert

In this thesis we discussed secret haring for infinite secret domains. The first part of the thesis is devoted to the result by Chor and Kushilevitz. We proved an impossibility of secret haring over countable set of secrets and shares. Our result is slightly more general the the one by Chor and Kushilevitz. Also we gave several counterexamples which show an importance of assumptions in our theorem. Later we discussed possible definition of secret sharing over continuum set of secrets. Particularly, using the idea by Gabor Tardos, we constructed a scheme that shows that the definition by Chor and Kushilevitz is ”intuitively incorrect”. Namely, it is possible that an unqualified set of players can reconstruct the secret. We suggested a modified definition and showed that the positive result by Chor and Kushilevitz holds for the new definition. Finally we gave an introduction to Lebesgue-Rokhlin probability spaces and showed that a secret from such spaces can be shared. We suggest a further research in this direction. It seems that the converse is true. Namely, if a secret sharing scheme exists for a secret picked up from a probability space, then this space is Lebesgue-Rokhlin. As a short digression we presented a nice scheme for the situation when a secret is a branch of a binary tree(possible infinite). This scheme seems to be useful as it allows to compute several primitives on a secret without any communication between participants. In the last part of the thesis we presented our concept of perfect uniform non-probabilistic secret sharing, in which we avoid the idea of probability and concentrate on cardinalities. We showed that there exists a perfect uniform non-probabilistic secret sharing scheme for any secret domain and any access structure(possibly infinite).

•Jan 1, 2011•3 citations

Multiparty quantum secret sharing

Zhanjun Zhang, Yong Li, Zhong‐Xiao Man

Based on a quantum secure direct communication (QSDC) protocol [Phys. Rev. A 69 052319 (2004)], we propose a $(n,n)$-threshold scheme of multiparty quantum secret sharing of classical messages (QSSCM) using only single photons. We take advantage of this multiparty QSSCM scheme to establish a scheme of multiparty secret sharing of quantum information (SSQI), in which only all quantum information receivers collaborate can the original qubit be reconstructed. A general idea is also proposed for constructing multiparty SSQI schemes from any QSSCM scheme.

arXiv:quant-ph/0412203•Physical Review A•Apr 11, 2005•476 citations

An Information-theoretic Treatment Of Secret Sharing Schemes

Renato M. Capocelli, Alfredo De Santis, Luisa Gargano +1 more

IEEE International Symposium on Information Theory (ISIT)•Aug 24, 2005•0 citations

Classification of quantum technologies of a secret sharing

Евгений Викторович Василиу, Igor V. Limar

In this paper the classification and the generalized analysisof the most known secret sharing schemes based onquantum technologies have been offered. The classificationhave been carried out by such criteria as physicalprinciples, on which corresponding methods of secretsharing are based and kinds of tasks of information protection,which are being solved by these methods. Perspectivequantum protocols of a secret sharing taking intoaccount the requirements shown by modern quantum cryptography are considered, in particular, an increase ofinformation capacity of protocols by using quantum systemsof large dimension (qudits). The most perspectiveare quantum technologies of secret sharing based on multiparticleentanglement. The certain tasks of informationprotection with using quantum secret sharing are shortlyconsidered, in particular, the many-party controlled teleportationof quantum state to the remote receiver and theprotocols of quantum secure direct communication withthe control of information receiving by the third confidentialparty. The status of modern experimental base oncreation of systems of the quantum secret sharing is analyzed.

Ukrainian Information Security Research Journal•Feb 5, 2014•0 citations
In this thesis we discussed secret haring for infinite secret domains. The first part of the thesis is devoted to the result by Chor and Kushilevitz. We proved an impossibility of secret haring over countable set of secrets and shares. Our result is slightly more general the the one by Chor and Kushilevitz. Also we gave several counterexamples which show an importance of assumptions in our theorem. Later we discussed possible definition of secret sharing over continuum set of secrets. Particularly, using the idea by Gabor Tardos, we constructed a scheme that shows that the definition by Chor and Kushilevitz is ”intuitively incorrect”. Namely, it is possible that an unqualified set of players can reconstruct the secret. We suggested a modified definition and showed that the positive result by Chor and Kushilevitz holds for the new definition. Finally we gave an introduction to Lebesgue-Rokhlin probability spaces and showed that a secret from such spaces can be shared. We suggest a further research in this direction. It seems that the converse is true. Namely, if a secret sharing scheme exists for a secret picked up from a probability space, then this space is Lebesgue-Rokhlin. As a short digression we presented a nice scheme for the situation when a secret is a branch of a binary tree(possible infinite). This scheme seems to be useful as it allows to compute several primitives on a secret without any communication between participants. In the last part of the thesis we presented our concept of perfect uniform non-probabilistic secret sharing, in which we avoid the idea of probability and concentrate on cardinalities. We showed that there exists a perfect uniform non-probabilistic secret sharing scheme for any secret domain and any access structure(possibly infinite).
Based on a quantum secure direct communication (QSDC) protocol [Phys. Rev. A 69 052319 (2004)], we propose a (n,n)(n,n)(n,n)-threshold scheme of multiparty quantum secret sharing of classical messages (QSSCM) using only single photons. We take advantage of this multiparty QSSCM scheme to establish a scheme of multiparty secret sharing of quantum information (SSQI), in which only all quantum information receivers collaborate can the original qubit be reconstructed. A general idea is also proposed for constructing multiparty SSQI schemes from any QSSCM scheme.
In this paper the classification and the generalized analysisof the most known secret sharing schemes based onquantum technologies have been offered. The classificationhave been carried out by such criteria as physicalprinciples, on which corresponding methods of secretsharing are based and kinds of tasks of information protection,which are being solved by these methods. Perspectivequantum protocols of a secret sharing taking intoaccount the requirements shown by modern quantum cryptography are considered, in particular, an increase ofinformation capacity of protocols by using quantum systemsof large dimension (qudits). The most perspectiveare quantum technologies of secret sharing based on multiparticleentanglement. The certain tasks of informationprotection with using quantum secret sharing are shortlyconsidered, in particular, the many-party controlled teleportationof quantum state to the remote receiver and theprotocols of quantum secure direct communication withthe control of information receiving by the third confidentialparty. The status of modern experimental base oncreation of systems of the quantum secret sharing is analyzed.