Efficient ID-based key agreement protocol under the DLDH assumption without random oracles

In this paper, we propose a two party ID-based key agreement protocol without random oracles. Our protocol is proven under the Decision Linear Diffie-Hellman assumption and the most efficient in the existing protocols proven secure without random oracles to the best of our knowledge.