Alternative Necessary and Sufficient Conditions for Collision Intractable Hashing

スポンサーリンク

概要

• 論文の詳細を見る

• Damgard defined the notion of a collision intractable hash functions and showed that there exists a collection of collision intractable hash functions if there exists a collection of claw-free permutation pairs. For a long time, the necessary and sufficient condition for the existence of a collection of collision intractable hash functions has not been known, however, very recently Russell finally showed that there exists a collection of collision intractable hash functions iff there exists a collection of claw-free pseudo-permutation pairs. In this paper, we show an alternative necessary and sufficient condition for the existence of a collection of collision intractable hash functions, i.e., there exists a collection of collision intractable hash functions iff there exists a collection of distinction intractable pseudo-permutations.

• 社団法人電子情報通信学会の論文
• 1995-01-25

著者

• Itoh T

  Tokyo Inst. Technol. Tokyo Jpn

• Hayashi K

  Ntt Opitacal Network Systems Lab. Yokosuka‐shi Jpn

• Itoh Toshiya

  Interdisciplinary Graduate School Of Science And Engineering Tokyo Institute Of Technology

• Hayashi Kei

  Interdisciplinary Graduate School of Science and Engineering, Tokyo Institute of Technology

• Itoh Toshiya

  Interdisciplinary Graduate School of Science and Engineering, Tokyo Institute of Technology

関連論文

• Side-Chain Liquid Crystal Block Copolymers with Well-Defined Structures Prepared by Living Anionic Polymerization I. Thermotropic Phase Behavior and Structures of Liquid Crystal Segment in Lamellar Type of Microphase Domain
• Checkers for Adaptive Programs
• Alternative Necessary and Sufficient Conditions for Collision Intractable Hashing
• A Note on AM Languages Outside NP ⋃ co-NP (Special Section on Cryptography and Information Security)
• Demonstrating Possession without Revealing Factors (Special Section on Cryptography and Information Security)
• On the Power of Self-Testers and Self-Correctors (Special Section on Cryptography and Information Security)
• On the Knowledge Tightness of Zero-Knowledge Proofs (Special Section on Cryptography and Information Security)
• Efficient Private Information Retrieval (Special Section on Cryptography and Information Security)
• On the Oracle Entropy and the Average Case Oracle Measure of Knowledge Complexity (Special Section on Cryptography and Information Security)
• On the Knowledge Complexity of Arthur-Merlin Games (Special Section on Cryptography and Information Security)

スポンサーリンク