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)

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

- Dima Grigoriev, Vladimir Shpilrain
- IACR Cryptology ePrint Archive
- 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

- Bartosz Zoltak
- FSE
- 2004

A simple one-way function along with its proposed application in symmetric cryptography is described. The function is computableâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Alan T. Sherman, David A. McGrew
- IEEE Trans. Software Eng.
- 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

- Leonid A. Levin
- Probl. Inf. Transm.
- 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

- Dennis M. Volpano
- CSFW
- 2000

Conditions are given under which a one-way function can be used safely in a programming language. The security proof involvesâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Johan HÃ¥stad, Russell Impagliazzo, Leonid A. Levin, Michael Luby
- SIAM J. Comput.
- 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

- John Rompel
- STOC
- 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

- Russell Impagliazzo, Michael Luby
- FOCS
- 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

- Russell Impagliazzo, Leonid A. Levin, Michael Luby
- STOC
- 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

- Leonid A. Levin
- STOC
- 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?