{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:56:33Z","timestamp":1771700193127,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540241300","type":"print"},{"value":"9783540305569","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30556-9_25","type":"book-chapter","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T16:18:36Z","timestamp":1267460316000},"page":"315-327","source":"Crossref","is-referenced-by-count":59,"title":["EME*: Extending EME to Handle Arbitrary-Length Messages with Associated Data"],"prefix":"10.1007","author":[{"given":"Shai","family":"Halevi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","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, pp. 197\u2013215. Springer, Heidelberg (2000)"},{"key":"25_CR2","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, pp. 384\u2013397. Springer, Heidelberg (2002)"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-45760-7_9","volume-title":"Topics in Cryptology - CT-RSA 2002","author":"J. Black","year":"2002","unstructured":"Black, J., Rogaway, P.: Ciphers with arbitrary finite domains. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol.\u00a02271, pp. 114\u2013130. Springer, Heidelberg (2002)"},{"key":"25_CR4","unstructured":"Duplichan, S.: A primitive polynomial search program. Web document (2003), Available at: http:\/\/users2.ev1.net\/~sduplichan\/primitivepolynomials\/primivitePolynomials.htm"},{"issue":"3","key":"25_CR5","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s001459900025","volume":"10","author":"S. Even","year":"1997","unstructured":"Even, S., Mansour, Y.: A construction of a cipher from a single pseudorandom permutation. Journal of Cryptology\u00a010(3), 151\u2013162 (1997)","journal-title":"Journal of Cryptology"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. of Computer and System Sciences\u00a028 (April 1984)","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"25_CR7","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), Full version available on the ePrint archive: http:\/\/eprint.iacr.org\/2003\/148\/"},{"key":"25_CR8","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), Full version available on the ePrint archive: http:\/\/eprint.iacr.org\/2003\/147\/"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-540-30556-9_25","volume-title":"Progress in Cryptology - INDOCRYPT 2004","author":"S. Halevi","year":"2004","unstructured":"Halevi, S.: EME*: extending EME to handle arbitrary-length messages with associated data. In: Canteaut, A., Viswanathan, K. (eds.) INDOCRYPT 2004. LNCS, vol.\u00a03348, pp. 315\u2013327. Springer, Heidelberg (2004), http:\/\/eprint.iacr.org\/2004\/125\/"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Kilian, J., Rogaway, P.: How to protect DES against exhaustive key search. Journal of Cryptology\u00a014(1), 17\u201335 (\u03042001); Earlier version in Koblitz, N. (ed.): CRYPTO 1996. LNCS, vol.\u00a01109, pp. 17\u201335. Springer, Heidelberg (1996), http:\/\/www.cs.ucdavis.edu\/~rogaway","DOI":"10.1007\/s001450010015"},{"key":"25_CR11","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, pp. 31\u201346. Springer, Heidelberg (2002), http:\/\/www.cs.berkeley.edu\/~daw\/"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Luby, M., Rackoff, C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal on Computing\u00a017(2) (April 1988)","DOI":"10.1137\/0217022"},{"key":"25_CR13","unstructured":"McGrew, D.A., Viega, J.: ABL mode: Security without data expansion. Private communication (2004)"},{"key":"25_CR14","unstructured":"Naor, M., Reingold, O.: A pseudo-random encryption mode (manuscript), available from: www.wisdom.weizmann.ac.il\/~naor\/"},{"issue":"1","key":"25_CR15","doi-asserted-by":"crossref","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. Journal of Cryptology\u00a012(1), 29\u201366 (1999); Earlier version in STOC 1997, Available from: www.wisdom.weizmann.ac.il\/~naor\/","journal-title":"Journal of Cryptology"},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-540-45146-4_30","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J. Patarin","year":"2003","unstructured":"Patarin, J.: Luby-Rackoff: 7 rounds are enough for 2 n(1\u2009\u2212\u2009\u03b5) security. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 513\u2013529. Springer, Heidelberg (2003)"},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-540-30564-4_23","volume-title":"Selected Areas in Cryptography","author":"S. Patel","year":"2004","unstructured":"Patel, S., Ramzan, Z., Sundaram, G.: Efficient Constructions of Variable-Input-Length Block Ciphers. In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol.\u00a03357, pp. 326\u2013340. Springer, Heidelberg (2004)"},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/3-540-60590-8_7","volume-title":"Fast Software Encryption","author":"R.L. Rivest","year":"1995","unstructured":"Rivest, R.L.: The RC5 encryption algorithm. In: Preneel, B. (ed.) FSE 1994. LNCS, vol.\u00a01008, pp. 86\u201396. Springer, Heidelberg (1995)"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Rogaway, P.: Efficient instantiations of tweakable block ciphers and refinements to modes OCB and PMAC (2004), Available on-line from: http:\/\/www.cs.ucdavis.edu\/~rogaway\/papers\/","DOI":"10.1007\/978-3-540-30539-2_2"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - INDOCRYPT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30556-9_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:22:06Z","timestamp":1605759726000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30556-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241300","9783540305569"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30556-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}