• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Information and Communications Security(ICICS 2004); 20041027-29; Malaga(ES) >Sound Approximations to Diffie-Hellman Using Rewrite Rules
【24h】

Sound Approximations to Diffie-Hellman Using Rewrite Rules

机译：使用重写规则对Diffie-Hellman的声音近似

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The commutative property of exponentiation that is necessary to model the Diffie-Hellman key exchange can lead to inefficiency when reasoning about protocols that make use of that cryptographic construct. In this paper we discuss the feasibility of approximating the commutative rule for exponentiation with a pair of rewrite rules, for which in unification-based systems, the complexity of the unification algorithm changes from at best exponential to at worst quadratic in the number of variables. We also derive and prove conditions under which the approximate model is sound with respect to the original model. Since the conditions make the protocol easier to reason about and less prone to error, they often turn out to be in line with generally accepted principles for sound protocol design.
机译：在对使用该密码构造的协议进行推理时，对Diffie-Hellman密钥交换进行建模所需的取幂交换性质可能导致效率低下。在本文中，我们讨论了用一对重写规则近似求幂的交换规则的可能性，为此，在基于统一的系统中，统一算法的复杂度在变量数量上从最佳指数变为最小二次。我们还推导并证明了相对于原始模型而言近似模型健全的条件。由于条件使协议更易于推论并且更不容易出错，因此通常证明它们符合合理的协议设计原则。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号