Trevisan's extractor in the presence of quantum side information

SIAM Journal on Computing

Volumn 41, Issue 4, 2012, Pages 915-940

  De, Anindya ^a   Portmann, Christopher ^b,c   Vidick, Thomas ^d   Renner, Renato ^b,c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b ETH ZURICH   (Switzerland)

^c UNIVERSITY OF GENEVA   (Switzerland)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Quantum cryptography; Quantum information; Randomness extractors; Smooth min entropy

Indexed keywords

CLASSICAL INFORMATION; CLASSICAL PROBABILITIES; EXTRACTOR CONSTRUCTION; MIN-ENTROPY; POLYLOGARITHMIC; QUANTUM DEVICE; QUANTUM INFORMATION; QUANTUM SYSTEM; RANDOMNESS EXTRACTORS; SIDE INFORMATION;

ENTROPY; QUANTUM CRYPTOGRAPHY; QUANTUM ELECTRONICS; QUANTUM OPTICS;

RANDOM PROCESSES;

EID: 84866427032     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/100813683     Document Type: Conference Paper

References (38)

1. A. AMBAINIS, A. NAYAK, A. TA-SHMA, and U. VAZIRANI, Dense quantum coding and a lower bound for 1-way quantum automata, in Proceedings of the 31st Symposium on Theory of Computing (STOC'99), ACM, New York, 1999, pp. 376-383.
2. A. BEN-AROYA and A. TA-SHMA, Better short-seed quantum-proof extractors, Theoret. Comput. Sci., 419(2012), pp. 17-25.
3. C. H. BENNETT, G. BRASSARD, C. CRÉPEAU, and U. MAURER, Generalized privacy amplification, IEEE Trans. Inform. Theory, 41(1995), pp. 1915-1923.
4. C. H. BENNETT, G. BRASSARD, and J.-M. ROBERT, Privacy amplification by public discussion, SIAM J. Comput., 17(1988), pp. 210-229.
5. A. DE and T. VIDICK, Near-optimal extractors against quantum storage, in Proceedings of the 42nd Symposium on Theory of Computing (STOC'10), ACM, New York, 2010, pp. 161-170
6. D. GAVINSKY, J. KEMPE, I. KERENIDIS, R. RAZ, and R. DE WOLF, Exponential separations for one-way quantum communication complexity, with applications to cryptography, in Proceedings of the 39th Symposium on Theory of Computing (STOC'07), ACM, New York, 2007, pp. 516-525. (Pubitemid 47630771)
7. V. GURUSWAMI, J. HÅSTAD, M. SUDAN, and D. ZUCKERMAN, Combinatorial bounds for list decoding, IEEE Trans. Inform. Theory, 48(2002), pp. 1021-1034. (Pubitemid 34555215)
8. T. HARTMAN and R. RAZ, On the distribution of the number of roots of polynomials and explicit weak designs, Random Structures Algorithms, 23(2003), pp. 235-263.
9. R. IMPAGLIAZZO, R. SHALTIEL, and A. WIGDERSON, Extractors and pseudo-random generators with optimal seed length, in Proceedings of the 32nd Symposium on Theory of Computing (STOC'00), ACM, New York, 2000, pp. 1-10.
10. R. IMPAGLIAZZO and D. ZUCKERMAN, How to recycle random bits in Proceedings of the 30th Symposium on Foundations of Computer Science (FOCS'89), IEEE Press, Piscataway, NJ, 1989, pp. 248-253. (Pubitemid 20725955)
11. R. KASHER and J. KEMPE, Two-source extractors secure against quantum adversaries, in Proceedings of the International Conference on Approximation, Randomization, and Combinatorial Optimization (APPROX-RANDOM'10), Springer, New York, 2010, pp. 656-669.
12. R. KÖNIG and R. RENNER, Sampling of min-entropy relative to quantum knowledge, IEEE Trans. Inform. Theory, 57(2011), pp. 4760-4787.
13. R. KÖNIG, R. RENNER, and C. SCHAFFNER, The operational meaning of min-and max-entropy, IEEE Trans. Inform. Theory, 55(2009), pp. 4337-4347.
14. R. KÖNIG and B. M. TERHAL, The bounded-storage model in the presence of a quantum adversary, IEEE Trans. Inform. Theory, 54(2008), pp. 749-762. (Pubitemid 351314663)
15. C.-J. LU, Encryption against storage-bounded adversaries from on-line strong extractors, J. Cryptol., 17(2004), pp. 27-42.
16. U. M. MAURER, Conditionally-perfect secrecy and a provably-secure randomized cipher, Journal of Cryptology, 5(1992), pp. 53-66.
17. N. NISAN and A. WIGDERSON, Hardness vs. randomness, J. Comput. System Sci., 49(1994), pp. 149-167.
18. N. NISAN and D. ZUCKERMAN, Randomness is linear in space, J. Comput. System Sci., 52(1996), pp. 43-52. (Pubitemid 126340848)
19. J. RADHAKRISHNAN and A. TA-SHMA, Bounds for dispersers, extractors, and depth-two superconcentrators, SIAM J. Discrete Math., 13(2000), pp. 2-24.
20. R. RAZ, Extractors with weak random seeds, in Proceedings of the 37th Symposium on Theory of Computing (STOC'05), ACM, New York, 2005, pp. 11-20. (Pubitemid 43098567)
21. R. RAZ, O. REINGOLD, and S. VADHAN, Extracting all the randomness and reducing the error in Trevisan's extractors, J. Comput. System Sci., 65(2002), pp. 97-128. (Pubitemid 41161760)
22. R. RENNER, Security of Quantum Key Distribution, Ph. D. thesis, Department of Computer Science, Swiss Federal Institute of Technology Zurich, Zurich, 2005.
23. R. SHALTIEL, Recent developments in explicit constructions of extractors, Bull. European Assoc. Theoret. Comput. Sci., 77(2002), pp. 67-95.
24. R. SHALTIEL and C. UMANS, Simple extractors for all min-entropies and a new pseudorandom generator, J. ACM, 52(2005), pp. 172-216. (Pubitemid 41655758)
25. R. SOLCAÀ, Efficient Simulation of Random Quantum States and Operators, Master's thesis, Department of Physics, Swiss Federal Institute of Technology, Zurich, 2010.
26. A. SRINIVASAN and D. ZUCKERMAN, Computing with very weak random sources, SIAM J. Comput., 28(1999), pp. 1433-1459.
27. M. SUDAN, List decoding: Algorithms and applications, SIGACT News, 31(2000), pp. 16-27.
28. A. TA-SHMA, Short seed extractors against quantum storage, in Proceedings of the 41st Symposium on Theory of Computing (STOC'09), ACM, New York, 2009, pp. 401-408.
29. A. TA-SHMA, C. UMANS, and D. ZUCKERMAN, Loss-less condensers, unbalanced expanders, and extractors, in Proceedings of the 33rd Symposium on Theory of Computing (STOC'01), ACM, New York, 2001, pp. 143-152. (Pubitemid 32865727)
30. A. TA-SHMA, D. ZUCKERMAN, and S. SAFRA, Extractors from Reed-Muller codes, J. Comput. System Sci., 72(2006), pp. 786-812.
31. M. TOMAMICHEL, R. COLBECK, and R. RENNER, Duality between smooth min-and maxentropies, IEEE Trans. Inform. Theory, 56(2010), pp. 4674-4681.
32. M. TOMAMICHEL, C. SCHAFFNER, A. SMITH, and R. RENNER, Leftover hashing against quantum side information, in Proceedings of 2010 International Symposium on Information Theory (ISIT), IEEE Press, Piscataway, NJ, 2010, pp. 2703-2707.
33. L. TREVISAN, Extractors and pseudorandom generators, J. ACM, 48(2001), pp. 860-879.
34. S. P. VADHAN, Constructing locally computable extractors and cryptosystems in the boundedstorage model, J. Cryptol., 17(2004), pp. 43-77.
35. A. WIGDERSON and D. ZUCKERMAN, Expanders that beat the eigenvalue bound: Explicit construction and applications, Combinatorica, 19(1999), pp. 125-138.
36. F. XU, B. QI, X. MA, H. XU, H. ZHENG, and H.-K. LO, An ultrafast quantum random number generator based on quantum phase fluctuations, preprint available at http://arxiv.org/abs/1109.0643 (2011).
37. A. C.-C. YAO, Theory and applications of trapdoor functions (extended abstract), in Proceedings of the 23rd Symposium on Foundations of Computer Science (FOCS'82), IEEE Press, Piscataway, NJ, 1982, pp. 80-91.
38. D. ZUCKERMAN, General weak random sources, in Proceedings of the 31st Symposium on Foundations of Computer Science (FOCS'90), IEEE Press, 1990, Piscataway, NJ, pp. 534-543 (Pubitemid 21663248)