Results 171 to 180 of about 2,843 (216)

SPKSE: secure public key searchable encryption withstand keyword guessing attacks. [PDF]

Sci Rep
Shi D, Xu M, Cao C, Cheng H.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Separating Decision Diffie–Hellman from Computational Diffie–Hellman in Cryptographic Groups

Journal of Cryptology, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Antoine Joux, Joux Antoine
exaly   +3 more sources

The l-th power Diffie–Hellman problem and the l-th root Diffie–Hellman problem

Applicable Algebra in Engineering, Communications and Computing, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dongyoung Roh
exaly   +2 more sources

On the bit security of the Diffie-Hellman key

Applicable Algebra in Engineering, Communications and Computing, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ian F Blake, Igor E Shparlinski, Shparlinski Igor E   +2 more
exaly   +2 more sources

On the Distribution of Diffie--Hellman Triples with Sparse Exponents

SIAM Journal on Discrete Mathematics, 2001
Let \(p\) be an \((n+1)\)-bit prime and \(g\) be a primitive root modulo \(p\). In [\textit{R. Canetti, J. B. Friedlander} and \textit{I. E. Shparlinski}, J. Lond. Math. Soc. (2) 59, 799-812 (1999; Zbl 0935.11028)] and [\textit{R. Canetti, J. B. Friedlander, S. Konyagin, M. Larsen, D. Lieman} and \textit{I. E. Shparlinski}, Isr. J. Math. 120, Pt. A, 23-
John B Friedlander, Igor E Shparlinski
exaly   +3 more sources

The Diffie–Hellman Protocol

Designs, Codes and Cryptography, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ueli M. Maurer, Stefan Wolf 0001
openaire   +1 more source

A Quantum Diffie-Hellman Protocol

2014 IEEE 11th International Conference on Mobile Ad Hoc and Sensor Systems, 2014
In 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), 2002
Let 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

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