From non-adaptive to adaptive pseudorandom functions

Itay Berman; Iftach Haitner

doi:10.1007/978-3-642-28914-9_20

From non-adaptive to adaptive pseudorandom functions

Itay Berman^*, Iftach Haitner

^*Corresponding author for this work

School of Computer Science

Tel Aviv University

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

11 Scopus citations

Abstract

Unlike the standard notion of pseudorandom functions (PRF), a non-adaptive PRF is only required to be indistinguishable from random in the eyes of a non-adaptive distinguisher (i.e., one that prepares its oracle calls in advance). A recent line of research has studied the possibility of a direct construction of adaptive PRFs from non-adaptive ones, where direct means that the constructed adaptive PRF uses only few (ideally, constant number of) calls to the underlying non-adaptive PRF. Unfortunately, this study has only yielded negative results, showing that "natural" such constructions are unlikely to exist (e.g., Myers [EUROCRYPT '04], Pietrzak [CRYPTO '05, EUROCRYPT '06]).. We give an affirmative answer to the above question, presenting a direct construction of adaptive PRFs from non-adaptive ones. Our construction is extremely simple, a composition of the non-adaptive PRF with an appropriate pairwise independent hash function.

Original language	English
Title of host publication	Theory of Cryptography - 9th Theory of Cryptography Conference, TCC 2012, Proceedings
Pages	357-368
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-642-28914-9_20
State	Published - 2012
Event	9th Theory of Cryptography Conference, TCC 2012 - Taormina, Sicily, Italy Duration: 19 Mar 2012 → 21 Mar 2012

Publication series

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

Conference

Conference	9th Theory of Cryptography Conference, TCC 2012
Country/Territory	Italy
City	Taormina, Sicily
Period	19/03/12 → 21/03/12

Access to Document

10.1007/978-3-642-28914-9_20

Cite this

Berman, I., & Haitner, I. (2012). From non-adaptive to adaptive pseudorandom functions. In Theory of Cryptography - 9th Theory of Cryptography Conference, TCC 2012, Proceedings (pp. 357-368). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7194 LNCS). https://doi.org/10.1007/978-3-642-28914-9_20

@inproceedings{879512843136410a8884aae141dc17ce,

title = "From non-adaptive to adaptive pseudorandom functions",

abstract = "Unlike the standard notion of pseudorandom functions (PRF), a non-adaptive PRF is only required to be indistinguishable from random in the eyes of a non-adaptive distinguisher (i.e., one that prepares its oracle calls in advance). A recent line of research has studied the possibility of a direct construction of adaptive PRFs from non-adaptive ones, where direct means that the constructed adaptive PRF uses only few (ideally, constant number of) calls to the underlying non-adaptive PRF. Unfortunately, this study has only yielded negative results, showing that {"}natural{"} such constructions are unlikely to exist (e.g., Myers [EUROCRYPT '04], Pietrzak [CRYPTO '05, EUROCRYPT '06]).. We give an affirmative answer to the above question, presenting a direct construction of adaptive PRFs from non-adaptive ones. Our construction is extremely simple, a composition of the non-adaptive PRF with an appropriate pairwise independent hash function.",

author = "Itay Berman and Iftach Haitner",

year = "2012",

doi = "10.1007/978-3-642-28914-9_20",

language = "אנגלית",

isbn = "9783642289132",

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

pages = "357--368",

booktitle = "Theory of Cryptography - 9th Theory of Cryptography Conference, TCC 2012, Proceedings",

note = "9th Theory of Cryptography Conference, TCC 2012 ; Conference date: 19-03-2012 Through 21-03-2012",

}

Berman, I & Haitner, I 2012, From non-adaptive to adaptive pseudorandom functions. in Theory of Cryptography - 9th Theory of Cryptography Conference, TCC 2012, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7194 LNCS, pp. 357-368, 9th Theory of Cryptography Conference, TCC 2012, Taormina, Sicily, Italy, 19/03/12. https://doi.org/10.1007/978-3-642-28914-9_20

From non-adaptive to adaptive pseudorandom functions. / Berman, Itay; Haitner, Iftach.
Theory of Cryptography - 9th Theory of Cryptography Conference, TCC 2012, Proceedings. 2012. p. 357-368 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7194 LNCS).

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

TY - GEN

T1 - From non-adaptive to adaptive pseudorandom functions

AU - Berman, Itay

AU - Haitner, Iftach

PY - 2012

Y1 - 2012

N2 - Unlike the standard notion of pseudorandom functions (PRF), a non-adaptive PRF is only required to be indistinguishable from random in the eyes of a non-adaptive distinguisher (i.e., one that prepares its oracle calls in advance). A recent line of research has studied the possibility of a direct construction of adaptive PRFs from non-adaptive ones, where direct means that the constructed adaptive PRF uses only few (ideally, constant number of) calls to the underlying non-adaptive PRF. Unfortunately, this study has only yielded negative results, showing that "natural" such constructions are unlikely to exist (e.g., Myers [EUROCRYPT '04], Pietrzak [CRYPTO '05, EUROCRYPT '06]).. We give an affirmative answer to the above question, presenting a direct construction of adaptive PRFs from non-adaptive ones. Our construction is extremely simple, a composition of the non-adaptive PRF with an appropriate pairwise independent hash function.

AB - Unlike the standard notion of pseudorandom functions (PRF), a non-adaptive PRF is only required to be indistinguishable from random in the eyes of a non-adaptive distinguisher (i.e., one that prepares its oracle calls in advance). A recent line of research has studied the possibility of a direct construction of adaptive PRFs from non-adaptive ones, where direct means that the constructed adaptive PRF uses only few (ideally, constant number of) calls to the underlying non-adaptive PRF. Unfortunately, this study has only yielded negative results, showing that "natural" such constructions are unlikely to exist (e.g., Myers [EUROCRYPT '04], Pietrzak [CRYPTO '05, EUROCRYPT '06]).. We give an affirmative answer to the above question, presenting a direct construction of adaptive PRFs from non-adaptive ones. Our construction is extremely simple, a composition of the non-adaptive PRF with an appropriate pairwise independent hash function.

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

U2 - 10.1007/978-3-642-28914-9_20

DO - 10.1007/978-3-642-28914-9_20

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84858321291

SN - 9783642289132

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

SP - 357

EP - 368

BT - Theory of Cryptography - 9th Theory of Cryptography Conference, TCC 2012, Proceedings

T2 - 9th Theory of Cryptography Conference, TCC 2012

Y2 - 19 March 2012 through 21 March 2012

ER -

From non-adaptive to adaptive pseudorandom functions

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this