首页> 外文会议>Australasian Conference on 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 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号