首页> 外文会议>International coference on provable security >Authenticated Key Exchange Protocols Based on Factoring Assumption
【24h】

Authenticated Key Exchange Protocols Based on Factoring Assumption

机译:基于分解假设的认证密钥交换协议

获取原文

摘要

This paper investigates authenticated key exchange protocols over signed quadratic residues group QR_N~+, which is originally used for encryption schemes. The key technical tool developed by Hofheinz et al. is that in group QR_N~+ the strong Diffie-Hellman (SDH) problem is implied by the factoring assumption. To apply group QR_N~+, to authenticated key exchange protocols in the enhanced Canetti-Krawczyk (eCK) model, we extend Hofheinz et al.'s technique and introduce a new proof approach called k-th power. The k-th power proof approach is almost generic, i.e., applying it to many, if not all, existing authenticated Diffie-Hellman key exchange protocols in eCK model under gap assumption immediately produces protocols in eCK model under factoring assumption if they work over QR_N~+,. As one application of k-th power approach, we show that FS protocol, in which k is a constant, is provably secure in eCK model under factoring assumption if it works over QR_N~+. Our technique also applies to other protocols, e.g., UP,HMQV and its variants, in which A: is a non-constant, but at the cost of degrading a factor in the reduction.
机译:本文研究了最初用于加密方案的带符号二次残基组QR_N〜+上的认证密钥交换协议。 Hofheinz等人开发的关键技术工具。是在QR_N〜+组中,分解假设隐含了强Diffie-Hellman(SDH)问题。为了将组QR_N〜+应用于增强的Canetti-Krawczyk(eCK)模型中已认证的密钥交换协议,我们扩展了Hofheinz等人的技术,并引入了一种新的证明方法,称为k次方。第k个能力证明方法几乎是通用的,即,如果将其应用于QR_N之上,则在间隙假设下将其应用于eCK模型中的许多(如果不是全部)现有的经过身份验证的Diffie-Hellman密钥交换协议,则会立即在分解假设下生成eCK模型中的协议。 〜+ ,.作为第k个幂方法的一种应用,我们证明了在k常数的FS协议在eCK模型中,如果在QR_N〜+上工作,在分解假设下是可证明安全的。我们的技术还适用于其他协议,例如UP,HMQV及其变体,其中A:是非恒定的,但代价是降低了减少率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号