{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:00:57Z","timestamp":1725512457138},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540243274"},{"type":"electronic","value":"9783540305644"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30564-4_23","type":"book-chapter","created":{"date-parts":[[2010,3,8]],"date-time":"2010-03-08T10:39:26Z","timestamp":1268044766000},"page":"326-340","source":"Crossref","is-referenced-by-count":15,"title":["Efficient Constructions of Variable-Input-Length Block Ciphers"],"prefix":"10.1007","author":[{"given":"Sarvar","family":"Patel","sequence":"first","affiliation":[]},{"given":"Zulfikar","family":"Ramzan","sequence":"additional","affiliation":[]},{"given":"Ganapathy S.","family":"Sundaram","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/3-540-48405-1_16","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"J.H. An","year":"1999","unstructured":"An, J.H., Bellare, M.: Constructing VIL-mACs from FIL-mACs: Message authentication under weakened assumptions. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, p. 252. Springer, Heidelberg (1999)"},{"key":"23_CR2","unstructured":"Bellare, M., Desai, A., Jokipii, E., Rogaway, P.: A concrete security treatment of symmetric encryption: Analysis of the DES modes of operation. In: FOCS 1997 (1997)"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/3-540-48658-5_32","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"M. Bellare","year":"1994","unstructured":"Bellare, M., Kilian, J., Rogaway, P.: The security of cipher block chaining. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 341\u2013358. Springer, Heidelberg (1994)"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-48519-8_17","volume-title":"Fast Software Encryption","author":"M. Bellare","year":"1999","unstructured":"Bellare, M., Rogaway, P.: On the construction of variable-input-length ciphers. In: Knudsen, L.R. (ed.) FSE 1999. LNCS, vol.\u00a01636, p. 231. Springer, Heidelberg (1999)"},{"issue":"3","key":"23_CR5","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s001459900051","volume":"12","author":"D.J. Bernstein","year":"1999","unstructured":"Bernstein, D.J.: How to stretch random functions: The security of protected counter sums. J. Cryptology\u00a012(3), 185\u2013192 (1999)","journal-title":"J. Cryptology"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-48405-1_14","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"J. Black","year":"1999","unstructured":"Black, J., Halevi, S., Krawczyk, H., Krovetz, T., Rogaway, P.: UMAC: Fast and secure message authentication. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, p. 216. Springer, Heidelberg (1999)"},{"key":"23_CR7","unstructured":"Bleichenbacher, D., Desai, A.: A construction of a super-pseudorandom cipher. Manuscript (February 1999)"},{"issue":"2","key":"23_CR8","first-page":"143","volume":"18","author":"J.L. Carter","year":"1979","unstructured":"Carter, J.L., Wegman, M.N.: Universal classes of hash functions. JCSS\u00a018(2), 143\u2013154 (1979)","journal-title":"JCSS"},{"key":"23_CR9","unstructured":"Daemen, J., Rijmen, V.: AES proposal Rijndael. NIST AES Proposal, 6\/98"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/0-387-34805-0_39","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"I.B. Damg\u00e5rd","year":"1990","unstructured":"Damg\u00e5rd, I.B.: A design principle for hash functions. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 416\u2013427. Springer, Heidelberg (1990)"},{"issue":"4","key":"23_CR11","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. Journal of the ACM\u00a033(4), 792\u2013807 (1986)","journal-title":"Journal of the ACM"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-540-45146-4_28","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"S. Halevi","year":"2003","unstructured":"Halevi, S., Rogaway, P.: A tweakable enciphering mode. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 482\u2013499. Springer, Heidelberg (2003)"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-540-24660-2_23","volume-title":"Topics in Cryptology \u2013 CT-RSA 2004","author":"S. Halevi","year":"2004","unstructured":"Halevi, S., Rogaway, P.: A parallelizable enciphering mode. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol.\u00a02964, pp. 292\u2013304. Springer, Heidelberg (2004)"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-48658-5_15","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"H. Krawczyk","year":"1994","unstructured":"Krawczyk, H.: LFSR-based hashing and authentication. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 129\u2013139. Springer, Heidelberg (1994)"},{"issue":"2","key":"23_CR15","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 J. Computing\u00a017(2), 373\u2013386 (1988)","journal-title":"SIAM J. Computing"},{"key":"23_CR16","unstructured":"Bellare, M., Canetti, R., Krawczyk, H.: Pseudorandom functions revisited: The cascade construction and its concrete security. In: Proc. FOCS 1996 (1996)"},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/PL00003817","volume":"12","author":"M. Naor","year":"1999","unstructured":"Naor, M., Reingold, O.: On the construction of pseudo-random permutations: Luby-Rackoff revisited. J. of Cryptology\u00a012, 29\u201366 (1999); Previously in STOC 1997","journal-title":"J. of Cryptology"},{"key":"23_CR18","unstructured":"National\u00a0Bureau of\u00a0Standards. FIPS publication 46: Data Encryption Standard, Federal Information Processing Standards Publication 46 (1977)"},{"key":"23_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-48519-8_13","volume-title":"Fast Software Encryption","author":"S. Patel","year":"1999","unstructured":"Patel, S., Ramzan, Z., Sundaram, G.S.: Towards making luby-rackoff ciphers optimal and practical. In: Knudsen, L.R. (ed.) FSE 1999. LNCS, vol.\u00a01636, p. 171. Springer, Heidelberg (1999), \n                    \n                      http:\/\/theory.lcs.mit.edu\/~zulfikar\/MyResearch\/homepage.html"},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/3-540-36492-7_18","volume-title":"Selected Areas in Cryptography","author":"S. Patel","year":"2003","unstructured":"Patel, S., Ramzan, Z., Sundaram, G.: Luby-rackoff ciphers: Why XOR is not so exclusive. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol.\u00a02595, pp. 271\u2013290. Springer, Heidelberg (2003)"},{"key":"23_CR21","unstructured":"Petrank, E., Rackoff, C.: CBC MAC for Real Time Data Sources. Technical Report 97-26, Dimacs (1997)"},{"key":"23_CR22","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF01388651","volume":"4","author":"D.R. Stinson","year":"1994","unstructured":"Stinson, D.R.: Universal Hashing and Authentication Codes. Design, Codes, and Cryptography\u00a04, 369\u2013380 (1994)","journal-title":"Design, Codes, and Cryptography"},{"issue":"3","key":"23_CR23","first-page":"265","volume":"22","author":"M.N. Wegman","year":"1981","unstructured":"Wegman, M.N., Carter, J.L.: New hash functions and their use in authentication and set equality. JCSS\u00a022(3), 265\u2013279 (1981)","journal-title":"JCSS"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30564-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:31:50Z","timestamp":1558272710000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30564-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540243274","9783540305644"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30564-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}