35 search results - page 1 / 7 » On the Security of Goldreich's One-Way Function |
APPROX
2009
Springer
13 years 11 months ago
2009
Springer
Goldreich (ECCC 2000) suggested a simple construction of a candidate one-way function f : {0, 1}n → {0, 1}m where each bit of output is a fixed predicate P of a constant number ...
TCC
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
STOC
1989
ACM
13 years 8 months ago
1989
ACM
ECCC
2000
13 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...
EUROCRYPT
2010
Springer
13 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...