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:1804.01982

Multiparty quantum data hiding with enhanced security and remote deletion

Xingyao Wu, Jianxin Chen

Published Apr 5, 2018• 0 citations
arXivHTMLPDF

Abstract

One of the applications of quantum technology is to use quantum states and measurements to communicate which offers more reliable security promises. Quantum data hiding, which gives the source party the ability of sharing data among multiple receivers and revealing it at a later time depending on his/her will, is one of the promising information sharing schemes which may address practical security issues. In this work, we propose a novel quantum data hiding protocol. By concatenating different subprotocols which apply to rather symmetric hiding scenarios, we cover a variety of more general hiding scenarios. We provide the general requirements for constructing such protocols and give explicit examples of encoding states for five parties. We also proved the security of the protocol in sense that the achievable information by unauthorized operations asymptotically goes to zero. In addition, due to the capability of the sender to manipulate his/her subsystem, the sender is able to abort the protocol remotely at any time before he/she reveals the information.

DOI
10.48550/arxiv.1804.01982

Related papers

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

(2,m)-threshold quantum data hiding

Donghoon Ha, Jeong San Kim

We consider multiparty quantum state discrimination and present a multiparty quantum data-hiding scheme for one classical bit to be shared among multiple parties. In the proposed scheme, any pair of parties can collaborate to perfectly recover the hidden bit through a joint measurement, whereas measurements based on local operations and classical communication(LOCC) performed even by all parties reveal only an arbitrarily small amount of information. We further provide bounds on the optimal LOCC discrimination of multiparty quantum states. The proposed scheme can be implemented using only separable states of low-dimensional quantum systems, enhancing its practical feasibility.

quant-pharXiv:2607.08070•Journal of Physics A Mathematical and Theoretical•Jul 10, 2026•0 citations

Secure and practical multiparty quantum digital signatures

Chen-Xun Weng, Yu-Shuo Lu, Rui-Qi Gao +6 more

Quantum digital signatures (QDSs) promise information-theoretic security against repudiation and forgery of messages. Compared with currently existing three-party QDS protocols, multiparty protocols have unique advantages in the practical case of more than two receivers when sending a mass message. However, complex security analysis, numerous quantum channels and low data utilization efficiency make it intractable to expand three-party to multiparty scenario. Here, based on six-state non-orthogonal encoding protocol, we propose an effective multiparty QDS framework to overcome these difficulties. The number of quantum channels in our protocol only linearly depends on the number of users. The post-matching method is introduced to enhance data utilization efficiency and make it linearly scale with the probability of detection events even for five-party scenario. Our work compensates for the absence of practical multiparty protocols, which paves the way for future QDS networks.

arXiv:2104.12059•Optics Express•Jul 28, 2021•24 citations

Quantum Data Hiding in the Presence of Noise

Cosmo Lupo, Mark M. Wilde, Seth Lloyd

When classical or quantum information is broadcast to separate receivers, there exist codes that encrypt the encoded data, such that the receivers cannot recover it when performing local operations and classical communication, but they can reliably decode if they bring their systems together and perform a collective measurement. This phenomenon is known as quantum data hiding and hitherto has been studied under the assumption that noise does not affect the encoded systems. With the aim of applying the quantum data hiding effect in practical scenarios, here, we define the data-hiding capacity for hiding classical information using a quantum channel. Using this notion, we establish a regularized upper bound on the data hiding capacity of any quantum broadcast channel, and we prove that coherent-state encodings have a strong limitation on their data hiding rates. We, then, prove a lower bound on the data hiding capacity of channels that map the maximally mixed state to the maximally mixed state (we call these channels mictodiactic-they can be seen as a generalization of unital channels when the input and output spaces are not necessarily isomorphic) and argue how to extend this bound to generic channels and to more than two receivers.

Civil War Book Review•Apr 1, 2016•9 citations

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

Quantum Data Hiding in the Presence of Noise

Cosmo Lupo, Mark M. Wilde, Seth Lloyd

When classical or quantum information is broadcast to separate receivers, there exist codes that encrypt the encoded data, such that the receivers cannot recover it when performing local operations and classical communication, but they can reliably decode if they bring their systems together and perform a collective measurement. This phenomenon is known as quantum data hiding and hitherto has been studied under the assumption that noise does not affect the encoded systems. With the aim of applying the quantum data hiding effect in practical scenarios, here, we define the data-hiding capacity for hiding classical information using a quantum channel. Using this notion, we establish a regularized upper bound on the data hiding capacity of any quantum broadcast channel, and we prove that coherent-state encodings have a strong limitation on their data hiding rates. We, then, prove a lower bound on the data hiding capacity of channels that map the maximally mixed state to the maximally mixed state (we call these channels mictodiactic-they can be seen as a generalization of unital channels when the input and output spaces are not necessarily isomorphic) and argue how to extend this bound to generic channels and to more than two receivers.

