Quantum data hiding

Author

DiVincenzo, David P. ; Leung, Debbie W. ; Terhal, Barbara M.

Author_Institution

IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA

Volume

48

Issue

3

fYear

2002

fDate

3/1/2002 12:00:00 AM

Firstpage

580

Lastpage

598

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

data encapsulation; protocols; quantum cryptography; security of data; telecommunication security; Bell states; classical communication; conditionally secure quantum bit commitment; efficient quantum computation; hiding scheme secrecy; hiding states; local quantum operations; lower bounds; quantum data hiding protocol; quantum optics; upper bounds; Cryptography; Data encapsulation; Distributed computing; Information theory; Particle measurements; Protocols; Quantum computing; Quantum entanglement; Quantum mechanics; Statistical distributions;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.985948

Filename

985948