Y. Zheng, T. Matsumoto and H. Imai: "Duality between two cryptographic primitives", Papers of Technical Group for Information Security, IEICE of Japan,ISEC89-46, March 16, 1990. 16  Home/Search   Document Details and Download   Summary   Related Articles   Check

....pseudo permutations. We also give a simple construction of collision free hash functions from everywhere defined claw free (pseudo ) permutations. 1 Introduction Hash functions with various cryptographic properties have been studied extensively, especially with respect to signing algorithms (see [2, 3, 4, 10, 12, 14, 15]) We focus on the most natural of these functions, the collision free hash functions. A function h is a collision free hash function if jh(x)j jxj Gamma 1 and it is infeasible, given h and 1 k , to find a pair (x; y) so that jxj = jyj = k and h(x) h(y) These functions were first carefully ....

....separator) Property SH implies that the resulting claw free functions are (simple) permutations. 2 Itoh [8] has pointed out that in Theorems 1 and 2 above, the requirement of claw freedom can be replaced in an appropriate way with the requirement of distinction intractability as defined in [14]. 5 Conclusion The motivation for this research is the following open problem: is the existence of one way functions sufficient for the existence of collision free hash functions This paper shows, at least, that answering this question in the affirmative need not imply the equivalence of one way ....

Yuliang Zheng, Tsutomu Matsumoto, and Hideki Imai. Duality between two cryptographic primitives. In Proceedings of the Eighth International Conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, volume 508 of Lecture Notes in Computer Science, pages 379--390, Berlin, 1990. Springer-Verlag.

....on one way permutations. Their construction is based on a UOWHF which compresses a single bit. Also they argued that the existence of secure signature scheme reduces to the existence of a UOWHF. Rompel [52] managed to design a UOWHF from any one way function. Zheng, Matsumoto and Imai observed [69] that there is a duality between PBG and UOWHF. They presented a construction of UOWHF from Blum Micali pseudorandom bit generators. For more details see [45] Zheng, Hardjono and Pieprzyk [67] used UOWHFs to build a family of one way functions which are polynomial time computable and they have ....

Y. Zheng, T. Matsumoto, and H. Imai. Duality between Two Cryptographic Primitives. The 8-th International Conference on Applied Algebra, Algebraic Algorithms and Error Correcting Codes, 1990.

No context found.

Y. Zheng, T. Matsumoto and H. Imai: "Duality between two cryptographic primitives", Papers of Technical Group for Information Security, IEICE of Japan,ISEC89-46, March 16, 1990. 16

....to polynomial time generated initial strings) and constructs UOHs from one way one to one functions (also called one way injections) Naor and Yung use universal hash functions [CW79] WC81] in an essential way. All later constructions of UOHs [ZMI90b] ZMI90c] DY90] Rom90] except that of [ZMI90a], heavily depend upon this idea. Another nice result of [NY89] is that it presents a method for transforming any UOH into a digital signature scheme that is secure against existential forgery under adaptive chosen message attack. 2.4 Reference [ZMI90a] This paper presents a method for ....

....[ZMI90c] DY90] Rom90] except that of [ZMI90a] heavily depend upon this idea. Another nice result of [NY89] is that it presents a method for transforming any UOH into a digital signature scheme that is secure against existential forgery under adaptive chosen message attack. 2. 4 Reference [ZMI90a] This paper presents a method for constructing UOHs from any one way permutations, whose (simutaneously) hard bits have been identified. The construction has two interesting features. One is that it does not apply universal hash functions, and hence is extremely compact, in comparison with most ....

Y. Zheng, T. Matsumoto and H. Imai: "Duality between two cryptographic primitives", Presented at 8-th International Conference on Applied Algebra, Algebraic Algorithms and Error Correcting Codes (AAECC-8), Tokyo, August 1990. A preliminary version appears in IEICE Technical Reports on Information Security, TG ISEC89-46, March 16, 1990.

.... ensembles with length (n) i.e. UOH PSE[ Naor and Yung constructed one way hash functions in the sense of UOH PSE[ under the assumption of the existence of one way injections [NY89] Note that they actually obtained a construction for one way hash functions in the sense of UOH EN [ In [ZMI90] we construct, in a different approach, one way hash functions in the sense of UOH EN [ under the assumption of the existence of one way permutations. Separating initial string ensembles from collision string finders is conceptually much clearer, and enables us to reduce the problem of ....

....(CIH) if for each A, for each polynomial Q, and for all sufficiently large n, PrfA(n; h) 6= g 1=Q(n) when h2RH n . In [Dam89] see also [Dam87] CIH is called collision free function family . Damgard obtained CIHs under the assumption of the existence of claw free pairs of permutations. In [ZMI90], we show that CIHs can be constructed from distinction intractable permutations. We also propose practical CIHs, the fastest of which compress nearly 2n bit long input into n bit long output strings by applying only twice a one way function. CIH defined above is with respect to the Turing machine ....

Y. Zheng, T. Matsumoto and H. Imai: "Duality between two cryptographic primitives", Papers of Technical Group for Information Security, IEICE of Japan,ISEC89-46, March 16, 1990.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC