{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:18:28Z","timestamp":1725578308277},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642193248"},{"type":"electronic","value":"9783642193255"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19325-5_9","type":"book-chapter","created":{"date-parts":[[2011,2,23]],"date-time":"2011-02-23T10:43:31Z","timestamp":1298457811000},"page":"81-93","source":"Crossref","is-referenced-by-count":0,"title":["Practical Consequences of the Aberration of Narrow-Pipe Hash Designs from Ideal Random Functions"],"prefix":"10.1007","author":[{"given":"Danilo","family":"Gligoroski","sequence":"first","affiliation":[]},{"given":"Vlastimil","family":"Klima","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: CCS 1993: Proceedings of the 1st ACM conference on Computer and Communications Security, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. In: 30th STOC, pp. 209\u2013218 (1998)","DOI":"10.1145\/276698.276741"},{"key":"9_CR3","unstructured":"Gligoroski, D.: Narrow-pipe SHA-3 candidates differ significantly from ideal random functions defined over big domains. NIST hash-forum mailing list (May 7, 2010)"},{"key":"9_CR4","unstructured":"National Institute of Standards and Technology: Announcing Request for Candidate Algorithm Nominations for a New Cryptographic Hash Algorithm (SHA-3) Family. Federal Register 27(212), 62212\u201362220 (November 2007), \n                    \n                      http:\/\/csrc.nist.gov\/groups\/ST\/hash\/documents\/FR_Notice_Nov07.pdf\n                    \n                    \n                   (2009\/04\/10)"},{"key":"9_CR5","unstructured":"Aumasson, J.-P., Henzen, L., Meier, W., Phan, R. C.-W.: SHA-3 proposal BLAKE, Submission to NIST (Round 2), \n                    \n                      http:\/\/csrc.nist.gov\/groups\/ST\/hash\/sha-3\/Round2\/documents\/BLAKE_Round2.zip\n                    \n                    \n                   (2010\/05\/03)"},{"key":"9_CR6","unstructured":"K\u00fcc\u00fck, \u00d6.: The Hash Function Hamsi, Submission to NIST (Round 2), \n                    \n                      http:\/\/csrc.nist.gov\/groups\/ST\/hash\/sha-3\/Round2\/documents\/Hamsi_Round2.zip\n                    \n                    \n                   (2010\/05\/03)"},{"key":"9_CR7","unstructured":"Biham, E., and Dunkelman, O.: The SHAvite-3 Hash Function, Submission to NIST (Round 2), \n                    \n                      http:\/\/csrc.nist.gov\/groups\/ST\/hash\/sha-3\/Round2\/documents\/SHAvite-3_Round2.zip\n                    \n                    \n                   (2010\/05\/03)"},{"key":"9_CR8","unstructured":"Ferguson, N., Lucks, S., Schneier, B., Whiting, D., Bellare, M., Kohno, T., Callas, J., and Walker, J.: The Skein Hash Function Family, Submission to NIST (Round 2), \n                    \n                      http:\/\/csrc.nist.gov\/groups\/ST\/hash\/sha-3\/Round2\/documents\/Skein_Round2.zip\n                    \n                    \n                   (2010\/05\/03)"},{"key":"9_CR9","unstructured":"NIST FIPS PUB 180-2: Secure Hash Standard, National Institute of Standards and Technology, U.S. Department of Commerce (August 2002)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Dierks, T., Rescorla, E.: The Transport Layer Security (TLS) Protocol Version 1.2. RFC 5246 (August 2008)","DOI":"10.17487\/rfc5246"},{"key":"9_CR11","unstructured":"RSA Laboratories. PKCS #5 v2.1: Password-Based Cryptography Standard (October 5, 2006)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Krawczyk, H., Bellare, M., Canetti, R.: HMAC: Keyed-Hashing for Message Authentication. RFC 2104 (February 1997)","DOI":"10.17487\/rfc2104"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-46885-4_34","volume-title":"Advances in Cryptology - EUROCRYPT \u201989","author":"P. Flajolet","year":"1990","unstructured":"Flajolet, P., Odlyzko, A.M.: Random mapping statistics. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol.\u00a0434, pp. 329\u2013354. Springer, Heidelberg (1990)"}],"container-title":["Communications in Computer and Information Science","ICT Innovations 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19325-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T08:43:56Z","timestamp":1558428236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19325-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642193248","9783642193255"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19325-5_9","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2011]]}}}