Y. Dodis and L. Reyzin. On the power of claw-free permutation. In Security in Communication Networks, 2002.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....of f together with another function g that has uniform l Gamma 1 bits output. It has the same flaw as the classic proof but does apply to ESIGN D and ESIGN R. This paragraph was not in the preproceedings distributed at the SCN 02 conference ; it uses the results of Dodis and Reyzin [3] presented at the conference. The security proof works as follows: most queries for H(m) are answered as in the classic FDH proof, but a proportion of about is answered with the value g(z) for a random z. To answer a signature query for m, a query for H(m) is simulated and the signature is the ....

Y. Dodis and L. Reyzin. On the Power of Claw-Free Permutations. Proc. SCN'02 (this book), 2002.

....intractability of f together with another function g that has uniform l 1 bits output. It has the same flaw as the classic proof but does apply to ESIGN D and ESIGN R. This paragraph was not in the preproceedings distributed at the SCN 02 conference ; it uses the results of Dodis and Reyzin [3] presented at the conference. The security proof works as follows: most queries for H(m) are answered as in the classic FDH proof, but a proportion of about is answered with the value g(z) for a random z. To answer a signature query for m, a query for H(m) is simulated and the signature is the ....

Y. Dodis and L. Reyzin. On the Power of Claw-Free Permutations. Proc. SCN'02 (this book), 2002.

No context found.

Y. Dodis and L. Reyzin. On the power of claw-free permutations. In Conference on Security in Communication Networks, 2002.

No context found.

Y. Dodis and L. Reyzin. On the Power of Claw-Free Permutations. SCN 2002.

No context found.

Y. Dodis and L. Reyzin. On the Power of Claw-Free Permutations. SCN 2002.

No context found.

Yevgeniy Dodis and Leonid Reyzin. On the power of claw-free permutations. In Conference on Security in Communication Networks, 2002.

....is negligible in the security parameter # of the generation algorithm. CLAW FREE PERMUTATIONS. To improve the exact security of our constructions, we will also talk about a general class of TDPs those induced by a family of claw free permutation pairs [17] following the observation made by [13]. In this context, the generation algorithm outputs (f, f 1 , g) where g is another efficient permutation over the same domain as f . The task of the PPT adversary now is to find a claw (x, z) i.e. f(x) g(z) which it succeeds at with probability # claw , negligible in #. It is trivial ....

....on random g(z) On the other hand, all known TDP families, such as RSA, Rabin, and Paillier, are easily seen to be induced by some claw free permutation families with # claw = # TDP . Thus, a tight reduction to claw freeness of such families implies a tight reduction to inverting them. See [13] for more details. 2.2 Two Paddings SYNTAX. A two padding scheme consists of the poly time algorithms PAD and DePAD. The probabilistic algorithm PAD accepts input messages m and produces a pair of outputs, denoted as (w, s) PAD(m) The deterministic algorithm DePAD accepts input pairs of ....

[Article contains additional citation context not shown here]

Yevgeniy Dodis and Leonid Reyzin. On the power of claw-free permutations. In Conference on Security in Communication Networks, 2002. See Appendix A for further details. 17

....also note that the loss of a factor q(k) q hash (where this represents the number of hash queries) in the concrete security reduction above can be improved for schemes based on specific trapdoor permutations. In particular, when the trapdoor permutation is induced by a claw free permutation (see [7] for a definition) and is constructed via the Fiat Shamir transform [8] i.e. the signature corresponds to a proof of knowledge of f (y) we can obtain a security bound losing only a factor O(q exp ) where q exp denotes the number of key exposures. In particular, we can achieve this ....

Y. Dodis and L. Reyzin. On the Power of Claw-Free Permutations. SCN 2002.

No context found.

Y. Dodis and L. Reyzin. On the power of claw-free permutation. In Security in Communication Networks, 2002.

No context found.

Y. Dodis and L. Reyzin. On the power of claw-free permutation. In Security in Communication Networks, 2002.

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