A Provable Secure ID-Based Explicit Authenticated Key Agreement Protocol Without Random Oracles
|
 |
|
Post a Comment
|
 |
|
|
|
|
ABSTRACT:
In this paper, we present an identity-based {\it explicit authenticated key agreement protocol that is provably secure without random oracles. The protocol employs a new method to isolate a session key from key confirmation keys so that there is no direct usage of hash functions in the protocol. The protocol is proved secure without random oracles in a variant of Bellare and Rogaway style model, an exception to current proof method in this style model in the ID-based setting. We believe that this key isolation method is novel and can be further studied for constructing more efficient protocols.
|
|
|
|
STATISTICS
|
|
Click on # to view
|
|
Citations
|
|
0
|
|
References
|
|
1
|
|
Comments
|
|
0
|
|
Quality
|
|
0/0.00
|
|
Interest
|
|
0/0.00
|
|
View(er)s
|
|
1/36
|
|
|
|
|
|
|
| Prev |
Next |
|