The group Diffie-Hellman problems

被引：0

作者：

Bresson, E

Chevassut, O

Pointcheval, D

机构：

[1] Ecole Normale Super, F-75230 Paris 05, France

[2] Lawrence Berkeley Natl Lab, Berkeley, CA 94720 USA

[3] Catholic Univ Louvain, B-31348 Louvain, Belgium

来源：

SELECTED AREAS IN CRYPTOGRAPHY | 2003年 / 2595卷

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页码：325 / 338

页数：14

共 50 条

[41] An improvement of the Diffie-Hellman noncommutative protocol
Roman'kov, Vitaly
DESIGNS CODES AND CRYPTOGRAPHY, 2022, 90 (01) : 139 - 153
[42] On the bit security of the Diffie-Hellman key
Ian F. Blake
Theo Garefalakis
Igor E. Shparlinski
Applicable Algebra in Engineering, Communication and Computing, 2006, 16 : 397 - 404
[43] On the bit security of the Diffie-Hellman key
Blake, IF
Garefalakis, T
Shparlinski, IE
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2006, 16 (06) : 397 - 404
[44] A note on the interpolation of the Diffie-Hellman mapping
Winterhof, A
BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2001, 64 (03) : 475 - 477
[45] A dynamic secret sharing scheme based on the factoring and Diffie-Hellman problems
Lee, WB
Chang, CC
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1998, E81A (08) : 1733 - 1738
[46] Simple and efficient threshold cryptosystem from the Gap Diffie-Hellman group
Baek, J
Zheng, YL
GLOBECOM'03: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-7, 2003, : 1491 - 1495
[47] Equivalences and Black-Box Separations of Matrix Diffie-Hellman Problems
Villar, Jorge L.
PUBLIC-KEY CRYPTOGRAPHY (PKC 2017), PT I, 2017, 10174 : 435 - 464
[48] Group Diffie-Hellman key exchange secure against dictionary attacks
Bresson, E
Chevassut, O
Pointcheval, D
ADVANCES IN CRYPTOLOGY - ASIACRYPT 2002, PROCEEDINGS, 2002, 2501 : 497 - 514
[49] On Diffie-Hellman key agreement with short exponents
vanOorschot, PC
Wiener, MJ
ADVANCES IN CRYPTOLOGY - EUROCRYPT '96, 1996, 1070 : 332 - 343
[50] A one round protocol for tripartite Diffie-Hellman
Joux, A
ALGORITHMIC NUMBER THEORY, 2000, 1838 : 385 - 393

← 1 2 3 4 5 →