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

Remarks on Some Quantum Cryptographic Schemes.

Zhengjun Cao

Published Jan 1, 2009• 0 citations
OpenAlex

Abstract

We remark that the schemes [PhysRevLett.98.020503, PhysRevA.74.012315, PhysRevA.71.022321, PhysRevA.72.012304, PhysRevA.69.052307, PhysRevA.59.1829] are not secret sharing schemes as claimed.

Related papers

A NOTE ON SOME QUANTUM SECRET SHARING SCHEMES

Zhengjun Cao, Olivier Markowitch

We remark that the schemes [S. Gaertner, C. Kurtsiefer, M. Bourennane and H. Weinfurter, Phys. Rev. Lett.98 (2007) 020503; H. Takesue and K. Inoue, Phys. Rev. A74 (2006) 012315; L. Hsu and C. Li, Phys. Rev. A71 (2005) 022321; F. Yan and T. Gao, Phys. Rev. A72 (2005) 012304; L. Xiao, G. Long, F. Deng and J. Pan, Phys. Rev. A69 (2004) 052307; M. Hillery, V. Bužek and A. Berthiaume, Phys. Rev. A59 (1999) 1829] are not secret sharing schemes as claimed.

International Journal of Quantum Information•Apr 1, 2010•1 citation

Analysis of a kind of quantum cryptographic schemes based on secret sharing

Xinglan Zhang, Dongyao Ji

Science in China. Series G, Physics, mechanics & astronomy/Science in China. Series G, Physics, Mechanics & Astronomy•Aug 7, 2009•13 citations

Matroids and quantum-secret-sharing schemes

Pradeep Kiran Sarvepalli, Robert Raussendorf

A secret-sharing scheme is a cryptographic protocol to distribute a secret state in an encoded form among a group of players such that only authorized subsets of the players can reconstruct the secret. Classically, efficient secret-sharing schemes have been shown to be induced by matroids. Furthermore, access structures of such schemes can be characterized by an excluded minor relation. No such relations are known for quantum secret-sharing schemes. In this paper we take the first steps toward a matroidal characterization of quantum-secret-sharing schemes. In addition to providing a new perspective on quantum-secret-sharing schemes, this characterization has important benefits. While previous work has shown how to construct quantum-secret-sharing schemes for general access structures, these schemes are not claimed to be efficient. In this context the present results prove to be useful; they enable us to construct efficient quantum-secret-sharing schemes for many general access structures. More precisely, we show that an identically self-dual matroid that is representable over a finite field induces a pure-state quantum-secret-sharing scheme with information rate $1$.

arXiv:0909.0549•Physical Review A•May 24, 2010•34 citations

Quantum Secret Sharing Scheme for Qubits

Takeshi Okada, Hidenori Kuwakado, Masakatu Morii

IEEE International Symposium on Information Theory (ISIT)•Nov 28, 2006•0 citations

Advance Sharing of Quantum Shares for Quantum Secrets

Mamoru Shibata, Ryutaroh Matsumoto

Secret sharing is a cryptographic scheme to encode a secret to multiple shares being distributed to participants, so that only qualified sets of participants can restore the original secret from their shares. When we encode a secret by a secret sharing scheme and distribute shares, sometimes not all participants are accessible, and it is desirable to distribute shares to those participants before a secret information is determined. Secret sharing schemes for classical secrets have been known to be able to distribute some shares before a given secret. Lie et al. found a ((2, 3))-threshold secret sharing for quantum secrets can distribute some shares before a given secret. However, it is unknown whether distributing some shares before a given secret is possible with other access structures of secret sharing for quantum secrets. We propose a quantum secret sharing scheme for quantum secrets that can distribute some shares before a given secret with other access structures.

arXiv:2302.14448•IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Nov 23, 2023•6 citations

Fourier-based Verifiable Function Secret Sharing

Takeshi Koshiba

Function secret sharing is a cryptographic protocol for secure distribution of a secret function. While the notion of function secret sharing is a conceptual extension of secret sharing schemes, it faces difficulties in its constructions. We demonstrate that if we consider function secret sharing schemes for Fourier basis functions then we can enjoy the linear properties of linear secret sharing schemes to construct function secret sharing schemes. In this paper, we construct a verifiable function secret sharing by using Fourier basis functions, where players can verify if the dealer is cheating.

International Symposium on Information Theory and its Applications•Oct 24, 2020•1 citation
A secret-sharing scheme is a cryptographic protocol to distribute a secret state in an encoded form among a group of players such that only authorized subsets of the players can reconstruct the secret. Classically, efficient secret-sharing schemes have been shown to be induced by matroids. Furthermore, access structures of such schemes can be characterized by an excluded minor relation. No such relations are known for quantum secret-sharing schemes. In this paper we take the first steps toward a matroidal characterization of quantum-secret-sharing schemes. In addition to providing a new perspective on quantum-secret-sharing schemes, this characterization has important benefits. While previous work has shown how to construct quantum-secret-sharing schemes for general access structures, these schemes are not claimed to be efficient. In this context the present results prove to be useful; they enable us to construct efficient quantum-secret-sharing schemes for many general access structures. More precisely, we show that an identically self-dual matroid that is representable over a finite field induces a pure-state quantum-secret-sharing scheme with information rate 111.
Secret sharing is a cryptographic scheme to encode a secret to multiple shares being distributed to participants, so that only qualified sets of participants can restore the original secret from their shares. When we encode a secret by a secret sharing scheme and distribute shares, sometimes not all participants are accessible, and it is desirable to distribute shares to those participants before a secret information is determined. Secret sharing schemes for classical secrets have been known to be able to distribute some shares before a given secret. Lie et al. found a ((2, 3))-threshold secret sharing for quantum secrets can distribute some shares before a given secret. However, it is unknown whether distributing some shares before a given secret is possible with other access structures of secret sharing for quantum secrets. We propose a quantum secret sharing scheme for quantum secrets that can distribute some shares before a given secret with other access structures.
Function secret sharing is a cryptographic protocol for secure distribution of a secret function. While the notion of function secret sharing is a conceptual extension of secret sharing schemes, it faces difficulties in its constructions. We demonstrate that if we consider function secret sharing schemes for Fourier basis functions then we can enjoy the linear properties of linear secret sharing schemes to construct function secret sharing schemes. In this paper, we construct a verifiable function secret sharing by using Fourier basis functions, where players can verify if the dealer is cheating.