• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Cryptology in India(INDOCRYPT 2005); 20051210-12; Bangalore(IN) >How to Construct Universal One-Way Hash Functions of Order r
【24h】

How to Construct Universal One-Way Hash Functions of Order r

机译：如何构造阶r的通用单向哈希函数

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

摘要

At ASIACRYPT 2004, Hong et al. introduced the notion of UOWHFs of order r > 0. A UOWHF has the order r if it is infeasible for any adversary to win the game for UOWHF where the adversary is allowed r adaptive queries to the hash function oracle before outputting his target message. They showed that if a UOWHF has the order r, its some-round MD (Merkle-Damgard) or some-level TR (TRee) extension is a UOWHF. Since MD and TR extensions do not require additional key values except the key of compression functions for hashing, their result means that the order of UOWHFs can be useful for minimizing the total key length. In this paper we study how to construct such UOWHFs of order r. As the first step, we observe Bellare-Rogaway UOWHF and Naor-Yung UOWHF. It is shown that Bellare-Rogaway UOWHF has the order 0 and that Naor-Yung UOWHF has the order 1. We generalize the construction of Naor-Yung UOWHF based on a one-way permutation to that of the UOWHF of order r.
机译：Hong等人在2004年的ASIACRYPT中引入了顺序r> 0的UOWHF的概念。如果任何对手都无法赢得UOWHF的比赛，则UOWHF的顺序为r。在这种情况下，允许对手r对散列函数oracle进行自适应查询，然后输出其目标消息。他们表明，如果一个UOWHF的阶数为r，那么它的某一轮MD（Merkle-Damgard）或某个级别的TR（TRee）扩展名就是一个UOWHF。由于MD和TR扩展除了用于散列的压缩函数的键外不需要其他键值，因此其结果意味着UOWHF的顺序对于最小化总键长很有用。在本文中，我们研究了如何构建r阶的UOWHF。第一步，我们观察Bellare-Rogaway UOWHF和Naor-Yung UOWHF。结果表明，Bellare-Rogaway UOWHF的阶数为0，Naor-Yung UOWHF的阶数为1。我们将单向排列的Naor-Yung UOWHF的构造推广到r阶的UOWHF。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号