Results 11 to 20 of about 6,041 (213)
Quantum Diffie–Hellman key exchange
APL QuantumThe Diffie–Hellman key exchange plays a crucial role in conventional cryptography, as it allows two legitimate users to establish a common, usually ephemeral, secret key.
Georgios M. Nikolopoulos
doaj +5 more sources
The Group Diffie-Hellman Problems [PDF]
, 2003 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 pseudo-random functions but also to naturally extend the Diffie-Hellman protocol to allow ...
Emmanuel Bresson +2 more
core +5 more sources
The Twin Diffie-Hellman Problem and Applications [PDF]
Journal of Cryptology, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
D. Cash (Charles David) +2 more
openaire +7 more sources
Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups.
IACR Cryptol. ePrint Arch., 2001 In many cases, the security of a cryptographic scheme based on Diffie--Hellman does in fact rely on the hardness of the Diffie--Hellman Decision problem.
Antoine Joux, Kim Nguyen
openaire +2 more sources
On The Diffie-Hellman Assumption.
IACR Cryptol. ePrint Arch., 2008 We generalize the Strong Boneh-Boyen (SBB) signature scheme to sign vectors (GSBB). We show that if a particular (but most natural) average case reduction from SBB to GSBB exists, then the Strong Diffie-Hellman (SDH) and the Computational Diffie-Hellman (
Raghav Bhaskar +5 more
openaire +2 more sources
On the index of the Diffie–Hellman mapping [PDF]
Applicable Algebra in Engineering, Communication and Computing, 2020 In this paper, the authors determine the index of the univariate Diffie-Hellman mapping \(d(\gamma^a) = \gamma^{a^2}\), \(0 \le a \le n-1\), and \(\gamma\) is a generator of a cyclic group \(G\) of order \(n\). They show that any mapping of small index coincides with \(d\) only on a small subset of \(G\).
Işık Lavrauw, Leyla, Winterhof, Arne
openaire +2 more sources
An Algebraic Framework for Diffie-Hellman Assumptions [PDF]
Journal of Cryptology, 2013 Funded by a Sofja Kovalevskaja Award of the Alexander von Humboldt Foundation and the German Federal Ministry for Education and Research. Partially supported by the Spanish Government through projects MTM2009-07694 and Consolider Ingenio 2010 CDS2007-00004 ARES.
Alex Escala +4 more
openaire +14 more sources
Easy Decision Diffie-Hellman Groups [PDF]
LMS Journal of Computation and Mathematics, 2004 AbstractThe decision Diffie-Hellman problem (DDH) is a central computational problem in cryptography. It is known that the Weil and Tate pairings can be used to solve many DDH problems on elliptic curves. Distortion maps are an important tool for solving DDH problems using pairings, and it is known that distortion maps exist for all super-singular ...
Steven D. Galbraith, Victor Rotger
openaire +3 more sources
, 1996 This paper consists of three parts. First, various types of Diffie-Hellman oracles for a cyclic group G and subgroups of G are defined and their equivalence is proved. In particular, the security of using a subgroup of G instead of G in the Diffie-Hellman protocol is investigated.
Ueli M. Maurer, Stefan Wolf 0001
openaire +1 more source
On-The-Fly Diffie-Hellman for IoT
2019 38th International Conference of the Chilean Computer Science Society (SCCC), 2019 6 pages, 1 figure, 1 table ...
Jaime Díaz Arancibia +2 more
openaire +2 more sources