A Provable Secure ID-Based Explicit Authenticated Key Agreement Protocol Without Random Oracles
- ISSN号:1000-9000
- 期刊名称:《计算机科学技术学报:英文版》
- 时间:0
- 分类:TP393.08[自动化与计算机技术—计算机应用技术;自动化与计算机技术—计算机科学与技术]
- 作者机构:[1]School of Information Science and Technology, Sun Yat-Sen University, Guangzhou 510275, China, [2]Guangdong Key Laboratory of Information Security Technology, Guang2hou 510275, China, [3]Centre for Computer and Information Security Research (CCISR), School of Computer Science and Software Engineering University of Wollongong, Australia, [4]School of Information Engineering, Chang'an University, Xi ' an 710063, China, [5]State Key Laboratory on ISN, Xidian University, Xi'an 710071, China
- 相关基金:This work is supported by the National Natural Science Foundation of China under Grant No. 60473027, and also by Sun Yat-Sen University under Grant Nos. 35000-2910025 and 35000-3171912.
中文摘要:
在这篇论文,我们在场没有随机的神谕,是 provably 安全的一个基于身份的明确的证实的关键一致性协议。协议采用一个新方法从关键证实钥匙孤立一个会话关键字以便没有在协议的散列函数的直接用法。没有随机的神谕,协议在 Bellare 和 Rogaway 风格模型,的变体被证明安全一个例外到在在基于标志的背景的这个风格模型的当前的验证法。我们相信这关键隔离法是新奇的并且能进一步为构造更多的有效协议被学习。这篇文章的联机版本(做 i:10.1007/s11390-008-9178-z ) 包含增补材料,它对授权用户可得到。
英文摘要:
In this paper, we present an identity-based 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.