Short seed extractors against quantum storage

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 401-408

  Ta Shma, Amnon ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Locally decodable codes; Quantum algorithms; Random access codes; Randomness extractors

Indexed keywords

BLACK BOXES; CLASSICAL INFORMATION; LIST-DECODABLE CODES; LOCALLY DECODABLE CODES; PRIVACY AMPLIFICATION; PSEUDORANDOM GENERATORS; QUANTUM ALGORITHMS; QUANTUM INFORMATION; RANDOM ACCESS; RANDOM ACCESS CODES; RANDOMNESS EXTRACTORS;

AMPLIFICATION; DECODING; INFORMATION DISSEMINATION; QUANTUM OPTICS; QUANTUM THEORY; SEED;

COMPUTATION THEORY;

EID: 70350689920     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536470     Document Type: Conference Paper

References (28)

1. A. Ambainis, A. Nayak, A. Ta-Shma, and U. Vazirani. Dense quantum coding and quantum finite automata. In STOC, pages 376-383, 1999.
2. A. Ambainis, A. Nayak, A. Ta-Shma, and U. Vazirani. Dense quantum coding and quantum finite automata. Journal of the ACM, 49(4):496-511, 2002.
3. C.H. Bennett, G. Brassard, C. Crepeau, and U. Maurer. Generalized privacy amplification. IEEE Transactions on Information Theory, 41(6 Part 2):1915-1923, 1995.
4. C.H. Bennett, G. Brassard, and J.M. Robert. Privacy amplification by public discussion. SIAM Journal on Computing, 17(2):210-229, 1988.
5. M. Christandl, R. Renner, and A. Ekert. A Generic Security Proof for Quantum Key Distribution. Technical report, Arxiv preprint quant-ph/0402131, 2004.
6. T.M. Cover, J.A. Thomas, J. Wiley, and W. InterScience. Elements of information theory. Wiley New York, 1991.
7. Y. Dodis and A. Smith. Correcting errors without leaking partial information. STOC, pages 654-663, 2005.
8. Z. Dvir and A. Wigderson. Kakeya sets, new mergers and old extractors. In FOCS, page, 2008.
9. S. Fehr and C. Schaffner. Randomness Extraction via Delta-Biased Masking in the Presence of a Quantum Attacker. Arxiv preprint arXiv:0706.2606, 2007.
10. D. Gavinsky, J. Kempe, I. Kerenidis, R. Raz, and R. de Wolf. Exponential separations for one-way quantum communication complexity, with applications to cryptography. STOC, pages 516-525, 2007.
11. O. Goldreich and A. Wigderson. Tiny families of functions with random properties: a quality-size trade-off for hashing. Random Structures & Algorithms, 11(4):315-343, 1997.
12. V. Guruswami, C. Umans, and S. Vadhan. Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes. In Computational Complexity, pages 96-108, 2007.
13. A.S. Holevo. Some estimates of the information transmitted by quantum communication channels. Problems of Information Transmission, 9:177-183, 1973.
14. R. Impagliazzo, L. Levin, and M. Luby. Pseudo-random generation from one-way functions. STOC, pages 12-24, 1989.
15. R. Konig, U. Maurer, and R. Renner. On the Power of Quantum Memory. Arxiv preprint quant-ph/0305154, 2003.
16. R. Konig, U. Maurer, and R. Renner. On the power of quantum memory. IEEE Transactions on Information Theory, 51(7):2391-2401, 2005.
17. R. Konig and R. Renner. Sampling of min-entropy relative to quantum knowledge. Arxiv preprint arXiv:0712.4291, 2007.
18. R. Konig and B. Terhal. The Bounded-Storage Model in the Presence of a Quantum Adversary. IEEE Transactions on Information Theory, 54(2):749-762, 2008.
19. C. Lu, O. Reingold, S. Vadhan, and A. Wigderson. Extractors: Optimal up to constant factors. In STOC, pages 602-611, 2003.
20. A. Nayak. Optimal lower bounds for quantum automata and random access codes. In FOCS, pages 369-376, 1999.
21. M. Nielsen and I. Chuang. Quantum computation and quantum communication. Cambridge University Press, Cambridge, 2000.
22. N. Nisan and A. Wigderson. Hardness vs. randomness. Journal of Computer and System Sciences, 49:149-167, 1994.
23. N. Nisan and D. Zuckerman. Randomness is Linear in Space. Journal of Computer and System Sciences, 52(1):43-52, 1996.
24. J. Radhakrishnan and A. Ta-Shma. Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators. SIAM Journal on Discrete Mathematics, 13:2, 2000.
25. R. Renner. Security of Quantum Key Distribution. PhD thesis, Swiss Federal Institute of Technology (ETH) Zurich, September 2005. available at http://arxiv.org/abs/quant-ph/0512258.
26. A. Srinivasan and D. Zuckerman. Computing with Very Weak Random Sources. SIAM Journal on Computing, 28(4):1433-1459, 1999.
27. M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom generators without the xor lemma. Journal of Computer and System Sciences, 62(2):236-266, 2001.
28. L. Trevisan. Extractors and pseudorandom generators. Journal of the ACM, pages 860-879, 2001.