首页> 外文会议>Information Security and Privacy >Comparing the Pre- and Post-specified Peer Models for Key Agreement
【24h】

Comparing the Pre- and Post-specified Peer Models for Key Agreement

机译:比较关键协议的前后指定对等模型

获取原文
获取原文并翻译 | 示例

摘要

In the pre-specified peer model for key agreement, it is assumed that a party knows the identifier of its intended communicating peer when it commences a protocol run. On the other hand, a party in the post-specified peer model for key agreement does not know the identifier of its communicating peer at the outset, but learns the identifier during the protocol run. In this paper we compare the security assurances provided by the Canetti-Krawczyk security definitions for key agreement in the pre- and post-specified peer models. We give examples of protocols that are secure in one model but insecure in the other. We also enhance the Canetti-Krawczyk security models and definitions to encompass a class of protocols that are executable and secure in both the pre- and post-specified peer models.
机译:在用于密钥协商的预先指定的对等模型中,假定当方开始协议运行时知道其预期的通信对等方的标识符。另一方面,用于密钥协商的后指定对等模型中的一方在一开始就不知道其通信对等方的标识符,但是在协议运行期间学习了该标识符。在本文中,我们比较了Canetti-Krawczyk安全定义为指定对等模型前后指定的密钥协议提供的安全保证。我们给出了在一种模型中安全但在另一种模型中不安全的协议示例。我们还增强了Canetti-Krawczyk的安全性模型和定义,使其包含一类在指定对等模型之前和之后均可执行且安全的协议。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号