首页> 外文会议>International Conference on the Theory and Application of Cryptology and Information Security >Two-Round PAKE from Approximate SPH and Instantiations from Lattices
【24h】

Two-Round PAKE from Approximate SPH and Instantiations from Lattices

机译:从近似SPH和格子的实例化的两轮培养

获取原文

摘要

Password-based authenticated key exchange (PAKE) enables two users with shared low-entropy passwords to establish cryptographically strong session keys over insecure networks. At Asiacrypt 2009, Katz and Vaikuntanathan showed a generic three-round PAKE based on any CCA-secure PKE with associated approximate smooth projective hashing (ASPH), which helps to obtain the first PAKE from lattices. In this paper, we give a framework for constructing PAKE from CCA-secure PKE with associated ASPH, which uses only two-round messages by carefully exploiting a splittable property of the underlying PKE and its associated non-adaptive ASPH. We also give a splittable PKE with associated non-adaptive ASPH based on the LWE assumption, which finally allows to instantiate our two-round PAKE framework from lattices.
机译:基于密码的身份验证密钥交换(PANK)启用两个具有共享低熵密码的用户,以在不安全网络中建立加密强烈的会话密钥。在亚洲2009年,KATZ和Vaikuntanathan基于任何CCA固定PKE的通用三轮患者,其中包含关联的近似平滑投影散列(ASPH),有助于从格子中获得第一个培养。在本文中,我们提供了一种框架,用于构造来自CCA-Secure PKE的普通与相关的ASPH构建,它只能通过仔细利用底层PKE的可分离属性及其相关的非自适应asph来使用两轮消息。我们还基于LWE假设提供了一个带有相关的非自适应alph的可分段PKE,最终允许从格子中实例化我们的双级普动框架。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号