On basing one-way functions on NP-hardness

14 years 4 months ago

Download people.csail.mit.edu

We consider the possibility of basing one-way functions on NP-Hardness; that is, we study possible reductions from a worst-case decision problem to the task of average-case inverting a polynomial-time computable function f. Our main findings are the following two negative results:

Adi Akavia, Oded Goldreich, Shafi Goldwasser, Dana

Real-time Traffic

Algorithms | One-way Functions | Polynomial-time Computable Function | STOC 2006 | Worst-case Decision Problem |

claim paper

» VLSI Architecture of a Cellular Automata based OneWay Function

» Candidate OneWay Functions Based on Expander Graphs

» Limits on the Efficiency of OneWay PermutationBased Hash Functions

» RoundOptimal ZeroKnowledge Arguments Based on any OneWay Function

» ConstantRound Nonmalleable Commitments from Subexponential OneWay Functions

» New Combinatorial Complete OneWay Functions

» VMPC OneWay Function and Stream Cipher

» OneWay Functions and the BermanHartmanis Conjecture

» On the Construction of OneWay Functions from Average Case Hardness

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2006
Where	STOC
Authors	Adi Akavia, Oded Goldreich, Shafi Goldwasser, Dana Moshkovitz

Comments (0)

Sciweavers

On basing one-way functions on NP-hardness

Algorithms | One-way Functions | Polynomial-time Computable Function | STOC 2006 | Worst-case Decision Problem |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers