Near-optimal extractors against quantum storage

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 161-170

  De, Anindya ^a   Vidick, Thomas ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

bounded quantum storage; extractors; random access codes

Indexed keywords

ACCESS CODES; CRYPTOGRAPHIC APPLICATIONS; DECODING ALGORITHM; OPTIMAL EXTRACTORS; POLYLOGARITHMIC NUMBERS; RANDOM ACCESS;

COMPUTATION THEORY; QUANTUM CRYPTOGRAPHY;

RANDOM ACCESS STORAGE;

EID: 77954740848     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806713     Document Type: Conference Paper

References (29)

1. A. Ambainis, A. Nayak, A. Ta-shma, and U. V. Vazirani. Dense quantum coding and quantum finite automata. Journal of the ACM, 49(4):496-511, 2002.
2. Preliminary version in Proc. of STOC 1999.
3. A. Ben-Aroya, O. Regev, and R. de Wolf. A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs . In Proceedings of the 49th IEEE Symposium on Foundations of Computer Science, pages 477-486, 2008. Full version at arXiv:0705.3806.
4. R. Cleve, W. v. Dam, M. Nielsen, and A. Tapp. Quantum entanglement and the communication complexity of the inner product function. In QCQC '98: Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications, pages 61-74, London, UK, 1998. Springer-Verlag.
5. A. De, C. Portmann, R. Renner, and T. Vidick. Trevisan's extractor in the presence of quantum side information. Technical report arXiv:0912.5514, 2009.
6. A. De and L. Trevisan. Extractors using hardness amplification. In Proc. of APPROX-RANDOM, pages 462-475, 2009.
7. S. Dziembowski and U. Maurer. Optimal randomizer efficiency in the bounded-storage model. Journal of Cryptology, 17(1):5-26, 2004.
8. S. Fehr and C. Schaffner. Randomness extraction via delta -biased masking in the presence of a quantum attacker. In R. Canetti, editor, TCC, volume 4948 of Lecture Notes in Computer Science, pages 465-481. Springer, 2008.
9. D. Gavinsky, J. Kempe, I. Kerenidis, R. Raz, and R. de Wolf. Exponential separation for one-way quantum communication complexity, with applications to cryptography. SIAM Journal of Computing, 38(5):1695-1708, 2008.
10. Preliminary version in Proc. of STOC 2007.
11. V. Guruswami, J. Håstad, M. Sudan, and D. Zuckerman. Combinatorial bounds for list decoding. IEEE Transactions on Information Theory, 48(5):1021-1034, 2002.
12. T. Hartman and R. Raz. On the distribution of the number of roots of polynomials and explicit weak designs. Random Structures and Algorithms, 23(3):235-263, 2003.
13. A. Holevo. Information-theoretic aspects of quantum measurement. Problems of Information Transmission, 9(2):31-42, 1973.
14. R. Impagliazzo, R. Jaiswal, and V. Kabanets. Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification. In Proceedings of the 47th IEEE Symposium on Foundations of Computer Science, pages 187-196, 2006. Full version at http://www1.cs.columbia.edu/~rjaiswal/.
15. R. König, U. Maurer, and R. Renner. On the power of quantum memory. IEEE Transactions on Information Theory, 51(7):2391-2401, 2005.
16. R. König and B. Terhal. The bounded storage model in presence of a quantum adversary. IEEE Transactions on Information Theory, 54(2):749-762, 2008.
17. C.-J. Lu. Encryption against storage-bounded adversaries from on-line strong extractors. Journal of Cryptology, 17(1):27-42, 2004.
18. U. M. Maurer. Conditionally-perfect secrecy and a provably-secure randomized cipher. Journal of Cryptology, 5(1):53-66, 1992.
19. A. Nayak and J. Salzman. Limits on the ability of quantum states to convey classical messages. Journal of the ACM, 53(1):184-206, 2006.
20. N. Nisan and A. Wigderson. Hardness vs randomness. Journal of Computer and System Sciences, 49:149-167, 1994.
21. Preliminary version in Proc. of FOCS'88.
22. R. Raz, O. Reingold, and S. P. Vadhan. Extracting all the randomness and reducing the error in trevisan's extractors. J. Comput. Syst. Sci., 65(1):97-128, 2002.
23. Preliminary version in Proc. of STOC 1999.
24. M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom generators without the XOR lemma. Journal of Computer and System Sciences, 62(2):236-266, 2001.
25. Preliminary version in STOC and CCC 1999.
26. A. Ta-shma. Short seed extractors against quantum storage. In Proceedings of the 41st ACM Symposium on Theory of Computing, pages 401-409, 2009.
27. L. Trevisan. Extractors and pseudorandom generators. Journal of the ACM, 48(4):860-879, 2001.
28. S. P. Vadhan. Constructing locally computable extractors and cryptosystems in the bounded-storage model. Journal of Cryptology, 17(1):43-77, 2004.
29. E. Viola. The complexity of constructing pseudorandom generators from hard functions. Computational Complexity, 13(3-4):147-188, 2004. (Pubitemid 40389759)