On the Power of Quantum Encryption Keys
- 1.4k Downloads
The standard definition of quantum state randomization, which is the quantum analog of the classical one-time pad, consists in applying some transformation to the quantum message conditioned on a classical secret key k. We investigate encryption schemes in which this transformation is conditioned on a quantum encryption key state ρ k instead of a classical string, and extend this symmetric-key scheme to an asymmetric-key model in which copies of the same encryption key ρ k may be held by several different people, but maintaining information-theoretical security. We find bounds on the message size and the number of copies of the encryption key which can be safely created in these two models in terms of the entropy of the decryption key, and show that the optimal bound can be asymptotically reached by a scheme using classical encryption keys. This means that the use of quantum states as encryption keys does not allow more of these to be created and shared, nor encrypt larger messages, than if these keys are purely classical.
KeywordsQuantum State Density Operator Message Size Classical Message Quantum Message
Unable to display preview. Download preview PDF.
- 3.Dickinson, P., Nayak, A.: Approximate randomization of quantum states with fewer bits of key. In: AIP Conference Proceedings, vol. 864, pp. 18–36 (2006)Google Scholar
- 5.Ambainis, A., Mosca, M., Tapp, A., de Wolf, R.: Private quantum channels. In: FOCS 2000: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, Washington, DC, USA, vol. 547. IEEE Computer Society, Los Alamitos (2000)Google Scholar
- 8.Harrow, A.W., Winter, A.: How many copies are needed for state discrimination? quant-ph/0606131 (2006)Google Scholar
- 11.Kawachi, A., Koshiba, T., Nishimura, H., Yamakami, T.: Computational indistinguishability between quantum states and its cryptographic application. Full version of , quant-ph/0403069 (2006)Google Scholar