One-way function

Known as: One-way permutation, Collision-free hash function, One-way functions 
In computer science, a one-way function is a function that is easy to compute on every input, but hard to invert given the image of a random input… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1976-2017
010203019762017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
We show that some problems in information security can be solved without using one-way functions. The latter are usually regarded… (More)
Is this relevant?
2004
2004
A simple one-way function along with its proposed application in symmetric cryptography is described. The function is computable… (More)
  • table 1
  • table 2
  • table 3
  • table 9
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We present and analyze a new algorithm for establishing shared cryptographic keys in large, dynamically changing groups. Our… (More)
Is this relevant?
2003
2003
The existence of one-way functions (owf) is arguably the most important problem in computer theory. The article discusses and… (More)
Is this relevant?
2000
2000
Conditions are given under which a one-way function can be used safely in a programming language. The security proof involves… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show how to construct a… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Much research in theoretical cryptography has been centered around finding the weakest possible cryptographic assumptions… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
In much of modern cryptography, for many cryptographic tasks, the security of protocols that have been designed is based on the… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
We show that the existence of one-way functions is necessary and sufficient for the existence of pseudo-random generators in the… (More)
Is this relevant?
Highly Cited
1985
Highly Cited
1985
One-way are those functions which are easy to compute, but hard to invert on a non-negligible fraction of instances. The… (More)
Is this relevant?