7 search results - page 1 / 2 » An infinitely-often one-way function based on an average-cas... |
152
click to vote
ICS
2010
Tsinghua U.
16 years 2 months ago
2010
Tsinghua U.
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
163
Voted
COCOON
2008
Springer
15 years 6 months ago
2008
Springer
Consider a trader who exchanges one dollar into yen and assume that the exchange rate fluctuates within the interval [m, M]. The game ends without advance notice, then the trader ...
142
Voted
COCO
2009
Springer
15 years 11 months ago
2009
Springer
—The Berman-Hartmanis conjecture states that all NP-complete sets are P-isomorphic each other. On this conjecture, we first improve the result of [3] and show that all NP-comple...
148
click to vote
EUROCRYPT
2010
Springer
15 years 9 months ago
2010
Springer
We present a constant-round non-malleable commitment scheme based on the existence of sub-exponential one-way functions and using a blackbox proof of security. As far as we know, t...
137
Voted
ECCC
2000
15 years 4 months ago
2000
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...