pith. sign in

arxiv: quant-ph/0407152 · v1 · submitted 2004-07-20 · 🪐 quant-ph

Multiparty data hiding of quantum information

classification 🪐 quant-ph
keywords datahidinghiddeninformationmultipartyprotocolsquantumqubit
0
0 comments X
read the original abstract

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 LOCC attacks. 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.