Randomness extraction via δ-biased masking in the presence of a quantum attacker

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4948 LNCS, Issue , 2008, Pages 465-481

  Fehr, Serge ^a   Schaffner, Christian ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; ERROR CORRECTION; EXTRACTION; INFORMATION THEORY; QUANTUM OPTICS; SOLVENT EXTRACTION; STANDARDS;

(E ,2E) THEORY; CORRECTION TECHNIQUES; EXTRACTION TECHNIQUES; HEIDELBERG (CO); INFORMATION THEORETIC CRYPTOGRAPHY; PARTIAL INFORMATION; QUANTUM INFORMATION (QI); QUANTUM SETTING; SECRET KEYS; SPRINGER (CO);

QUANTUM CRYPTOGRAPHY;

EID: 40249085721     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78524-8_26     Document Type: Conference Paper

References (30)

1. Alon, N., Goldreich, O., Håst ad, J., Peralta, R.: Simple constructions of almost k-wise independent random variables. In: 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 544-553 (1990)
2. Ambainis, A., Smith, A.: Small pseudo-random families of matrices: Derandomizing approximate quantum encryption. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004'and APPROX 2004, LNCS, vol. 3122, pp. 249-260. Springer, Heidelberg (2004)
3. Aumann, Y., Ding, Y.Z., Rabin, M.O.: Everlasting security in the bounded storage model. IEEE Transactions on Information Theory 48(6), 1668-1680 (2002)
4. Ben-Aroya, A., Regev, O., de Wolf, R.: A hypercontractive inequality for matrix-valued functions with applications to quantum computing (2007), http://arxiv.org/abs/0705.3806
5. Bennett, C.H., Brassard, G., Crépeau, C., Maurer, U.M.: Generalized privacy amplification. IEEE Transactions on Information Theory 41, 1915-1923 (1995)
6. Damgârd, I.B., Fehr, S., Salvail, L., Schaffner, C.: Oblivious transfer and linear functions. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 427-444, Springer, Heidelberg (2006)
7. Damgård, I.B., Fehr, S., Salvail, L., Schaffner, C.: Secure identification and QKD in the bounded-quantum-storage model. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 342-359. Springer, Heidelberg (2007)
8. Desrosiers, S.P.: Entropic security in quantum cryptography (2007), http://arxiv.org/abs/quant-ph/0703046
9. Desrosiers, S.P., Dupuis, F.: Quantum entropic security and approximate quantum encryption, (July 5, 2007), http://arxiv.org/abs/0707.0691
10. Dickinson, P.A., Nayak, A.: Approximate randomization of quantum states with fewer bits of key. In: Quantum Computing: Back Action 2006, November 2006. American Institute of Physics Conference Series, vol. 864, pp. 18-36 (2006), http://arxiv.org/abs/quant-ph/0611033
11. Dodis, Y., Smith, A.: Correcting errors without leaking partial information. In: 37th Annual ACM Symposium on Theory of Computing (STOC), pp. 654-663 (2005)
12. Dodis, Y., Smith, A.: Entropic security and the encryption of high entropy messages. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 556-577. Springer, Heidelberg (2005)
13. Gavinsky, D., Kerenidis, I., Kempe, J., Raz, R., de Wolf, R.: Exponential separations for one-way quantum communication complexity, with applications to cryptography. In: 39th Annual ACM Symposium on Theory of Computing (STOC), pp. 516-525 (2007), http://arxiv.org/abs/quant-ph/0611209
14. Håstad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM Journal on Computing 28(4) (1999)
15. Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from one-way functions. In: 21st Annual ACM Symposium on Theory of Computing (STOC), pp. 12-24 (1989)
16. Kerenidis, I., Nagaj, D.: On the optimality of quantum encryption schemes. Journal of Mathematical Physics 47, 92-102 (2006), http://arxiv.org/ abs/ quant-ph/0509169
17. König, R., Renner, R.: Sampling of min-entropy relative to quantum knowledge. In: Workshop on Quantum Information Processing (QIP 2008) (2007)
18. König, R., Terhal, B.M.: The bounded storage model in the presence of a quantum adversary (2006), http://arxiv.org/abs/quant-ph/0608101
19. Maurer, U.M.: A. provably-secure strongly-randomized cipher. In: Damgård, I.B. (ed.) EUROCRYPT 1990. LNCS, vol. 473, pp. 361-373. Springer, Heidelberg (1991)
20. Naor, J., Naor, M.: Small-bias probability spaces: efficient constructions and applications. In: 22nd Annual ACM Symposium on Theory of Computing (STOC), pp. 213-223 (1.990)
21. Nisan, N., Zuckerman, D.: More deterministic simulation in logspace. In: 25th Annual ACM Symposium on the Theory of Computing (STOC), pp. 235-244 (1993)
22. Renner, R.: Security of Quantum Key Distribution. PhD thesis, ETH Zürich (Switzerland) (September 2005), http://arxiv.org/abs/quant-ph/ 0512258
23. Renner, R., König, R.: Universally composable privacy amplification against quantum adversaries. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 407-425. Springer, Heidelberg (2005)
24. Renner, R., Wolf, S.: Simple and tight bounds for information reconciliation and privacy amplification. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 199-216. Springer, Heidelberg (2005)
25. Russell, A., Wang, IL: How to fool an unbounded adversary with a short key. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 133-148. Springer, Heidelberg (2002)
26. Shaltiel, R.: Recent developments in explicit constructions of extractors. Bulletin of the EATCS 77, 67-95 (2002)
27. Smith, A.: Private communication (2007)
28. Stinson, D.R.: Universal hashing and authentication codes. In: Feigenbaum, J. (ed.) CRYPTO 1991, LNCS, vol. 576, pp. 74-85. Springer, Heidelberg (1992)
29. Ta-Shma, A.: On extracting randomness from weak random sources. In: 28th Annual ACM Symposium on the Theory of Computing (STOC), pp. 276-285 (1996)
30. Wegman, M.N., Carter, L.: New hash functions and their use in authentication and set equality. J. Comput. Syst. Sci. 22(3), 265-279 (1981)