Low-complexity cryptographic hash functions

Benny Applebaum, Naama Haramaty-Krasne, Yuval Ishai, Eyal Kushilevitz, Vinod Vaikuntanathan

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

תקציר

Cryptographic hash functions are efficiently computable functions that shrink a long input into a shorter output while achieving some of the useful security properties of a random function. The most common type of such hash functions is collision resistant hash functions (CRH), which prevent an efficient attacker from finding a pair of inputs on which the function has the same output. Despite the ubiquitous role of hash functions in cryptography, several of the most basic questions regarding their computational and algebraic complexity remained open. In this work we settle most of these questions under new, but arguably quite conservative, cryptographic assumptions, whose study may be of independent interest. Concretely, we obtain the following results: Low-complexity CRH. Assuming the intractability of finding short codewords in natural families of linear error-correcting codes, there are CRH that shrink the input by a constant factor and have a constant algebraic degree over Z2 (as low as 3), or even constant output locality and input locality. Alternatively, CRH with an arbitrary polynomial shrinkage can be computed by linear-size circuits. Win-win results. If low-degree CRH with good shrinkage do not exist, this has useful consequences for learning algorithms and data structures. Degree-2 hash functions. Assuming the conjectured intractability of solving a random system of quadratic equations over ℤ2, a uniformly random degree-2 mapping is a universal one-way hash function (UOWHF). UOWHF relaxes CRH by forcing the attacker to find a collision with a random input picked by a challenger. On the other hand, a uniformly random degree-2 mapping is not a CRH. We leave the existence of degree-2 CRH open, and relate it to open questions on the existence of degree-2 randomized encodings of functions.

שפה מקוריתאנגלית
כותר פרסום המארח8th Innovations in Theoretical Computer Science Conference, ITCS 2017
עורכיםChristos H. Papadimitriou
מסת"ב (אלקטרוני)9783959770293
מזהי עצם דיגיטלי (DOIs)
סטטוס פרסוםפורסם - 1 נוב׳ 2017
אירוע8th Innovations in Theoretical Computer Science Conference, ITCS 2017 - Berkeley, ארצות הברית
משך הזמן: 9 ינו׳ 201711 ינו׳ 2017

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

שםLeibniz International Proceedings in Informatics, LIPIcs
כרך67

כנס

כנס8th Innovations in Theoretical Computer Science Conference, ITCS 2017
מדינה/אזורארצות הברית
עירBerkeley
תקופה9/01/1711/01/17

ASJC Scopus subject areas

  • ???subjectarea.asjc.1700.1712???

טביעת אצבע

להלן מוצגים תחומי המחקר של הפרסום 'Low-complexity cryptographic hash functions'. יחד הם יוצרים טביעת אצבע ייחודית.

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