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

Journal of Heilongjiang Institute of Science and Technology

Quantum information hiding scheme using non-maximally entangled states

Xiaoyu Li

Published Jan 1, 2006• 0 citations
OpenAlex

Abstract

Quantum cryptography is an active field of modern computer science.Quantum information hiding is an important problem in quantum cryptography.The scheme based on the non-locality of non-maximally entangled states in a two-particle quantum system.Involves coding information in a integral state of the two-particle system in which the two particles are distributed to two persons who are only allowed to perform local operations and classical communications so that the origin information is hidden and it's impossible for two persons to recover it.This paper provides a quantum data hiding scheme using non-maximally entangled states.It's easier to carry out in relative to schemes using maximally entangled states.It is shown that the protocol is more secure and tends to offer a detailed procedure to hide data in computers and the protocol may be useful to keeping secret in network.

Related papers

Hiding information in orthogonal product quantum states

Dexi Zhang, Xiaoyu Li

Abstract: This paper provide a quantum information hiding protocol using orthogonal product states. It is based on the non-locality of an complete orthogonal set of product states in a two-particle quantum system in which each particle has three states. Information is coded in a integral state of the two-particle system. Then the two particles are distributed to two persons who can only perform local operations and classical communications. So the origin information is hidden and it’s impossible for two persons to recover it. We show that our protocol is secure and give a detailed procedure to hide data in computers. Key–Words: Typing manuscripts, LATEX Quantum information science is field which inte-grates quantum physics with information science. It may provide surprising force for people to do things which are impossible in classical information science so far, such as decomposing a large number in polyno-mial time(Shor’s algorithm)[1] and so on. One of the most important applications of quantum information science is quantum cryptography. Quantum cryptog-

International Conference on Computer Engineering and Applications•Jan 1, 2007•1 citation

Quantum data hiding

David Peter Divincenzo, Debbie Leung, Barbara M. Terhal

We expand on our work on quantum data hiding - hiding classical data among parties who are restricted to performing only local quantum operations and classical communication (LOCC). We review our scheme that hides one bit between two parties using Bell (1964) states, and we derive upper and lower bounds on the secrecy of the hiding scheme. We provide an explicit bound showing that multiple bits can be hidden bitwise with our scheme. We give a preparation of the hiding states as an efficient quantum computation that uses at most one ebit of entanglement. A candidate data-hiding scheme that does not use entanglement is presented. We show how our scheme for quantum data hiding can be used in a conditionally secure quantum bit commitment scheme.

arXiv:quant-ph/0103098•IEEE Transactions on Information Theory•Mar 1, 2002•362 citations

Multiparty data hiding of quantum information

Patrick M. Hayden, Debbie Leung, Graeme Smith

We present protocols for multiparty data hiding of quantum information that implement all possible threshold access structures. Closely related to secret sharing, data hiding has a more demanding security requirement: that the data remain secure against unrestricted attacks via local operation and classical communication. In the limit of hiding a large amount of data, our protocols achieve an asymptotic rate of one hidden qubit per local physical qubit. That is, each party holds a share that is the same size as the hidden state to leading order, with accuracy and security parameters incurring an overhead that is asymptotically negligible. The data-hiding states have very unusual entanglement properties, which we briefly discuss.

arXiv:quant-ph/0407152•Physical Review A•Jun 30, 2005•53 citations

Quantum Data Hiding

David Peter Divincenzo, Debbie Leung, Barbara M. Terhal

Abstract — We expand on our work on Quantum Data Hiding [1] – hiding classical data among parties who are restricted to performing only local quantum operations and classical communication (LOCC). We review our scheme that hides one bit between two parties using Bell states, and we derive upper and lower bounds on the secrecy of the hiding scheme. We provide an explicit bound showing that multiple bits can be hidden bitwise with our scheme. We give a preparation of the hiding states as an efficient quantum computation that uses at most one ebit of entanglement. A candidate data hiding scheme that does not use entanglement is presented. We show how our scheme for quantum data hiding can be used in a conditionally secure quantum bit commitment scheme.

•Mar 16, 2001•240 citations

Hiding Classical Data in Multipartite Quantum States

Tilo Eggeling, Reinhard F. Werner

We present a general technique for hiding a classical bit in multipartite quantum states. The hidden bit, encoded in the choice of one of two possible density operators, cannot be recovered by local operations and classical communication without quantum communication. The scheme remains secure if quantum communication is allowed between certain partners, and can be designed for any choice of quantum communication patterns to be secure, but to allow near perfect recovery for all other patterns. No entanglement is needed since the hiding states can be chosen to be separable. A single ebit of prior entanglement is not sufficient to break the scheme.

