Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Entity authentication and key distribution
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Key Agreement Protocols and Their Security Analysis
Proceedings of the 6th IMA International Conference on Cryptography and Coding
Identity-based key agreement protocols from pairings
International Journal of Information Security
Efficient One-Round Key Exchange in the Standard Model
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
An ID-based authenticated key exchange protocol based on bilinear Diffie-Hellman problem
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
A generalization of DDH with applications to protocol analysis and computational soundness
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Stronger security of authenticated key exchange
ProvSec'07 Proceedings of the 1st international conference on Provable security
The twin Diffie-Hellman problem and applications
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Designing efficient authenticated key exchange resilient to leakage of ephemeral secret keys
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Identity-based key exchange protocols without pairings
Transactions on computational science X
Examining indistinguishability-based proof models for key establishment protocols
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Universal designated verifier signature proof (or how to efficiently prove knowledge of a signature)
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Security of two-party identity-based key agreement
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
Making the diffie-hellman protocol identity-based
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
New directions in cryptography
IEEE Transactions on Information Theory
Strongly-secure identity-based key agreement and anonymous extension
ISC'07 Proceedings of the 10th international conference on Information Security
| Hi-index | 0.00 |
In this paper, we provide a sufficient condition, called admissible polynomials, to construct a two-pass identity-based authenticated key exchange (ID-AKE) protocol secure in the identity-based extended Canetti-Krawczyk (id-eCK) model. The proposed ID-AKE protocol is secure under the gap Bilinear Diffie-Hellman assumption in the random oracle model.