arXiv:1507.06038•IEEE Transactions on Information Theory•Apr 11, 2016•8 citations
One of the applications of quantum technology is to use quantum states and measurements to communicate which offers more reliable security promises. Quantum data hiding, which gives the source party the ability of sharing data among multiple receivers and revealing it at a later time depending on his/her will, is one of the promising information sharing schemes which may address practical security issues. In this work, we propose a novel quantum data hiding protocol. By concatenating different subprotocols which apply to rather symmetric hiding scenarios, we cover a variety of more general hiding scenarios. We provide the general requirements for constructing such protocols and give explicit examples of encoding states for five parties. We also proved the security of the protocol in sense that the achievable information by unauthorized operations asymptotically goes to zero. In addition, due to the capability of the sender to manipulate his/her subsystem, the sender is able to abort the protocol remotely at any time before he/she reveals the information.
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.
We consider multiparty quantum state discrimination and present a multiparty quantum data-hiding scheme for one classical bit to be shared among multiple parties. In the proposed scheme, any pair of parties can collaborate to perfectly recover the hidden bit through a joint measurement, whereas measurements based on local operations and classical communication(LOCC) performed even by all parties reveal only an arbitrarily small amount of information. We further provide bounds on the optimal LOCC discrimination of multiparty quantum states. The proposed scheme can be implemented using only separable states of low-dimensional quantum systems, enhancing its practical feasibility.
Quantum digital signatures (QDSs) promise information-theoretic security against repudiation and forgery of messages. Compared with currently existing three-party QDS protocols, multiparty protocols have unique advantages in the practical case of more than two receivers when sending a mass message. However, complex security analysis, numerous quantum channels and low data utilization efficiency make it intractable to expand three-party to multiparty scenario. Here, based on six-state non-orthogonal encoding protocol, we propose an effective multiparty QDS framework to overcome these difficulties. The number of quantum channels in our protocol only linearly depends on the number of users. The post-matching method is introduced to enhance data utilization efficiency and make it linearly scale with the probability of detection events even for five-party scenario. Our work compensates for the absence of practical multiparty protocols, which paves the way for future QDS networks.
When classical or quantum information is broadcast to separate receivers, there exist codes that encrypt the encoded data, such that the receivers cannot recover it when performing local operations and classical communication, but they can reliably decode if they bring their systems together and perform a collective measurement. This phenomenon is known as quantum data hiding and hitherto has been studied under the assumption that noise does not affect the encoded systems. With the aim of applying the quantum data hiding effect in practical scenarios, here, we define the data-hiding capacity for hiding classical information using a quantum channel. Using this notion, we establish a regularized upper bound on the data hiding capacity of any quantum broadcast channel, and we prove that coherent-state encodings have a strong limitation on their data hiding rates. We, then, prove a lower bound on the data hiding capacity of channels that map the maximally mixed state to the maximally mixed state (we call these channels mictodiactic-they can be seen as a generalization of unital channels when the input and output spaces are not necessarily isomorphic) and argue how to extend this bound to generic channels and to more than two receivers.
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.
When classical or quantum information is broadcast to separate receivers, there exist codes that encrypt the encoded data, such that the receivers cannot recover it when performing local operations and classical communication, but they can reliably decode if they bring their systems together and perform a collective measurement. This phenomenon is known as quantum data hiding and hitherto has been studied under the assumption that noise does not affect the encoded systems. With the aim of applying the quantum data hiding effect in practical scenarios, here, we define the data-hiding capacity for hiding classical information using a quantum channel. Using this notion, we establish a regularized upper bound on the data hiding capacity of any quantum broadcast channel, and we prove that coherent-state encodings have a strong limitation on their data hiding rates. We, then, prove a lower bound on the data hiding capacity of channels that map the maximally mixed state to the maximally mixed state (we call these channels mictodiactic-they can be seen as a generalization of unital channels when the input and output spaces are not necessarily isomorphic) and argue how to extend this bound to generic channels and to more than two receivers.