Multiparty data hiding of quantum information
arXiv:quant-ph/0407152 · doi:10.1103/PhysRevA.71.062339
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.
14 pages, 1 figure, 2 appendices
References in corpus (18)
- How to share a quantum secret
- Quantum Nonlocality without Entanglement
- On the Theory of Quantum Secret Sharing
- Information transmission through a noisy quantum channel
- Quantum Data Hiding
- Randomizing quantum states: Constructions and applications
- Unextendible Product Bases, Uncompletable Product Bases and Bound Entanglement
- Reversing quantum dynamics with near-optimal quantum and classical fidelity
- Nonlocality, Asymmetry, and Distinguishing Bipartite States
- Distinguishability of the Bell states
- Hiding bits in Bell states
- Local indistinguishability: more nonlocality with less entanglement
- Local indistinguishability and LOCC monotones
- Hiding classical data in multi-partite quantum states
- Superselection rules and quantum protocols
- Orthogonality And Distinguishability: Criterion For Local Distinguishability of Arbitrary Orthogonal States
- Hiding Quantum Data
- Remotely prepared entanglement: a quantum web page
Cited by in corpus (27)
- Aspects of generic entanglement
- Detecting crosstalk errors in quantum information processors
- Typical entanglement of stabilizer states
- On Hastings' counterexamples to the minimum output entropy additivity conjecture
- Sequential projective measurements for channel decoding
- Achieving the Holevo bound via sequential measurements
- Two-sided bounds on minimum-error quantum measurement, on the reversibility of quantum dynamics, and on the maximum overlap problem using directional iterates
- Two-sided estimates of minimum-error distinguishability of mixed quantum states via generalized Holevo-Curlander bounds
- Locking classical information
- Upper bounds on the error probabilities and asymptotic error exponents in quantum multiple state discrimination
- Finite de Finetti theorem for conditional probability distributions describing physical theories
- Error rates of Belavkin weighted quantum measurements and a converse to Holevo's asymptotic optimality theorem
- Quantum Pufferfish Privacy: A Flexible Privacy Framework for Quantum Systems
- Local Indistinguishability and Possibility of Hiding cbits in Activable Bound Entangled States
- Optimality of programmable quantum measurements
- Cryptography in a Quantum World
- New general lower and upper bounds under minimum-error quantum state discrimination
- Building one-time memories from isolated qubits
- Single-shot security for one-time memories in the isolated qubits model
- Quantum data hiding in the presence of noise
- On the spectral gap of random quantum channels
- Exploring strong locality : Quantum state discrimination regime and beyond
- Classifying locally distinguishable sets: No activation across bipartitions
- Upper and Lower Bounds on Optimal Success Probability of Quantum State Discrimination with and without Inconclusive Results
- Minimum-error discrimination of quantum states: New bounds and comparison
- How to hide a secret direction
- Entanglement - A Queer In The World Of Quantum : Some Perspectives