{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:12:27Z","timestamp":1725516747839},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705826"},{"type":"electronic","value":"9783540705833"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70583-3_53","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"655-666","source":"Crossref","is-referenced-by-count":11,"title":["Robust Multi-property Combiners for Hash Functions Revisited"],"prefix":"10.1007","author":[{"given":"Marc","family":"Fischlin","sequence":"first","affiliation":[]},{"given":"Anja","family":"Lehmann","sequence":"additional","affiliation":[]},{"given":"Krzysztof","family":"Pietrzak","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"53_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11761679_25","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"M. Bellare","year":"2006","unstructured":"Bellare, M., Rogaway, P.: The security of triple encryption and a framework for code-based game-playing proofs. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 409\u2013426. Springer, Heidelberg (2006)"},{"key":"53_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/11818175_34","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"D. Boneh","year":"2006","unstructured":"Boneh, D., Boyen, X.: On the impossibility of efficiently combining collision resistant hash functions. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 570\u2013583. Springer, Heidelberg (2006)"},{"key":"53_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/978-3-540-78524-8_21","volume-title":"TCC 2008","author":"M. Fischlin","year":"2008","unstructured":"Fischlin, M., Lehmann, A.: Multi-property preserving combiners for hash functions. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 375\u2013392. Springer, Heidelberg (2008)"},{"key":"53_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/978-3-540-30574-3_13","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"A. Herzberg","year":"2005","unstructured":"Herzberg, A.: On tolerant cryptographic constructions. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol.\u00a03376, pp. 172\u2013190. Springer, Heidelberg (2005)"},{"issue":"2","key":"53_CR5","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M. Luby","year":"1988","unstructured":"Luby, M., Rackoff, C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal on Computing\u00a017(2), 373\u2013386 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"53_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/978-3-540-24638-1_2","volume-title":"Theory of Cryptography","author":"U. Maurer","year":"2004","unstructured":"Maurer, U., Renner, R., Holenstein, C.: Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 21\u201339. Springer, Heidelberg (2004)"},{"key":"53_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"K. Pietrzak","year":"2007","unstructured":"Pietrzak, K.: Non-trivial black-box combiners for collision-resistant hash-functions don\u2019t exist. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70583-3_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:23:38Z","timestamp":1620001418000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70583-3_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705826","9783540705833"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70583-3_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}