Sciweavers

36 search results - page 1 / 8
» Secure Bilinear Diffie-Hellman Bits
Sort
View
ACISP
2004
Springer
13 years 8 months ago
Secure Bilinear Diffie-Hellman Bits
The Weil and Tate pairings are a popular new gadget in cryptography and have found many applications, including identity-based cryptography. In particular, the pairings have been u...
Steven D. Galbraith, Herbie J. Hopkins, Igor Shpar...
CCS
2009
ACM
14 years 5 months ago
An ID-based authenticated key exchange protocol based on bilinear Diffie-Hellman problem
In this paper, we present a new ID-based two-party authenticated key exchange (AKE) protocol, which makes use of a new technique called twin Diffie-Hellman problem proposed by Cas...
Hai Huang, Zhenfu Cao
PKC
2010
Springer
161views Cryptology» more  PKC 2010»
13 years 6 months ago
Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
ded abstract of this paper appears in 13th International Conference on Practice and Theory in Public Key Cryptography (PKC) 2010, Lecture Notes in Computer Science Vol. ?, P. Nguye...
Kristiyan Haralambiev, Tibor Jager, Eike Kiltz, Vi...
CTRSA
2010
Springer
191views Cryptology» more  CTRSA 2010»
13 years 8 months ago
Making the Diffie-Hellman Protocol Identity-Based
This paper presents a new identity based key agreement protocol. In id-based cryptography (introduced by Adi Shamir in [33]) each party uses its own identity as public key and rece...
Dario Fiore, Rosario Gennaro
CISC
2007
Springer
117views Cryptology» more  CISC 2007»
13 years 8 months ago
An Efficient ID-Based Proxy Signature Scheme from Pairings
This paper proposes a new ID-based proxy signature scheme based on the bilinear pairings. The number of paring operation involved in the verification procedure of our scheme is onl...
Chunxiang Gu, Yuefei Zhu