a590003

Multi-instance Security and Password-based Cryptography 17
3. M. Bellare, A. Boldyreva, and S. Micali. Public-key encryption in a multi-user setting:
Securityproofs and improvements. InB. Preneel, editor, EUROCRYPT 2000,
volume 1807 of LNCS, pages 259–274. Springer, May 2000.
4. M. Bellare, A. Desai, E. Jokipii, and P. Rogaway. A concrete security treatment
of symmetric encryption. In 38th FOCS, pages 394–403. IEEE Computer Society
Press, Oct. 1997.
5. M. Bellare, D. Pointcheval, and P. Rogaway. Authenticated key exchange secure
against dictionary attacks. In B. Preneel, editor, EUROCRYPT 2000, volume 1807
of LNCS, pages 139–155. Springer, May 2000.
6. M. Bellare, T. Ristenpart, and S. Tessaro. Multi-instance security and its application
to password-based cryptography. Cryptology ePrint Archive, Report
2012/196, 2012. http://eprint.iacr.org/.
7. M.Bellare andP.Rogaway. Randomoracles arepractical:Aparadigmfordesigning
efficient protocols. In V. Ashby, editor, ACM CCS 93, pages 62–73. ACM Press,
Nov. 1993.
8. X. Boyen. Halting password puzzles: hard-to-break encryption from humanmemorable
keys. In Proceedings of 16th USENIX Security Symposium on USENIX
Security Symposium, page 9. USENIX Association, 2007.
9. X. Boyen. New paradigms for password security (keynote lecture). In Y. Mu,
W. Susilo, and J. Seberry, editors, ACISP 08, volume 5107 of LNCS, pages 1–5.
Springer, July 2008.
10. R. Canetti, S. Halevi, J. Katz, Y. Lindell, and P. D. MacKenzie. Universally composable
password-based key exchange. In R. Cramer, editor, EUROCRYPT 2005,
volume 3494 of LNCS, pages 404–421. Springer, May 2005.
11. J.-S. Coron, Y. Dodis, C. Malinaud, and P. Puniya. Merkle-Damgård revisited:
How to construct a hash function. In V. Shoup, editor, CRYPTO 2005, volume
3621 of LNCS, pages 430–448. Springer, Aug. 2005.
12. Y. Dodis, R. Gennaro, J. Håstad, H. Krawczyk,and T. Rabin. Randomness extraction
and keyderivation usingthe CBC, cascade and HMACmodes. In M. Franklin,
editor, CRYPTO 2004, volume 3152 of LNCS, pages 494–510. Springer, Aug. 2004.
13. Y. Dodis, R. Impagliazzo, R. Jaiswal, and V. Kabanets. Security amplification for
interactive cryptographic primitives. In O. Reingold, editor, TCC 2009, volume
5444 of LNCS, pages 128–145. Springer, Mar. 2009.
14. R. Gennaro and Y. Lindell. A framework for password-based authenticated key
exchange. In E. Biham, editor, EUROCRYPT 2003, volume 2656 of LNCS, pages
524–543. Springer, May 2003.
15. O. Goldreich. Three XOR-Lemmas — An exposition, 1995. Available at: http:
//www.wisdom.weizmann.ac.il/.
16. O. Goldreich, R. Impagliazzo, L. A. Levin, R. Venkatesan, and D. Zuckerman.
Security preserving amplification of hardness. In 31st FOCS, pages 318–326. IEEE
Computer Society Press, Oct. 1990.
17. O. Goldreich and L. A. Levin. A hard-core predicate for all one-way functions. In
21st ACM STOC, pages 25–32. ACM Press, May 1989.
18. O. Goldreich, N. Nisan, and A. Wigderson. On Yao’s XOR-lemma. In Studies in
Complexity and Cryptography. Miscellanea on the Interplay between Randomness
and Computation, volume 6650 of LNCS, pages 273–301. Springer, 2011.
19. I. Haitner, D. Harnik, and O. Reingold. On the power of the randomized iterate.
In C. Dwork, editor, CRYPTO 2006, volume 4117 of LNCS, pages 22–40. Springer,
Aug. 2006.
14. Multi-Instance Security