468 search results - page 1 / 94 » One-Way Functions in Complexity Theory |
72
Voted
MFCS
1990
Springer
15 years 2 months ago
1990
Springer
We introduce the notion of associative one-way functions and prove that they exist if and only if P 6= NP. As evidence of their utility, we present two novel protocols that apply ...
FOCS
1999
IEEE
15 years 3 months ago
1999
IEEE
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
CRYPTO
2008
Springer
15 years 16 days ago
2008
Springer
Abstract. We introduce new and general complexity theoretic hardumptions. These assumptions abstract out concrete properties of a random oracle and are significantly stronger than ...
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...