Simpler session-key generation from short random passwords

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

Volumn 2951, Issue , 2004, Pages 428-445

  Nguyen, Minh Huyen ^a   Vadhan, Salil ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GOLD;

COMMON REFERENCE STRING; PASSWORD-AUTHENTICATED KEY EXCHANGE; PIN NUMBERS; PROTOCOL CANS; RANDOM PASSWORDS; RANDOM STRING; SESSION KEY; THE STANDARD MODEL;

AUTHENTICATION;

EID: 35048854655     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24638-1_24     Document Type: Article

References (24)

1. Barak, B.: Constant-Round Coin-Tossing With a Man in the Middle or Realizing the Shared Random String Model. IEEE Symposium on Foundations of Computer Science (2002) 345-355
2. Bellare, M., Pointcheval, D., Rogaway, P.: Authenticated Key Exchange Secure against Dictionary Attacks. Advances in Cryptology-Eurocrypt 2000 Proceedings, Lecture Notes in Computer Science 1807 (2000) 139-155
3. Bellare, M., Rogaway, P.: Entity Authentication and Key Distribution. Advances in Cryptology - Crypto 93 Proceedings, Lecture Notes in Computer Science 773 (1994) 232-249
4. Bellovin, S., Merritt, M.: Encrypted Key Exchange: Password-Based Protocols Secure Against Dictionary Attacks. ACM/IEEE Symposium on Research in Security and Privacy (1992) 72-84
5. Bellovin, S., Merritt, M.: Augmented Encrypted Key Exchange: A Password-Based Protocol Secure against Dictionary Attacks and Password File Compromise. ACM Conference on Computer and Communications Security (1993) 244-250
6. Boyarsky, M.: Public-Key Cryptography and Password Protocols: The Multi-User Case. ACM Conference on Computer and Communications Security (1999) 63-72
7. Boyko, V., MacKenzie, P., Patel, S.: Provably Secure Password- Authenticated Key Exchange Using Diffie-Hellman. Advances in Cryptology-Eurocrypt 2000 Proceedings, Lecture Notes in Computer Science 1807 (2000) 156-171
8. Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols. IEEE Symposium on Foundations of Computer Science (2001) 136-145
9. Chor, B., Goldreich, O.: Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity. SIAM Journal on Computing 17:2 (1988) 230-261
10. Diffie, W., Hellman, M.: New Directions in Cryptography. IEEE Transactions on Information Theory 22:6 (1976) 644-654
11. Gennaro, R., Lindell, Y.: A Framework for Password-Based Authenticated Key Exchange. Advances in Cryptology - Eurocrypt 2003 Proceedings, Lecture Notes in Computer Science 2656 (2003) 524-543
12. Goldreich, O., Lindell, Y.: Session-Key Generation Using Human Passwords Only. Advances in Cryptology - Crypto 2001 Proceedings, Lecture Notes in Computer Science 2139 (2001) 408-432
13. Goldreich, O., Wigderson, A.: Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing. Random Structures and Algorithms 11:4 (1997) 315-343
14. Goldwasser, S., Micali, S.: Probabilistic Encryption. Journal of Computer and System Sciences 28:2 (1984) 270-299
15. Halevi, S., Krawczyk, H.: Public-Key Cryptography and Password Protocols. ACM Conference on Computer and Communications Security (1998) 122-131
16. Katz, J., Ostrovsky, R., Yung, M.: Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords. Advances in Cryptology - Eurocrypt 2001 Proceedings, Lecture Notes in Computer Science 2045 (2001) 475-494
17. Kobara, K., Imai, H.: Pretty-Simple Password-Authenticated Key-Exchange Under Standard Assumptions. IECIE Trans. E85-A:10 (2002) 2229-2237
18. Micali, S., Rackoff, C., Sloan, B.: The Notion of Security for Probabilistic Cryptosystems. SIAM Journal on Computing 17 (1988) 412-426
19. Naor, M., Pinkas, B.: Oblivious Transfer and Polynomial Evaluation. ACM Symposium on Theory of Computing. (1999) 245-254
20. Nisan, N., Zuckerman, D.: Randomness is Linear in Space. Journal of Computer and System Sciences 52:1 (1996) 43-52
21. Richardson, R., Kilian, J.: On the Concurrent Composition of Zero-Knowledge Proofs. Advances in Cryptology - Eurocrypt 99 Proceedings, Lecture Notes in Computer Science 1592 (1999) 415-431
22. Shoup, V.: On Formal Models for Secure Key Exchange. Cryptology ePrint Archive (1999) Report 1999/012
23. Srinivasan, A., Zuckerman, D.: Computing with Very Weak Random Sources. IEEE Symposium on Foundations of Computer Science (1994) 264-275
24. Steiner, M., Tsudik, G., Waidner, M.: Refinement and Extension of Encrypted Key Exchange. Operating Systems Review 29:3 (1995) 22-30