A generalization of DDH with applications to protocol analysis and computational soundness

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

Volumn 4622 LNCS, Issue , 2007, Pages 482-499

  Bresson, Emmanuel ^a   Lakhnech, Yassine ^b   Mazaré, Laurent ^c   Warinschi, Bogdan ^d  

^a DCSSI Crypto Lab

^b VERIMAG   (France)

^c Amadeus SAS ^*

^d UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Computational soundness; Diffie Hellman assumptions; Protocol security; Provable security

Indexed keywords

COMPUTATIONAL COMPLEXITY; NETWORK SECURITY; PROBLEM SOLVING;

COMPUTATIONAL SOUNDNESS; DECISIONAL DIFFIE-HELLMAN (DDH) ASSUMPTION; GROUP-KEY EXCHANGE PROTOCOLS; PROTOCOL SECURITY; PROVABLE SECURITY;

NETWORK PROTOCOLS;

EID: 38049082991     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74143-5_27     Document Type: Conference Paper

References (23)

1. Abadi, M., Rogaway, P.: Reconciling two views of cryptography (the computational soundness of formal encryption). In: IFIP TCS2000, pp. 3-22 (2000)
2. Bao, F., Deng, R., Zhu, H.: Variations of Diffie-Hellman problem. In: Qing, S., Gollmann, D., Zhou, J. (eds.) ICICS 2003. LNCS, vol. 2836, pp. 301-312. Springer, Heidelberg (2003)
3. Bellare, M., Boldyreva, A., Micali, S.: Public-key encryption in a multi-user setting: Security proofs and improvements. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 259-274. Springer, Heidelberg (2000)
4. Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. of Computing 13, 850-864 (1984)
5. Boneh, D., Boyen, X., Goh, E.-J.: Hierarchical identity based encryption with constant size ciphertext. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 440-456. Springer, Heidelberg (2005)
6. Bresson, E., Chevassut, O., Pointcheval, D.: Group Diffie-Hellman key exchange secure against dictionary attacks. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 497-514. Springer, Heidelberg (2002)
7. Bresson, E., Chevassut, O., Pointcheval, D.: The group Diffie-Hellman problems. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol. 2595, pp. 325-338. Springer, Heidelberg (2003)
8. Burmester, M., Desmedt, Y.: A secure and efficient conference key distribution system (extended abstract). In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 275-286. Springer, Heidelberg (1995)
9. Canetti, R.: Towards realizing random oracles: Hash functions that hide all partial information. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 455-469. Springer, Heidelberg (1997)
10. Coppersmith, D., Shparlinski, I..: On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping. J. of Cryptology 13(2), 339-360 (2000)
11. Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 13-25. Springer, Heidelberg (1998)
12. Dolev, D., Yao, A.: On the security of public key protocols. IEEE IT 29(12), 198-208 (1983)
13. ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithm. IEEE IT 31(4), 469-472 (1985)
14. Katz, J., Yung, M.: Scalable protocols for authenticated group key exchange. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 110-125. Springer, Heidelberg (2003)
15. Kiltz, E.: A tool box of cryptographic functions related to the Diffie-Hellman function. In: Indocrypt '01, pp. 339-350 (2001)
16. Maurer, U., Wolf, S.: Diffie-Hellman oracles. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 268-282. Springer, Heidelberg (1996)
17. Micciancio, D., Panjwani, S.: Adaptive security of symbolic encryption. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 245-263. Springer, Heidelberg (2005)
18. Micciancio, D., Warinschi, B.: Completeness theorems for the Abadi-Rogaway logic of encrypted expressions. J. of Computer Security. Preliminary version in WITS 2002 (2004)
19. Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. In: FOCS '97, pp. 458-467 (1997)
20. Sadeghi, A.-R., Steiner, M.: Assumptions related to discrete logarithms: Why subtleties make a real difference. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 244-261. Springer, Heidelberg (2001)
21. Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 256-266. Springer, Heidelberg (1997)
22. x2. IPL 83(2), 109-113 (2002)
23. Steiner, M., Tsudik, G., Waidner, M.: Diffie-Hellman key distribution extended to group communication. In: ACM CCS 96, pp. 31-37. ACM Press, New York (1996)