Entropic security in quantum cryptography

Quantum Information Processing

Volumn 8, Issue 4, 2009, Pages 331-345

  Desrosiers, Simon Pierre ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

Approximate encryption; Entropic security; Information theory; Private quantum channel; Quantum cryptography

Indexed keywords

APPROXIMATE ENCRYPTION; CLASSICAL BITS; ENTROPIC SECURITY; INDISTINGUISHABILITY; N QUBITS; PRIVATE QUANTUM CHANNEL;

INFORMATION THEORY; QUANTUM CRYPTOGRAPHY;

NETWORK SECURITY;

EID: 67349169714     PISSN: 15700755     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11128-009-0111-3     Document Type: Article

References (15)

1. Alon, N., Goldreich, O., Håstad, J., Peralta, R.: Simple constructions of almost k-wise independent random variables. In: IEEE symposium on foundations of computer science, pp. 544-553 (1990) (Pubitemid 21663247)
2. Ambainis, A., Mosca, M., Tapp, A., de Wolf, R.: Private quantum channels. In: IEEE symposium on foundations of computer science, pp. 547-553 (2000) (Pubitemid 32075923)
3. Ambainis, A., Smith, A.: Small pseudo-random families of matrices: derandomizing approximate quantum encryption. In: Proceeding of RANDOM 2004, pp. 249-260. Springer (2004)
4. Canetti, R.: Towards realizing random oracles: hash functions that hide all partial information. In: Lecture Notes in Computer Science, vol. 1294, pp. 455-469. Springer, London, UK (1997) (Pubitemid 127112572)
5. Canetti, R., Micciancio, D., Reingold, O.: Perfectly one-way probabilistic hash functions. In: 30th Annual ACM Symposium on Theory of Computing, pp. 131-140. ACM (1998)
6. Desrosiers, S.P.: Quantum entropic security. Ph.D. thesis, McGill University (2009)
7. Desrosiers, S.P., Dupuis, F.: Quantum entropic security and approximate quantum encryption. IEEE Trans Inf Theory (To appear)
8. Dickinson, P.A., Nayak, A.: Approximate randomization of quantum states with fewer bits of key, 2006. quant-ph/0611033
9. Dodis, Y., Smith, A.: Entropic security and the encryption of high entropy messages. Cryptology ePrint Archive, Report 2004/219, 2004. http://eprint.iacr.org/
10. Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: STOC '89: Proceedings of the twenty-first annual ACM symposium on theory of computing, pp. 25-32. ACM, New York, NY, USA (1989)
11. S. Goldwasser S. Micali 1984 Probabilistic encryption J. Comput. Syst. Sci. 28 2 270 299 (Pubitemid 14586283)
12. P. Hayden D. Leung P.W. Shor A. Winter 2004 Randomizing quantum states: constructions and applications Commun. Math. Phys. 250 371 391 (Pubitemid 39374478)
13. C.W. Helstrom 1969 Quantum detection and estimation theory J. Stat. Phys. 1 2 231 252
14. Nielsen M.A., Chuang I.L.: Quantum Computation and Quantum Information. Cambridge University Press, New York, NY, USA (2000)
15. Russell, A., Wang, H.: How to fool an unbounded adversary with a short key. In: EUROCRYPT '02: Proceedings of the international conference on the theory and applications of cryptographic techniques, pp. 133-148. Springer-Verlag, London, UK (2002)