Results 101 to 110 of about 6,041 (213)
Formal proofs of cryptographic security of Diffie-Hellman-based protocols
. We present axioms and inference rules for reasoning about Diffie-Hellman-based key exchange protocols and use these rules to prove authentication and secrecy properties of two important protocol standards, the Diffie-Hellman variant of Kerberos, and ...
Arnab Roy +2 more
core
[[abstract]]In 2008, based on the two-party Diffie-Hellman technique, Biswas proposed a contributory group key exchange protocol called the Group-DH protocol. This contributory property is an important one of group key agreement.
Tseng, Yuh-Min; WU, Tsu-Yang
core
A TPM Diffie-Hellman Oracle [PDF]
This note describes a Diffie-Hellman oracle, constructed using standard Trusted Platform Module (TPM) signature APIs. The oracle allows one to compute the exponentiation of an arbitrary group element to a specified TPM-protected private key.
Tolga Acar, Greg Zaverucha, Lan Nguyen
core
An Observation about Variations of the Diffie-Hellman Assumption [PDF]
We generalize the Strong Boneh-Boyen (SBB) signature scheme to sign vectors; we call this scheme 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 ...
V. Lokam, Satyanaryana +5 more
core
Diffie-Hellman key exchange protocol
In this bachelor's thesis there is explained principle of cryptography, encryption methods and primarily cryptographic protocol key exchange Diffie-Hellman. There is described key exchange process via public channel. Problem of discrete logarithm. Attack
Člupek, Vlastimil
core +1 more source
An ID-based Hybrid Broadcast Signcryption Scheme with User Anonymity
:Broadcast signcryption can make the sender send multi messages to recipients by one operation. In order to efficiently solve the problems of low efficiency, large overhead and privacy security in “one-to-many” communication model, an ID-based broadcast ...
林志强, 杨晓元, 韩益亮
doaj
The Diffie-Hellman problem and generalization of Verheul\u27s theorem
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.
Dustin Moody
core
Practical group signature scheme with verifier-local revocation
An efficient approach of member revocation in group signature is verifier-local revocation.In this approach,revocation messages are only sent to signature verifiers,while signers have no involvement.There are some problems in group signature with ...
LI Ji-guo, SUN Gang, ZHANG Yi-chen
doaj

