Entity authentication and key distribution
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Untraceability in mobile networks
MobiCom '95 Proceedings of the 1st annual international conference on Mobile computing and networking
Untraceable mobility or how to travel incognito
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on computer network security
Identity-Based Encryption from the Weil Pairing
SIAM Journal on Computing
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
A Proof of Revised Yahalom Protocol in the Bellare and Rogaway (1993) Model1
The Computer Journal
Deniable authenticated key establishment for internet protocols
Proceedings of the 11th international conference on Security Protocols
Modular security proofs for key agreement protocols
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
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
On session key construction in provably-secure key establishment protocols
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
Security of two-party identity-based key agreement
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
Identity-based key agreement with unilateral identity privacy using pairings
ISPEC'06 Proceedings of the Second international conference on Information Security Practice and Experience
Efficient identity based ring signature
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
A new two-party identity-based authenticated key agreement
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
HMQV: a high-performance secure diffie-hellman protocol
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
About the security of MTI/C0 and MQV
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
An improved identity-based key agreement protocol and its security proof
Information Sciences: an International Journal
Blind signature and ring signature schemes: Rehabilitation and attack
Computer Standards & Interfaces
Removing Escrow from Identity-Based Encryption
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
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
Enhanced McCullagh-Barreto identity-based key exchange protocols with master key forward security
International Journal of Security and Networks
Strongly secure identity-based authenticated key agreement protocols
Computers and Electrical Engineering
On forward secrecy in one-round key exchange
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
Authenticated key exchange with entities from different settings and varied groups
ProvSec'12 Proceedings of the 6th international conference on Provable Security
Anonymity and one-way authentication in key exchange protocols
Designs, Codes and Cryptography
A new efficient authenticated multiple-key exchange protocol from bilinear pairings
Computers and Electrical Engineering
| Hi-index | 0.00 |
We study the provable security of identity-based (ID-based) key agreement protocols. Although several published protocols have been proven secure in the random oracle model, only a weak adversarial model is considered - the adversary is not allowed to ask Session-Key Reveal queries that will allow the adversary to learn previously established session keys. Recent research efforts devoted to providing a stronger level of security require strong assumptions, such as assuming that the simulator has access to a non-existential computational or decisional oracle. In this work, we propose an ID-based key agreement protocol and prove its security in the widely accepted indistinguishability-based model of Canetti and Krawczyk. In our proof, the simulator does not require access to any non-existential computational or decisional oracle. We then extend our basic protocol to support ad-hoc anonymous key agreement with bilateral privacy. To the best of our knowledge, this is the first protocol of its kind as previously published protocols are for fixed group and provide only unilateral privacy (i.e., only one of the protocol participants enjoy anonymity).