On constructing 1-1 one-way functions

Oded Goldreich; Leonid A. Levin; Noam Nisan

doi:10.1007/978-3-642-22670-0_3

On constructing 1-1 one-way functions

Oded Goldreich^*, Leonid A. Levin, Noam Nisan

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

8 Scopus citations

Abstract

We show how to construct length-preserving 1-1 one-way functions based on popular intractability assumptions (e.g., RSA, DLP). Such 1-1 functions should not be confused with (infinite) families of (finite) one-way permutations. What we want and obtain is a single (infinite) 1-1 one-way function.

Original language	English
Title of host publication	Studies in Complexity and Cryptography
Subtitle of host publication	Miscellanea on the Interplay between Randomness and Computation
Editors	Oded Goldreich
Pages	13-25
Number of pages	13
DOIs	https://doi.org/10.1007/978-3-642-22670-0_3
State	Published - 2011

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6650 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Keywords

Discrete Logarithm Problem
One-Way Functions
RSA

Access to Document

10.1007/978-3-642-22670-0_3

Cite this

Goldreich, O., Levin, L. A., & Nisan, N. (2011). On constructing 1-1 one-way functions. In O. Goldreich (Ed.), Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation (pp. 13-25). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6650 LNCS). https://doi.org/10.1007/978-3-642-22670-0_3

Goldreich, Oded ; Levin, Leonid A. ; Nisan, Noam. / On constructing 1-1 one-way functions. Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation. editor / Oded Goldreich. 2011. pp. 13-25 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{5725a6be280e4c3c9971ba7f304be9b9,

title = "On constructing 1-1 one-way functions",

abstract = "We show how to construct length-preserving 1-1 one-way functions based on popular intractability assumptions (e.g., RSA, DLP). Such 1-1 functions should not be confused with (infinite) families of (finite) one-way permutations. What we want and obtain is a single (infinite) 1-1 one-way function.",

keywords = "Discrete Logarithm Problem, One-Way Functions, RSA",

author = "Oded Goldreich and Levin, {Leonid A.} and Noam Nisan",

year = "2011",

doi = "10.1007/978-3-642-22670-0_3",

language = "אנגלית",

isbn = "9783642226694",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "13--25",

editor = "Oded Goldreich",

booktitle = "Studies in Complexity and Cryptography",

}

Goldreich, O, Levin, LA & Nisan, N 2011, On constructing 1-1 one-way functions. in O Goldreich (ed.), Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6650 LNCS, pp. 13-25. https://doi.org/10.1007/978-3-642-22670-0_3

On constructing 1-1 one-way functions. / Goldreich, Oded; Levin, Leonid A.; Nisan, Noam.
Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation. ed. / Oded Goldreich. 2011. p. 13-25 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6650 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - On constructing 1-1 one-way functions

AU - Goldreich, Oded

AU - Levin, Leonid A.

AU - Nisan, Noam

PY - 2011

Y1 - 2011

N2 - We show how to construct length-preserving 1-1 one-way functions based on popular intractability assumptions (e.g., RSA, DLP). Such 1-1 functions should not be confused with (infinite) families of (finite) one-way permutations. What we want and obtain is a single (infinite) 1-1 one-way function.

AB - We show how to construct length-preserving 1-1 one-way functions based on popular intractability assumptions (e.g., RSA, DLP). Such 1-1 functions should not be confused with (infinite) families of (finite) one-way permutations. What we want and obtain is a single (infinite) 1-1 one-way function.

KW - Discrete Logarithm Problem

KW - One-Way Functions

KW - RSA

UR - http://www.scopus.com/inward/record.url?scp=84857619440&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-22670-0_3

DO - 10.1007/978-3-642-22670-0_3

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???

AN - SCOPUS:84857619440

SN - 9783642226694

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 13

EP - 25

BT - Studies in Complexity and Cryptography

A2 - Goldreich, Oded

ER -

Goldreich O, Levin LA, Nisan N. On constructing 1-1 one-way functions. In Goldreich O, editor, Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation. 2011. p. 13-25. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-22670-0_3

On constructing 1-1 one-way functions

Abstract

Publication series

Keywords

Access to Document

Other files and links

Fingerprint

Cite this