getCITED   
  Home     Search     Add Content     Reports     Help  
Edit Publication | Edit Contributors | Delete Publication | Edit References | Edit Citations
Add to Bookstack | Show Bookstack | Change Bookstack

A Provable Secure ID-Based Explicit Authenticated Key Agreement Protocol Without Random Oracles

Post a Comment
CONTRIBUTORS:
  Author Tian, Hai-Bo
  Author Susilo, Willy
  Author Ming, Yang
  Author Wang, Yu-Min
JOURNAL:
  Journal of Computer Science and Technology, 23(5), 832 - 842.
YEAR: 2008
PUB TYPE: Journal Article
SUBJECT(S): None
DISCIPLINE: Computer Science
HTTP: http://jcst.ict.ac.cn/content/papere.asp?lg=en&i=8514
LANGUAGE: English
PUB ID: 103-445-306 (Last edited on 2008/09/21 19:08:31 GMT-6)
SPONSOR(S):
 
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  
 References   1 
 Comments  
 Quality      0/0.00 
 Interest      0/0.00 
 View(er)s   1/36 
Quality
  N/A
High
  7
  6
  5
  4
  3
  2
  1
Low
Interest
  N/A
High
  7
  6
  5
  4
  3
  2
  1
Low
Prev | Next

    ABOUT getCITED   |    CONTACT US   |    USER INFO   |    PREFERENCES   |    PRIVACY   |    LOG IN   
Comments? Suggestions? Send them to feedback@getCITED.org.

Copyright © 2000-2006 getCITED Inc. All Rights Reserved.