Hiding information in orthogonal product quantum states
CEA'07 Proceedings of the 2007 annual Conference on International Conference on Computer Engineering and Applications
General paradigm for distilling classical key from quantum states
IEEE Transactions on Information Theory
Distinguishability of quantum states by separable operations
IEEE Transactions on Information Theory
Enhancing the security of quantum communication by hiding the message in a superposition
Information Sciences: an International Journal
Quantum authentication protocol using entangled states
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
A quasipolynomial-time algorithm for the quantum separability problem
Proceedings of the forty-third annual ACM symposium on Theory of computing
An exact effective two-qubit gate in a chain of three spins
Quantum Information & Computation
Secure assisted quantum computation
Quantum Information & Computation
Building one-time memories from isolated qubits: (extended abstract)
Proceedings of the 5th conference on Innovations in theoretical computer science
Dualities and identities for entanglement-assisted quantum codes
Quantum Information Processing
| Hi-index | 754.96 |
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