On constructing 1-1 one-way functions

Oded Goldreich; Leonid A. Levin; Noam Nisan

doi:https://doi.org/10.1007/978-3-642-22670-0_3

On constructing 1-1 one-way functions

Oded Goldreich, Leonid A. Levin, Noam Nisan

Weizmann Institute of Science, The Hebrew University of Jerusalem

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

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
Chapter	3
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

Keywords

Discrete Logarithm Problem
One-Way Functions
RSA

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

https://doi.org/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{a6106d8b82ff46bfb944207278d20ebf,

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",

note = "We would like to thank Eric Bach and Hugo Krawczyk for helpful discussions and comments.",

year = "2011",

doi = "https://doi.org/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

N1 - We would like to thank Eric Bach and Hugo Krawczyk for helpful discussions and comments.

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 - https://doi.org/10.1007/978-3-642-22670-0_3

DO - https://doi.org/10.1007/978-3-642-22670-0_3

M3 - فصل

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: https://doi.org/10.1007/978-3-642-22670-0_3

On constructing 1-1 one-way functions

Abstract

Publication series

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this