The group Diffie-Hellman problems
Conference
·
OSTI ID:801967
In this paper they 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 pseudo-random 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 they provide results that add to their confidence in the GCDH problem. They reach this aim by showing exact relations among the GCDH, GDDH, CDH and DDH problems.
- Research Organization:
- Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
- Sponsoring Organization:
- USDOE Director, Office of Science. Office of Advanced Scientific Computing Research. Mathematical, Information, and Computational Sciences Division (US)
- DOE Contract Number:
- AC03-76SF00098
- OSTI ID:
- 801967
- Report Number(s):
- LBNL-50775; R&D Project: K52007; B& R KJ0102000; TRN: US200223%%437
- Resource Relation:
- Conference: Workshop on Selected Areas in Cryptography (SAC 2002), St. John's, Newfoundland (CA), 08/15/2002--08/16/2002; Other Information: PBD: 20 Jul 2002
- Country of Publication:
- United States
- Language:
- English
Similar Records
Dynamic Group Diffie-Hellman Key Exchange under standard assumptions
Authenticated group Diffie-Hellman key exchange: theory and practice
Provably authenticated group Diffie-Hellman key exchange - The dynamic case (Extended abstract)
Conference
·
Thu Feb 14 00:00:00 EST 2002
·
OSTI ID:801967
Authenticated group Diffie-Hellman key exchange: theory and practice
Thesis/Dissertation
·
Tue Oct 01 00:00:00 EDT 2002
·
OSTI ID:801967
Provably authenticated group Diffie-Hellman key exchange - The dynamic case (Extended abstract)
Conference
·
Thu Sep 20 00:00:00 EDT 2001
·
OSTI ID:801967