Article thumbnail
Location of Repository

Identity-based key agreement protocols from pairings.

By Zhaohui Cheng, Liqun Chen and Nigel P. Smart

Abstract

In recent years, many identity-based key agreement protocols from pairings have been proposed. However, the security of this type of protocols has been surprisingly difficult to prove. This paper presented a method incorporating a built-in decisional function in this type of protocols, which enables us for the first time to prove a range of security attributes of several protocols based on the weakest possible assumptions. This work also demonstrated the importance of the message membership check and presented methods to do so. The work has serious potential impact on the standardisation of this type of protocols, for example IEEE P1363.3

Publisher: Springer Berlin / Heidelberg
Year: 2007
DOI identifier: 10.1007/s10207-006-0011-9
OAI identifier: oai:eprints.mdx.ac.uk:98
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www.springerlink.com/co... (external link)
  • http://doi.org/10.1007/s10207-... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.