{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:53:11Z","timestamp":1764996791404},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327318"},{"type":"electronic","value":"9783540327325"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11681878_29","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T07:41:35Z","timestamp":1141112495000},"page":"561-580","source":"Crossref","is-referenced-by-count":9,"title":["PRF Domain Extension Using DAGs"],"prefix":"10.1007","author":[{"given":"Charanjit S.","family":"Jutla","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","unstructured":"ANSI X3.106, American National Standard for Information Systems - Data Encryption Algorithm - Modes of Operation. American National Standards Institute (1983)"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Canetti, R., Krawczyk, H.: Pseudorandom Functions Revisited: The Cascade Construction and its Concrete Security. In: Proc. IEEE FOCS (1996)","DOI":"10.1109\/SFCS.1996.548510"},{"issue":"3","key":"29_CR3","first-page":"362","volume":"61","author":"M. Bellare","year":"2000","unstructured":"Bellare, M., Kilian, J., Rogaway, P.: The Security of Cipher Block Chaining. JCSS\u00a061(3), 362\u2013399 (2000)","journal-title":"JCSS"},{"key":"29_CR4","unstructured":"Bellare, M., Desai, A., Jokiph, E., Rogaway, P.: A Concrete Security Treatment of Symmetric Encryption: Analysis of the DES Modes of OPeration. In: 38th IEEE FOCS (1997)"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Bernstein, D.: How to Stretch Random Functions: The security of Protected Counter Sums. J. of Cryptology\u00a012(3) (1999)","DOI":"10.1007\/s001459900051"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/3-540-46035-7_25","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"J. Black","year":"2002","unstructured":"Black, J., Rogaway, P.: A Block Cipher Mode of Operation for Parallelizable Message Authentication. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, p. 384. Springer, Heidelberg (2002)"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-44598-6_12","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"J. Black","year":"2000","unstructured":"Black, J., Rogaway, P.: CBC MACs for arbitrary length messages: The three key constructions. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, p. 197. Springer, Heidelberg (2000)"},{"key":"29_CR8","first-page":"143","volume":"18","author":"J. Carter","year":"1979","unstructured":"Carter, J., Wegman, M.: Universal Classes of Hash Functions. JCSS\u00a018, 143\u2013154 (1979)","journal-title":"JCSS"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM\u00a033(4) (1986)","DOI":"10.1145\/6490.6503"},{"key":"29_CR10","unstructured":"National Bureau of Standards, Data Encryption Standard, U.S. Department of Commerce, FIPS 46 (1977)"},{"key":"29_CR11","unstructured":"Gligor, V.D., Donescu, P.: Fast Encryption Authentication: XCBC Encryption and XECB Authentication Modes, http:\/\/csrc.nist.gov\/encryption\/modes\/workshop1"},{"key":"29_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":"29_CR13","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Harary, F.: Graph Theory. Addison-Wesley, Reading (1969)"},{"key":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-540-39887-5_11","volume-title":"Fast Software Encryption","author":"T. Iwata","year":"2003","unstructured":"Iwata, T., Kurosawa, K.: OMAC: One -key CBC-MAC. In: Johansson, T. (ed.) FSE 2003. LNCS, vol.\u00a02887, pp. 129\u2013153. Springer, Heidelberg (2003)"},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/BFb0055728","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"C.S. Jutla","year":"1998","unstructured":"Jutla, C.S.: Generalized Birthday Attacks on Unbalanced Feistel Networks. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, p. 186. Springer, Heidelberg (1998)"},{"key":"29_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/3-540-44987-6_32","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"C.S. Jutla","year":"2001","unstructured":"Jutla, C.S.: Encryption Modes with Almost Free Message Integrity. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, p. 529. Springer, Heidelberg (2001)"},{"key":"29_CR17","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)"},{"key":"29_CR18","series-title":"Annals of Mathematical Studies","volume-title":"Contributions to the Theory of Games II","author":"H.W. Kuhn","year":"1950","unstructured":"Kuhn, H.W.: Extensive games and the problem of information. In: Kuhn, H.W., Tucker, A.W. (eds.) Contributions to the Theory of Games II. Annals of Mathematical Studies, vol.\u00a028. Princeton Univ. Press, Princeton (1950)"},{"key":"29_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-45708-9_3","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"M. Liskov","year":"2002","unstructured":"Liskov, M., Rivest, R., Wagner, D.: Tweakable Block Ciphers. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, p. 31. Springer, Heidelberg (2002)"},{"key":"29_CR20","series-title":"Princeton Computer Science Notes","doi-asserted-by":"crossref","DOI":"10.1515\/9780691206844","volume-title":"Pseudorandomness and Cryptographic Applications","author":"M. Luby","year":"1996","unstructured":"Luby, M.: Pseudorandomness and Cryptographic Applications. Princeton Computer Science Notes. Princeton Univ. Press, Princeton (1996)"},{"key":"29_CR21","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. on Computing\u00a017, 373\u2013386 (1988)","journal-title":"SIAM J. on Computing"},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"Naor, M., Reingold, O.: On the construction of pseudo-random permutations: Luby-Rackoff revisited. In: Proc. 29th ACM STOC, pp. 189\u2013199 (1997)","DOI":"10.1145\/258533.258581"},{"key":"29_CR23","doi-asserted-by":"crossref","unstructured":"Petrank, E., Rackoff, C.: CBC-MAC for real-time data sources. J. of Cryptology\u00a013(3) (November 2000)","DOI":"10.1007\/s001450010009"},{"key":"29_CR24","volume-title":"Proc. 8th ACM Conf. Comp. and Comm. Security (CCS)","author":"P. Rogaway","year":"2001","unstructured":"Rogaway, P., Bellare, M., Black, J., Krovetz, T.: OCB: A block-cipher mode of operation for efficient authenticated encryption. In: Proc. 8th ACM Conf. Comp. and Comm. Security (CCS). ACM, New York (2001)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11681878_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:05:29Z","timestamp":1605643529000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11681878_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327318","9783540327325"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11681878_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}