a590003

18 Mihir Bellare, Thomas Ristenpart, and Stefano Tessaro
20. R. Impagliazzo and V. Kabanets. Constructive proofs of concentration bounds.
In M. J. Serna, R. Shaltiel, K. Jansen, and J. D. P. Rolim, editors, APPROX-
RANDOM, volume 6302 of LNCS, pages 617–631. Springer, 2010.
21. J. Kelsey, B. Schneier, C. Hall, and D. Wagner. Secure applications of low-entropy
keys. In E. Okamoto, G. I. Davida, and M. Mambo, editors, 1st Information
Security Workshop (ISW ’97), volume 1396 of LNCS, pages 121–134. Springer,
Sept. 1998.
22. T. Kohno. Attacking and repairing the winZip encryption scheme. In V. Atluri,
B. Pfitzmann, and P. McDaniel, editors, ACM CCS 04, pages 72–81. ACM Press,
Oct. 2004.
23. H. Krawczyk. Cryptographic extraction and key derivation: The HKDF scheme. In
T. Rabin, editor, CRYPTO 2010, volume 6223 of LNCS, pages 631–648. Springer,
Aug. 2010.
24. M. Luby and C. Rackoff. A study of password security. In C. Pomerance, editor,
CRYPTO’87, volume 293 of LNCS, pages 392–397. Springer, Aug. 1988.
25. U. M. Maurer, K. Pietrzak, and R. Renner. Indistinguishability amplification.
In A. Menezes, editor, CRYPTO 2007, volume 4622 of LNCS, pages 130–149.
Springer, Aug. 2007.
26. U. M. Maurer, R. Renner, and C. Holenstein. Indifferentiability, impossibility
results on reductions, and applications to the random oracle methodology. In
M. Naor, editor, TCC 2004, volume 2951 of LNCS, pages 21–39. Springer, Feb.
2004.
27. U. M. Maurer and S. Tessaro. Computational indistinguishability amplification:
Tight product theorems for system composition. In S. Halevi, editor,
CRYPTO 2009, volume 5677 of LNCS, pages 355–373. Springer, Aug. 2009.
28. U. M. Maurer and S. Tessaro. A hardcore lemma for computational indistinguishability:
Security amplification for arbitrarily weak PRGs with optimal stretch. In
D. Micciancio, editor, TCC 2010, volume 5978 of LNCS, pages 237–254. Springer,
Feb. 2010.
29. R. Morris and K. Thompson. Password security: a case history. Commun. ACM,
22:594–597, November 1979.
30. S. Myers. Efficient amplification of the security of weak pseudo-random function
generators. Journal of Cryptology, 16(1):1–24, Jan. 2003.
31. A. Panconesi and A. Srinivasan. Randomized distributed edge coloring via an
extensionofthechernoff-hoeffdingbounds. SIAM J. Comput.,26(2):350–368, 1997.
32. PKCS #5: Password-based cryptography standard (rfc 2898). RSA Data Security,
Inc., Sept. 2000. Version 2.0.
33. T. Ristenpart, H. Shacham, and T. Shrimpton. Careful with composition: Limitations
of the indifferentiability framework. In K. G. Paterson, editor, EURO-
CRYPT 2011, volume 6632 of LNCS, pages 487–506. Springer, May 2011.
34. S. Tessaro. Security amplification for the cascade of arbitrarily weak PRPs: Tight
bounds via the interactive hardcore lemma. In Y. Ishai, editor, TCC 2011, volume
6597 of LNCS, pages 37–54. Springer, Mar. 2011.
35. F. Unger. A probabilistic inequality with applications to threshold direct-product
theorems. In 50th FOCS, pages 221–229. IEEE Computer Society Press, Oct. 2009.
36. D. Wagner and I. Goldberg. Proofs of security for the Unix password hashing
algorithm. In T. Okamoto, editor, ASIACRYPT 2000, volume 1976 of LNCS,
pages 560–572. Springer, Dec. 2000.
37. A. C. Yao. Theory and applications of trapdoor functions. In 23rd FOCS, pages
80–91. IEEE Computer Society Press, Nov. 1982.
14. Multi-Instance Security