A hardcore lemma for computational indistinguishability: Security amplification for arbitrarily weak PRGs with optimal stretch

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

Volumn 5978 LNCS, Issue , 2010, Pages 237-254

  Maurer, Ueli ^a   Tessaro, Stefano ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY THEORY; COMPUTATIONAL HARDNESS; EFFICIENT CONSTRUCTION; INDISTINGUISHABILITY; MIN-ENTROPY; NONUNIFORM; PSEUDORANDOM GENERATORS; SECURITY AMPLIFICATION; STATISTICAL DISTANCE;

AMPLIFICATION; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; INFORMATION THEORY; OPTICAL COMMUNICATION; PROBABILITY DENSITY FUNCTION; RANDOM PROCESSES; RANDOM VARIABLES;

RAIN GAGES;

EID: 77949588772     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11799-2_15     Document Type: Conference Paper

References (17)

1. Bennett, C.H., Brassard, G., Robert, J.-M.: Privacy amplification by public discussion. SIAM Journal on Computing 17(2), 210-229 (1988)
2. Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo random bits. In: FOCS 1982: Proceedings of the 23rd IEEE Annual Symposium on Foundations of Computer Science, pp. 112-117 (1982)
3. Dodis, Y., Impagliazzo, R., Jaiswal, R., Kabanets, V.: Security amplification for interactive cryptographic primitives. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 128-145. Springer, Heidelberg (2009)
4. Goldreich, O., Nisan, N., Wigderson, A.: On Yao's XOR-lemma. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 2(50) (1995)
5. Haitner, I., Harnik, D., Reingold, O.: On the power of the randomized iterate. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 22-40. Springer, Heidelberg (2006)
6. Håstad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM Journal on Computing 28(4), 1364-1396 (1999)
7. Hoeffding, W.: Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58(301), 13-30 (1963)
8. Holenstein, T.: Key agreement from weak bit agreement. In: STOC 2005: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 664-673 (2005)
9. Holenstein, T.: Pseudorandom generators from one-way functions: A simple construction for any hardness. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 443-461. Springer, Heidelberg (2006)
10. Impagliazzo, R.: Hard-core distributions for somewhat hard problems. In: FOCS 1995: Proceedings of the 36th IEEE Annual Symposium on Foundations of Computer Science, pp. 538-545 (1995)
11. Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from one-way functions (extended abstracts). In: STOC 1989: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 12-24 (1989)
12. Kamp, J., Rao, A., Vadhan, S., Zuckerman, D.: Deterministic extractors for small-space sources. In: STOC 2006: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 691-700 (2006)
13. Maurer, U., Pietrzak, K., Renner, R.: Indistinguishability amplification. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 130-149. Springer, Heidelberg (2007)
14. Maurer, U., Tessaro, S.: Computational indistinguishability amplification: Tight product theorems for system composition. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 350-368. Springer, Heidelberg (2009)
15. Myers, S.: Efficient amplification of the security of weak pseudo-random function generators. Journal of Cryptology 16, 1-24 (2003)
16. Shaltiel, R.: Recent developments in explicit constructions of extractors. Bulletin of the EATCS 77, 67-95 (2002)
17. Yao, A.C.: Theory and applications of trapdoor functions. In: FOCS 1982: Proceedings of the 23rd IEEE Annual Symposium on Foundations of Computer Science, pp. 80-91 (1982)