Quantum data hiding
- 7 August 2002
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 48 (3), 580-598
- https://doi.org/10.1109/18.985948
Abstract
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.Keywords
This publication has 30 references indexed in Scilit:
- Hiding Bits in Bell StatesPhysical Review Letters, 2001
- Separability properties of tripartite states withsymmetryPhysical Review A, 2001
- Entangling Operations and Their Implementation Using a Small Amount of EntanglementPhysical Review Letters, 2001
- Evidence for bound entangled states with negative partial transposePhysical Review A, 2000
- Distillability and partial transposition in bipartite systemsPhysical Review A, 2000
- Unconditional Security of Quantum Key Distribution over Arbitrarily Long DistancesScience, 1999
- Substituting quantum entanglement for communicationPhysical Review A, 1997
- Is Quantum Bit Commitment Really Possible?Physical Review Letters, 1997
- Comparison Techniques for Random Walk on Finite GroupsThe Annals of Probability, 1993
- Optimal detection of quantum informationPhysical Review Letters, 1991