期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

标准模型下通用可组合的口令认证密钥交换协议 被引量：9

Universal Composable Password Authenticated Key Exchange Protocol in the Standard Model
在线阅读 下载PDF
导出
摘要 通过构造不可延展的、可提取的且是弱模拟可靠的陷门承诺体制,以及相应的平滑投射Hash函数簇,设计了一个高效的通用可组合(universal composable,简称UC)安全的两方口令认证密钥交换(password authenticated key exchange,简称PAKE)协议,并在静态腐化模型下给出了严格的安全性证明.该协议使得PAKE协议在UC框架下达到了最优的两轮.与已有的协议相比,该协议避免了零知识证明协议的使用,在保持计算复杂度相当的前提下有效地提高了通信效率. Through constructing and utilizing non-malleable,extractable,and weak simulation-sound trapdoor commitment schemes and corresponding smooth projective hash function familes,this paper proposes an efficient two-party password authenticated key exchange（PAKE） protocol within the universal composable（UC） framework,which is the optimal two-round PAKE protocol in this setting.Rigorous security proofs based on standard assumptions in the presence of static corruption adversary are then given out.Comparisons with previously proposed protocols show that,this protocol avoids the use of zero-knowledge protocols,and achieves a higher performance in terms of communication efficiency while attaining a comparable computational complexity
作者 胡学先 张振峰 刘文芬
机构地区 解放军信息工程大学信息工程学院 中国科学院软件研究所信息安全国家重点实验室
出处 《软件学报》 EI CSCD 北大核心 2011年第11期2820-2832,共13页 Journal of Software
基金 国家自然科学基金(60873261) 国家高技术研究发展计划(863)(2009AA01Z417) 国家科技支撑计划(2008BAH37B02-2)
关键词 口令认证 密钥交换协议 通用可组合 标准模型 password authenticated key exchange protocol universal composable standard model
分类号 TP309 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献22

  • 1Peikert C, Waters B. Lossy trapdoor functions and their applications. In: Proc. of the 40th Annual ACM Symp. on Theory of Computing (STOC). ACM Press, 2008. 187-196. [doi: 10.1145/1374376.1374406].
  • 2Boyko V, MacKenzie P, Patel S. Provably secure password-authenticated key exchange using Diffie-Hellman. In: Preneel B, ed. Proc. of the EUROCRYPT 2000. LNCS 1807, Berlin: Springer-Verlag, 2000. 156-17l.
  • 3Gennaro R, Lindell Y. A framework for password-based authenticated key exchange. In: Biham E, ed. Proc. of the EUROCRYPT 2003. LNCS 2656, Berlin: Springer-Verlag, 2003. 524 543. [doi: 10.1007/3-540-39200-9_33].
  • 4Canetti R. Universally composable security: A new paradigm for cryptographic protocols. In: Proc. of the 42nd 1EEE Symp. on Foundations of Computer Science (FOCS). New York: IEEE Computer Society, 2001. 136-145. Idol: 10.1109/SFCS.2001.959888].
  • 5Canetti R, Krawczyk H. Universally composable notions of key exchange and secure channels. In: Knudsen LR, ed. Proc. of the EUROCRYPT 2002. LNCS 2332, Berlin: Springer-Verlag, 2002. 337 351. [doi: 10.1007/3-540-46035-7_22].
  • 6Jiang SQ, Gong G. Password based key exchange with mutual authentication. In: Handschuh H, Hasan A, eds. Proc. of the SAC 2004. LNCS 3357, Berlin: Springer-Verlag, 2004. 267-279.
  • 7Bellare M, Pointcheval D, Rogaway P. Authenticated key exchange secure against dictionary attack. In: Preneel B, ed. Proc. of the EUROCRYPT 2000. LNCS 1807, Berlin: Springer-Verlag, 2000. 140-156.
  • 8Cramer R, Shoup V. Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: Knudsen LR, ed. Proc. of the EUROCRYPT 2002. LNCS 2332, Berlin: Springer-Verlag, 2002.45-64. [doi: 10.1007/3-540-46035- 7_41.
  • 9Canetti R, Rabin T. Universal composition with joint state. In: Boneh D, ed. Proc. of the CRYPTO 2003. LNCS 2729, Berlin: Springer-Verlag, 2003. 265-281. [doi: 10.1007/978-3-540-45146-4 16].
  • 10MacKenzie P, Yang K. On simulation-sound trapdoor commitments. In: Cachin C, Camenisch J, eds. Proc. of the EUROCRYPT 2004. LNCS 3027, Berlin: Springer-Verlag, 2004. 382-400. [doi: 10.1007/978-3-540-24676-3_23].

二级参考文献50

  • 1Bellare M, Neven G. Transitive signatures based on factoring and RSA. In: Zheng Y, ed. Proc. of the Advances in CryptologyASIACRYPT 2002. LNCS 2501, Berlin, Heidelberg: Springer-Verlag, 2002. 397-4 14.
  • 2Goh EJ, Jarecki S. A signature scheme as secure as the Diffie-Hellman problem. In: Biham E, ed. Proc. of the Advances in Cryptology-EUROCRYPT 2003. LNCS 2656, Berlin, Heidelberg: Springer-Verlag, 2003. 401-415.
  • 3Koeune F. Careful design and integration of cryptographic primitives with contributions to timing attack, padding schemes and random number generators [Ph.D. Thesis]. Louvain-la-Neuve: Universite Catholique de Louvain, 2001.
  • 4Gennaro R, Halevi S, Rabin T. Secure Hash-and-sign signatures without the random oracle. In: Stern J, ed. Proc. of the Advances in Cryptology-EUROCRYPT'99. LNCS 1592, Berlin, Heidelberg: Springer-Verlag, 1999.123-139.
  • 5Cramer R, Shoup V. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk H, ed. Proc. of the Advances in Cryptology-Crypto'98. LNCS 1462, Berlin, Heidelberg: Springer-Verlag, 1998. 13-25.
  • 6Needham R, Schroeder M. Using encryption for authentication in large networks of computers. Communications of the ACM, 1978,21 (12) :993 -999.
  • 7Sacco G. Timestamps in key distribution protocols. Communications of the ACM, 1981,24(8):523-536.
  • 8Burrows M, Abadi M, Needham R. A logic for authentication. ACM Trans. on Computer Systems, 1990,8(1):18-36.
  • 9Bellare M, Rogaway P. Entity authentication and key exchange. In: Stinson D.R, ed. Proc. of the Advances in CryptologyCrypto'93. LNCS 773, Berlin, Heidelberg: Springer-Verlag, 1993. 232-249.
  • 10Bellare M. Provably secure session key distribution-The three party case. In: Proc. of the ACM Symp. on the Theory of Computing. New York: ACM Press, 1995.57-66. http:∥doi.acm.org/10.1145/225058.225084.

共引文献112

同被引文献32

引证文献9

二级引证文献51

软件学报
2011年 第11期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部