{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T22:37:17Z","timestamp":1770763037474,"version":"3.50.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540663478","type":"print"},{"value":"9783540484059","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48405-1_17","type":"book-chapter","created":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T06:24:36Z","timestamp":1178000676000},"page":"270-287","source":"Crossref","is-referenced-by-count":30,"title":["Stateless Evaluation of Pseudorandom Functions: Security Beyond the Birthday Barrier"],"prefix":"10.1007","author":[{"given":"Mihir","family":"Bellare","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oded","family":"Goldreich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hugo","family":"Krawczyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,12,16]]},"reference":[{"key":"17_CR1","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-Eurocrypt 96 Proceedings","author":"W. Aiello","year":"1996","unstructured":"W. Aiello, and R. Venkatesan. Foiling birthday attacks in length-doubling transformations. Advances in Cryptology-Eurocrypt 96 Proceedings, Lecture Notes in Computer Science Vol. 1070, U. Maurer ed., Springer-Verlag, 1996."},{"key":"17_CR2","unstructured":"M. Bellare, A. Desai, E. Jokipii and P. Rogaway. A concrete security treatment of symmetric encryption: Analysis of the DES modes of operation. Proceedings of the 38th Symposium on Foundations of Computer Science, IEEE, 1997."},{"key":"17_CR3","unstructured":"M. Bellare, O. Goldreich and h. Krawczyk. Beyond the birthday barrier, without counters. Full version of this paper, available via \n                    http:\/\/www-cse. ucsd.edu\/users\/mihir\n                    \n                  ."},{"key":"17_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Preliminary version in Advances in Cryptology-Crypto 95 Proceedings","author":"M. Bellare","year":"1995","unstructured":"M. Bellare, R. Gu\u00c9rin and P. Rogaway. XOR MACs: New Methods for Message Authentication using Finite Pseudorandom Functions. Full version available via \n                    http:\/\/www-cse.ucsd.edu\/users\/mihir\n                    \n                  . Preliminary version in Advances in Cryptology-Crypto 95 Proceedings, Lecture Notes in Computer Science Vol. 963, D. Coppersmith ed., Springer-Verlag, 1995."},{"key":"17_CR5","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-Crypto 94 Proceedings","author":"M. Bellare","year":"1994","unstructured":"M. Bellare, J. Kilian and P. Rogaway. The Security of Cipher Block Chaining. Advances in Cryptology-Crypto 94 Proceedings, Lecture Notes in Computer Science Vol. 839, Y. Desmedt ed., Springer-Verlag, 1994."},{"key":"17_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-Eurocrypt 97 Proceedings","author":"M. Bellare","year":"1997","unstructured":"M. Bellare, T. Krovetz and P. Rogaway. Luby-Rackoff backwards: Increasing security by making block ciphers non-invertible. Advances in Cryptology-Eurocrypt 97 Proceedings, Lecture Notes in Computer Science Vol. 1233, W. Fumy ed., Springer-Verlag, 1997."},{"issue":"4","key":"17_CR7","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser and S. Micali. How to construct random functions. Journal of the ACM, Vol. 33, No. 4, 1986, pp. 210\u2013217.","journal-title":"Journal of the ACM"},{"key":"17_CR8","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-Crypto 98 Proceedings","author":"C. Hall","year":"1998","unstructured":"C. Hall, D. Wagner, J. Kelsey and B. Schneier. Building PRFs from PRPs. Advances in Cryptology-Crypto 98 Proceedings, Lecture Notes in Computer Science Vol. 1462, H. Krawczyk ed., Springer-Verlag, 1998."},{"key":"17_CR9","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-Crypto 94 Proceedings","author":"H. Krawczyk","year":"1994","unstructured":"H. Krawczyk. LFSR-based Hashing and Authentication. Advances in Cryptology-Crypto 94 Proceedings, Lecture Notes in Computer Science Vol. 839, Y. Desmedt ed., Springer-Verlag, 1994."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"M. Luby and C. Rackoff. How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Computing, Vol. 17, No. 2, April 1988.","DOI":"10.1137\/0217022"},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/PL00003817","volume":"12","author":"M. Naor","year":"1999","unstructured":"M. Naor and O. Reingold. On the construction of pseudorandom permutations: Luby-Rackoff revisited. J. of Cryptology Vol. 12, No. 1, 1999, pp. 29\u201366.","journal-title":"J. of Cryptology"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"J. Patarin. Improved security bounds for pseudorandom permutations. Proceedings of the Fourth Annual Conference on Computer and Communications Security, ACM, 1997.","DOI":"10.1145\/266420.266452"},{"key":"17_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-69710-1_8","volume-title":"Proceedings of the 5th Fast Software Encryption Workshop","author":"J. Patarin","year":"1998","unstructured":"J. Patarin. About Feistel schemes with six (or more) rounds. Proceedings of the 5th Fast Software Encryption Workshop, Lecture Notes in Computer Science Vol. 1372, Springer-Verlag, 1998."},{"key":"17_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44750-4_1","volume-title":"Advances in Cryptology-Crypto 95 Proceedings","author":"B. Preneel","year":"1995","unstructured":"B. Preneel and P. van Oorschott. MDx-MAC and building fast MACs from hash functions. Advances in Cryptology-Crypto 95 Proceedings, Lecture Notes in Computer Science Vol. 963, D. Coppersmith ed., Springer-Verlag, 1995."},{"key":"17_CR15","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-Crypto 96 Proceedings","author":"V. Shoup","year":"1996","unstructured":"V. Shoup. On Fast and Provably Secure Message Authentication Based on Universal Hashing. Advances in Cryptology-Crypto 96 Proceedings, Lecture Notes in Computer Science Vol. 1109, N. Koblitz ed., Springer-Verlag, 1996."},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M. Wegman","year":"1981","unstructured":"M. Wegman and L. Carter. New hash functions and their use in authentication and set equality. J. of Computer and System Sciences, vol. 22, 1981, pp. 265\u2013279.","journal-title":"J. of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 99"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48405-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T07:17:50Z","timestamp":1550301470000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48405-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540663478","9783540484059"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-48405-1_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}