The advantage of truncated permutations

Shoni Gilboa, Shay Gueron

פרסום מחקרי: פרק בספר / בדוח / בכנספרסום בספר כנסביקורת עמיתים


Constructing a Pseudo Random Function (PRF) from a pseudorandom permutation is a fundamental problem in cryptology. Such a construction, implemented by truncating the last m bits of permutations of (formula presented) was suggested by Hall et al. (1998). They conjectured that the distinguishing advantage of an adversary with q quesires, (formula presented), is small if (formula presented), established an upper bound on (formula presented) that confirms the conjecture for (formula presented), and also declared a general lower bound (formula presented). The conjecture was essentially confirmed by Bellare and Impagliazzo in 1999. Nevertheless, the problem of estimating (formula presented) remained open. Combining the trivial bound 1, the birthday bound, and a result by Stam (1978) leads to the following upper bound: (formula presented) This upper bound shows that the number of times that a truncated permutation can be used as a PRF can exceed the birthday bound by at least a factor of (formula presented). In this paper we show that this upper bound is tight for every (formula presented) and (formula presented). This, in turn, verifies that the converse to the conjecture of Hall et al. is also correct, i.e., that (formula presented) is negligible only for (formula presented).

שפה מקוריתאנגלית
כותר פרסום המארחCyber Security Cryptography and Machine Learning - 3rd International Symposium, CSCML 2019, Proceedings
עורכיםShlomi Dolev, Danny Hendler, Sachin Lodha, Moti Yung
מוציא לאורSpringer Verlag
מספר עמודים10
מסת"ב (מודפס)9783030209506
מזהי עצם דיגיטלי (DOIs)
סטטוס פרסוםפורסם - 2019
אירוע3rd International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2019 - Beer Sheva, ישראל
משך הזמן: 27 יוני 201928 יוני 2019

סדרות פרסומים

שםLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
כרך11527 LNCS
ISSN (מודפס)0302-9743
ISSN (אלקטרוני)1611-3349


כנס3rd International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2019
עירBeer Sheva

הערה ביבליוגרפית

Publisher Copyright:
© Springer Nature Switzerland AG 2019.

טביעת אצבע

להלן מוצגים תחומי המחקר של הפרסום 'The advantage of truncated permutations'. יחד הם יוצרים טביעת אצבע ייחודית.

פורמט ציטוט ביבליוגרפי