搜索结果: 1-9 共查到“军事学 Diffie-Hellman Problem”相关记录9条 . 查询时间(0.049 秒)
Bit Security of the Hyperelliptic Curves Diffie-Hellman Problem
Hyperelliptic curves Bit Security Diffie-Hellman Problem
<
2015/12/29
The Diffie-Hellman problem as a cryptographic primitive plays an
important role in modern cryptology. The Bit Security or Hard-Core Bits of
Diffie-Hellman problem in arbitrary finite cyclic group is...
Hardcore Predicates for a Diffie-Hellman Problem over Finite Fields
Hardcore Bits Diffie-Hellman Problem Finite Fields Elliptic Curves
<
2013/4/18
A long-standing open problem in cryptography is proving the existence of (deterministic) hard-core predicates for the Diffie-Hellman problem defined over finite fields. In this paper we make progress ...
On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields
Static Diffie-Hellman problem elliptic curves
<
2010/4/7
We show that for any elliptic curve E(Fqn), if an adversary
has access to a Static Diffie-Hellman Problem (SDHP) oracle, then by
making O(q1− 1n+1 ) SDHP oracle queries during an initial learn...
Boneh-Boyen signatures and the Strong Diffie-Hellman problem
Boneh-Boyen signatures Strong Diffie-Hellman problem
<
2009/6/15
The Boneh-Boyen signature scheme is a pairing based short signature scheme which is
provably secure in the standard model under the q-Strong Diffie-Hellman assumption. In this paper,
we prove the co...
Strongly Secure Authenticated Key Exchange Protocol Based on Computational Diffie-Hellman Problem
Authenticated key exchange CDH problem Twin DH problem Trapdoor test
<
2009/6/10
Currently, there are a lot of authenticated key exchange
(AKE) protocols in literature. However, the security proofs of this kind
of protocols have been established to be a non-trivial task. The mai...
The Diffie-Hellman problem and generalization of Verheul’s theorem
Diffie-Hellman problem generalization Verheul’s theorem
<
2009/6/9
Bilinear pairings on elliptic curves have been of much interest in cryptography
recently. Most of the protocols involving pairings rely on the
hardness of the bilinear Diffie-Hellman problem. In con...
An ID-based Authenticated Key Exchange Protocol Based on Bilinear Diffie-Hellman Problem
ID-based Authenticated key exchange BDH problem
<
2009/6/4
In this paper, we present a new ID-based two-party authen-
ticated key exchange (AKE) protocol, which makes use of a
new technique called twin Die-Hellman problem proposed
by Cash, Kiltz and Shoup...
The Twin Diffie-Hellman Problem and Applications
Twin Diffie-Hellman Problem random oracle model Cramer-Shoup encryption
<
2009/6/2
We propose a new computational problem called the twin Diffie-Hellman problem. This
problem is closely related to the usual (computational) Diffie-Hellman problem and can be used
in many of the same...
Attack on an Identification Scheme Based on Gap Diffie-Hellman Problem
Identification Scheme Gap Diffie-Hellman Problem
<
2009/4/9
Attack on an Identification Scheme Based on Gap Diffie-Hellman Problem.