{"intvolume":"      4515","publisher":"Springer","title":"Non-trivial black-box combiners for collision-resistant hash-functions don't exist","doi":"10.1007/978-3-540-72540-4_2","author":[{"full_name":"Krzysztof Pietrzak","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","orcid":"0000-0002-9139-1654"}],"publication_status":"published","day":"12","date_updated":"2021-01-12T07:41:52Z","_id":"3218","abstract":[{"text":"A (k, ℓ)-robust combiner for collision-resistant hash-functions is a construction which from ℓ hash-functions constructs a hash-function which is collision-resistant if at least k of the components are collision-resistant. One trivially gets a (k, ℓ)-robust combiner by concatenating the output of any ℓ - k + 1 of the components, unfortunately this is not very practical as the length of the output of the combiner is quite large. We show that this is unavoidable as no black-box (k, ℓ)-robust combiner whose output is significantly shorter than what can be achieved by concatenation exists. This answers a question of Boneh and Boyen (Crypto'06). ","lang":"eng"}],"extern":1,"quality_controlled":0,"conference":{"name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques"},"date_created":"2018-12-11T12:02:05Z","date_published":"2007-06-12T00:00:00Z","volume":4515,"acknowledgement":"Supported by DIAMANT, the Dutch national mathematics cluster for discrete interactive and algorithmic algebra and number theory.","alternative_title":["LNCS"],"year":"2007","page":"23 - 33","citation":{"mla":"Pietrzak, Krzysztof Z. <i>Non-Trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don’t Exist</i>. Vol. 4515, Springer, 2007, pp. 23–33, doi:<a href=\"https://doi.org/10.1007/978-3-540-72540-4_2\">10.1007/978-3-540-72540-4_2</a>.","ieee":"K. Z. Pietrzak, “Non-trivial black-box combiners for collision-resistant hash-functions don’t exist,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, 2007, vol. 4515, pp. 23–33.","ama":"Pietrzak KZ. Non-trivial black-box combiners for collision-resistant hash-functions don’t exist. In: Vol 4515. Springer; 2007:23-33. doi:<a href=\"https://doi.org/10.1007/978-3-540-72540-4_2\">10.1007/978-3-540-72540-4_2</a>","ista":"Pietrzak KZ. 2007. Non-trivial black-box combiners for collision-resistant hash-functions don’t exist. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 4515, 23–33.","apa":"Pietrzak, K. Z. (2007). Non-trivial black-box combiners for collision-resistant hash-functions don’t exist (Vol. 4515, pp. 23–33). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Springer. <a href=\"https://doi.org/10.1007/978-3-540-72540-4_2\">https://doi.org/10.1007/978-3-540-72540-4_2</a>","chicago":"Pietrzak, Krzysztof Z. “Non-Trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don’t Exist,” 4515:23–33. Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-72540-4_2\">https://doi.org/10.1007/978-3-540-72540-4_2</a>.","short":"K.Z. Pietrzak, in:, Springer, 2007, pp. 23–33."},"status":"public","publist_id":"3461","type":"conference","month":"06"}