arXiv:quant-ph/0203004•Physical Review Letters•Aug 13, 2002•179 citations

Quantum data hiding

Barbara M. Terhal

We present a scheme for hiding bits in Bell states that is secure even when the sharers Alice and Bob are allowed to carry out local quantum operations and classical communication. We prove that the information that Alice and Bob can gain about a hidden bit is exponentially small in n, the number of qubits in each share, and can be made arbitrarily small for hiding multiple bits. We indicate an alternative efficient low-entanglement method for preparing the shared quantum states. We discuss how our scheme can be implemented using present-day quantum optics.

Optical Fiber Communication Conference•Jan 1, 2001•0 citations
Quantum cryptography is an active field of modern computer science.Quantum information hiding is an important problem in quantum cryptography.The scheme based on the non-locality of non-maximally entangled states in a two-particle quantum system.Involves coding information in a integral state of the two-particle system in which the two particles are distributed to two persons who are only allowed to perform local operations and classical communications so that the origin information is hidden and it's impossible for two persons to recover it.This paper provides a quantum data hiding scheme using non-maximally entangled states.It's easier to carry out in relative to schemes using maximally entangled states.It is shown that the protocol is more secure and tends to offer a detailed procedure to hide data in computers and the protocol may be useful to keeping secret in network.
Abstract: This paper provide a quantum information hiding protocol using orthogonal product states. It is based on the non-locality of an complete orthogonal set of product states in a two-particle quantum system in which each particle has three states. Information is coded in a integral state of the two-particle system. Then the two particles are distributed to two persons who can only perform local operations and classical communications. So the origin information is hidden and it’s impossible for two persons to recover it. We show that our protocol is secure and give a detailed procedure to hide data in computers. Key–Words: Typing manuscripts, LATEX Quantum information science is field which inte-grates quantum physics with information science. It may provide surprising force for people to do things which are impossible in classical information science so far, such as decomposing a large number in polyno-mial time(Shor’s algorithm)[1] and so on. One of the most important applications of quantum information science is quantum cryptography. Quantum cryptog-
We expand on our work on quantum data hiding - hiding classical data among parties who are restricted to performing only local quantum operations and classical communication (LOCC). We review our scheme that hides one bit between two parties using Bell (1964) states, and we derive upper and lower bounds on the secrecy of the hiding scheme. We provide an explicit bound showing that multiple bits can be hidden bitwise with our scheme. We give a preparation of the hiding states as an efficient quantum computation that uses at most one ebit of entanglement. A candidate data-hiding scheme that does not use entanglement is presented. We show how our scheme for quantum data hiding can be used in a conditionally secure quantum bit commitment scheme.
We present protocols for multiparty data hiding of quantum information that implement all possible threshold access structures. Closely related to secret sharing, data hiding has a more demanding security requirement: that the data remain secure against unrestricted attacks via local operation and classical communication. In the limit of hiding a large amount of data, our protocols achieve an asymptotic rate of one hidden qubit per local physical qubit. That is, each party holds a share that is the same size as the hidden state to leading order, with accuracy and security parameters incurring an overhead that is asymptotically negligible. The data-hiding states have very unusual entanglement properties, which we briefly discuss.
Abstract — We expand on our work on Quantum Data Hiding [1] – hiding classical data among parties who are restricted to performing only local quantum operations and classical communication (LOCC). We review our scheme that hides one bit between two parties using Bell states, and we derive upper and lower bounds on the secrecy of the hiding scheme. We provide an explicit bound showing that multiple bits can be hidden bitwise with our scheme. We give a preparation of the hiding states as an efficient quantum computation that uses at most one ebit of entanglement. A candidate data hiding scheme that does not use entanglement is presented. We show how our scheme for quantum data hiding can be used in a conditionally secure quantum bit commitment scheme.
We present a general technique for hiding a classical bit in multipartite quantum states. The hidden bit, encoded in the choice of one of two possible density operators, cannot be recovered by local operations and classical communication without quantum communication. The scheme remains secure if quantum communication is allowed between certain partners, and can be designed for any choice of quantum communication patterns to be secure, but to allow near perfect recovery for all other patterns. No entanglement is needed since the hiding states can be chosen to be separable. A single ebit of prior entanglement is not sufficient to break the scheme.
We present a scheme for hiding bits in Bell states that is secure even when the sharers Alice and Bob are allowed to carry out local quantum operations and classical communication. We prove that the information that Alice and Bob can gain about a hidden bit is exponentially small in n, the number of qubits in each share, and can be made arbitrarily small for hiding multiple bits. We indicate an alternative efficient low-entanglement method for preparing the shared quantum states. We discuss how our scheme can be implemented using present-day quantum optics.