We propose a new type of claw free function family, a pseudo self-denable claw free function fami... more We propose a new type of claw free function family, a pseudo self-denable claw free function family, which provides, by Damg ard's construction, a collision intractable hash function family that is more suitable in several cryptographic applications such as digital signature, bit commitment, etc. We give an example of self-denable claw free function families based on the hardness of some number theoretic problem. We also show some concrete situation where our claw free notion is indeed necessary.
In this paper we separate many-one reducibility from truth-table reducibility for distributional ... more In this paper we separate many-one reducibility from truth-table reducibility for distributional problems in DistN P under the hypothesis that P = N P. As a first example we consider the 3-Satisfiability problem (3SAT) with two different distributions on 3CNF formulas. We show that 3SAT using a version of the standard distribution is truth-table reducible but not many-one reducible to 3SAT using a less redundant distribution unless P = N P.
We propose a new type of claw free function family, a pseudo self-denable claw free function fami... more We propose a new type of claw free function family, a pseudo self-denable claw free function family, which provides, by Damg ard's construction, a collision intractable hash function family that is more suitable in several cryptographic applications such as digital signature, bit commitment, etc. We give an example of self-denable claw free function families based on the hardness of some number theoretic problem. We also show some concrete situation where our claw free notion is indeed necessary.
In this paper we separate many-one reducibility from truth-table reducibility for distributional ... more In this paper we separate many-one reducibility from truth-table reducibility for distributional problems in DistN P under the hypothesis that P = N P. As a first example we consider the 3-Satisfiability problem (3SAT) with two different distributions on 3CNF formulas. We show that 3SAT using a version of the standard distribution is truth-table reducible but not many-one reducible to 3SAT using a less redundant distribution unless P = N P.
Uploads
Papers by Osamu Watanabe