Results 181 to 190 of about 29,187 (230)
Some of the next articles are maybe not open access.
A Quantum Diffie-Hellman Protocol
2014 IEEE 11th International Conference on Mobile Ad Hoc and Sensor Systems, 2014In this paper, a quantum version of Diffie-Hellman key agreement protocol is developed using the commutative rotation transformations. Qubits rotated by secret rotation angles and exchanged over a quantum channel are appropriately measured to form a secret shared key.
Pranav Subramaniam, Abhishek Parakh
openaire +1 more source
Diffie-Hellman, decision Diffie-Hellman, and discrete logarithms
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252), 2002Let G be a cyclic group of order n. With respect to polynomial-time non-uniform generic reductions, the Diffie-Hellman problem and the discrete logarithm problem are equivalent in G if and only if n contains no multiple large prime factors. The Diffie-Hellman decision problem is equivalent to the Diffie-Hellman problem in G if and only if all prime ...
U. Maurer, S. Wolf
openaire +1 more source
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
An improvement of the Diffie–Hellman noncommutative protocol
Designs, Codes and Cryptography, 2021\textit{W. Diffie} and \textit{M. E. Hellman} [IEEE Trans. Inf. Theory 22, 644--654 (1976; Zbl 0435.94018)] proposed the first key-exchange protocol which was based on the hardness of the discrete logarithm problem. Subsequently, the commutator key-exchange protocol (AAG) [\textit{I. Anshel} et al., Math. Res. Lett. 6, No.
openaire +1 more source
Revisiting the Karnin, Greene and Hellman Bounds
2008The algebraic setting for threshold secret sharing scheme can vary, dependent on the application. This algebraic setting can limit the number of participants of an ideal secret sharing scheme. Thus it is important to know for which thresholds one could utilize an ideal threshold sharing scheme and for which thresholds one would have to use nonideal ...
Desmedt, Y., King, B., Schoenmakers, B.
openaire +1 more source
A Polynomial Representation of the Diffie-Hellman Mapping
Applicable Algebra in Engineering, Communication and Computing, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wilfried Meidl, Arne Winterhof
openaire +1 more source
Diffie-Hellman without Difficulty
2012An excellent way for a protocol to obtain shared keys is Diffie-Hellman. For the automated verification of security protocols, the use of Diffie-Hellman poses a certain amount of difficulty, because it requires algebraic reasoning. Several tools work in the free algebra and even for tools that do support Diffie-Hellman, the algebraic reasoning becomes ...
openaire +1 more source
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
The Decision Diffie-Hellman problem
1998The Decision Diffie-Hellman assumption (ddh) is a gold mine. It enables one to construct efficient cryptographic systems with strong security properties. In this paper we survey the recent applications of DDH as well as known results regarding its security. We describe some open problems in this area.
openaire +1 more source