<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">MCCULLAGH, Noel</style></author><author><style face="normal" font="default" size="100%">BARRETO, Paulo S. L. M.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">New Two-Party Identity-Based Authenticated Key Agreement</style></title><secondary-title><style face="normal" font="default" size="100%">The Cryptographers’ Track at the RSA Conference 2005</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year><pub-dates><date><style  face="normal" font="default" size="100%">February, 2005</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://springerlink.metapress.com/content/1tvxuu9wjeytvcme/?p=277ea6abf5f54b3d950c3d5bcc9e368b&amp;pi=17</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></publisher><pub-location><style face="normal" font="default" size="100%">San Francisco, CA, USA</style></pub-location><abstract><style face="normal" font="default" size="100%">&lt;p&gt;We present a new two-party identity-based key agreement that is more efficient than previously proposed schemes. It is inspired on a new identity-based key pair derivation algorithm first proposed by Sakai and Kasahara. We show how this key agreement can be used in either escrowed or escrowless mode. We also describe conditions under which users of different Key Generation Centres can agree on a shared secret key. We give an overview of existing two-party key agreement protocols, and compare our new scheme with existing ones in terms of computational cost and storage requirements.&lt;/p&gt;</style></abstract></record></records></xml>