Anonymous and transparent gateway-based password-authenticated key exchange

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

Volumn 5339 LNCS, Issue , 2008, Pages 133-148

  Abdalla, Michel ^a   Izabachène, Malika ^a   Pointcheval, David ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS CONTROL; AUTHENTICATION; CRYPTOGRAPHY; GATEWAYS (COMPUTER NETWORKS); INFORMATION SERVICES; INFORMATION THEORY; INTERNET; SECURITY OF DATA; SERVERS; TELECOMMUNICATION SYSTEMS;

AUTHENTICATION SERVER (AS); KEY EXCHANGES; PASSWORD PROTECTION; PRIVATE INFORMATION; SECURITY MODELING; SECURITY PROOFS; SECURITY PROPERTIES;

NETWORK SECURITY;

EID: 58449088433     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89641-8_10     Document Type: Conference Paper

References (26)

1. Abdalla, M., Chevassut, O., Fouque, P.-A., Pointcheval, D.: A simple threshold authenticated key exchange from short secrets. In: Roy, B.K, (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 566-584. Springer, Heidelberg (2005)
2. Abdalla, M., Fouque, P.-A., Pointcheval, D.: Password-based authenticated key exchange in the three-party setting. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol. 3386, pp. 65-84. Springer, Heidelberg (2005)
3. Abdalla, M., Izabachène, M., Pointcheval, D.: Anonymous and transparent gateway-based password-authenticated key exchange. In: Franklin, M.K., Hui, L.C.K., Wong, D.S. (eds.) Cryptology and Network Security, 7th International Conference, CANS 2008. LNCS. Springer, Heidelberg (2008), http://www.di.ens.fr/~pointche/pub.html
4. Abdalla, M., Pointcheval, D.: Interactive Diffie-Hellman assumptions with applications to password-based authentication. In: Patrick, A., Yung, M. (eds.) FC 2005. LNCS, vol. 3570, pp. 341-356. Springer, Heidelberg (2005)
5. Bellare, M., Pointcheval, D., Rogaway, P.: Authenticated key exchange secure against dictionary attacks. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 139-155. Springer, Heidelberg (2000)
6. Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: Ashby, V. (ed.) ACM CCS 1993, pp. 62-73. ACM Press, New York (1993)
7. Bellovin, S.M., Merritt, M.: Encrypted key exchange: Password-based protocols secure against dictionary attacks. In: 1992 IEEE Symposium on Security and Privacy, pp. 72-84. IEEE Computer Society Press, Los Alamitos (1992)
8. Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 325-341. Springer, Heidelberg (2005)
9. Boyd, C., Montague, P., Nguyen, K.Q.: Elliptic curve based password authenticated key exchange protocols. In: Varadharajan, V., Mu, Y. (eds.) ACISP 2001. LNCS, vol. 2119, pp. 487-501. Springer, Heidelberg (2001)
10. Boyko, V., MacKenzie, P.D., Patel, S.: Provably secure password-authenticated key exchange using Diffie-Hellman. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 156-171. Springer, Heidelberg (2000)
11. Bringer, J., Chabanne, H., Pointcheval, D., Tang, Q.: Extended private information retrieval and its application in biometrics authentications. In: Bao, F., Ling, S., Okamoto, T., Wang, H., Xing, C. (eds.) CANS 2007. LNCS, vol. 4856, pp. 175-193. Springer, Heidelberg (2007)
12. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42nd FOCS, pp. 136-145. IEEE Computer Society Press, Los Alamitos (2001)
13. Canetti, R., Halevi, S., Katz, J., Lindell, Y., MacKenzie, P.D.: Universally composable password-based key exchange. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 404-421. Springer, Heidelberg (2005)
14. Chor, B., Gilboa, N.: Computationally private information retrieval (extended abstract). In: STOC, pp. 304-313 (1997)
15. Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: FOCS, pp. 41-50 (1995)
16. Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M.: Private information retrieval. J. ACM 45(6), 965-981 (1998)
17. Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186-194. Springer, Heidelberg (1987)
18. Jablon, D.P.: Extended password key exchange protocols immune to dictionary attacks. In: 6th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE 1997), Cambridge, MA, USA, June 18-20, pp. 248-255. IEEE Computer Society, Los Alamitos (1997)
19. Kushilevitz, E., Ostrovsky, R.: Replication is NOT needed: SINGLE database, computationally-private information retrieval. in: 38th FOGS, pp. 364-373. IEEE Computer Society Press, Los Alamitos (1997)
20. Lincoln, L.: Symmetric Private Information Retrieval via Homomorphic Probabilistic Encryption. Ph.D thesis, Rochester Institute of Technology (2006), http://www.cs.rit.edu/7Elbl6598/thesis/Lincoln-full-Dobument.pdf
21. Lucks, S.: Open key exchange: How to defeat dictionary attacks without encrypting public keys. In: Workshop on Security Protocols, École Normale Supérieure (1997)
22. Pointcheval, D., Stern, J.: Security proofs for signature schemes. In: Maurer, U.M. (ed.) EURO CRYPT 1996. LNCS, vol. 1070, pp. 387-398. Springer, Heidelberg (1996)
23. Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. Journal of Cryptology 13(3), 361-396 (2000)
24. Schnorr, C.-P.: Efficient identification and signatures for smart cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 239-252. Springer, Heidelberg (1990)
25. Schnorr, C.-P.: Efficient signature generation by smart cards. Journal of Cryptology 4(3), 161-174 (1991)
26. Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EURO CRYPT 1997. LNCS, vol. 1233, pp. 256-266. Springer, Heidelberg (1997)