Menu utilisateur

Accès à distance ? S'identifier sur le proxy UCLouvain

The group Diffie-Hellman problems

Onglets principaux

Bresson, E. Chevassut, O Pointcheval, D

In this paper we study generalizations of the Diffie-Hellman problems recently used to construct cryptographic schemes for practical purposes. The Group Computational and the Group Decisional Diffie-Hellman assumptions not only enable one to construct efficient pseudorandom functions but also to naturally extend the Diffie-Hellman protocol to allow more than two parties to agree on a secret key. In this paper we provide results that add to our confidence in the GCDH problem. We reach this aim by showing exact relations among the GCDH, GDDH, CDH and DDH problems.

Type de document Communication à un colloque (Conference Paper) – Présentation orale avec comité de sélection
Type d'accès Accès restreint
Année de publication 2003
Langue Anglais
Conférence "9th Annual International Workshop on Selected Areas in Cryptography", ST JOHNS(Canada) (Aug 15-16, 2002)
Information sur le périodique "Lecture Notes in Computer Science" - Vol. 2595, p. 325-338 (2003)
Peer reviewed oui
issn 0302-9743
e-issn 1611-3349
Editeur Springer-verlag Berlin (Berlin)
Affiliations UCL - Autre
Liens
Référence bibliographique Bresson, E. ; Chevassut, O ; Pointcheval, D. The group Diffie-Hellman problems.9th Annual International Workshop on Selected Areas in Cryptography (ST JOHNS(Canada), Aug 15-16, 2002). In: Lecture Notes in Computer Science, Vol. 2595, p. 325-338 (2003)
Permalien http://hdl.handle.net/2078.1/61565