{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:01:59Z","timestamp":1772283719287,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540645184","type":"print"},{"value":"9783540697954","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054132","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T09:13:04Z","timestamp":1153991584000},"page":"266-280","source":"Crossref","is-referenced-by-count":71,"title":["Luby-Rackoff backwards: Increasing security by making block ciphers non-invertible"],"prefix":"10.1007","author":[{"given":"Mihir","family":"Bellare","sequence":"first","affiliation":[]},{"given":"Ted","family":"Krovetz","sequence":"additional","affiliation":[]},{"given":"Phillip","family":"Rogaway","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,25]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"W. Aiello and R. Vanketesan, \u201cFoiling birthday attacks in output-doubling transformations.\u201d Advances in Cryptology \u2014 Eurocrypt 96 Proceedings, Lecture Notes in Computer Science Vol. 1070, U. Maurer ed., Springer-Verlag, 1996.","DOI":"10.1007\/3-540-68339-9_27"},{"key":"20_CR2","unstructured":"M. Bellare, O. Goldreich and H. Krawczyk, personal communications, 1995."},{"key":"20_CR3","unstructured":"M. Bellare, R. Canetti and H. Krawczyk, \u201cPseudorandom functions revis-ited: The cascade construction and its concrete security.\u201d Proceedings of the 37th Symposium on Foundations of Computer Science, IEEE, 1996."},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"M. Bellare, A. Desai, E. Jokipii and P. Rogaway, \u201cA concrete security treatment of symmetric encryption.\u201d Proceedings of the 38th Symposium on Foundations of Computer Science, IEEE, 1997.","DOI":"10.1109\/SFCS.1997.646128"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"M. Bellare, R. Gu\u00e9rin and P. Rogaway, \u201cXOR MACs: New methods for message authentication using a finite pseudorandom function.\u201d Advances in Cryp-tology \u2014 Crypto 95 Proceedings, Lecture Notes in Computer Science Vol. 963, D. Coppersmith ed., Springer-Verlag, 1995.","DOI":"10.1007\/3-540-44750-4_2"},{"key":"20_CR6","unstructured":"M. Bellare, J. Kilian and P. Rogaway, \u201cThe security of cipher block chain-ing.\u201d Advances in Cryptology \u2014 Crypto 94 Proceedings, Lecture Notes in Com-puter Science Vol. 839, Y. Desmedt ed., Springer-Verlag, 1994."},{"key":"20_CR7","unstructured":"M. Bellare, T. Krovetz and P. Rogaway, \u201cLuby-Rackoff backwards: Increas-ing security by making block ciphers non-invertible.\u201d Full version of this paper, available at http:\/\/www-cse.ucsd.edu\/users\/mihir"},{"key":"20_CR8","unstructured":"S. Even and Y. Mansour, \u201cA construction of a cipher from a single pseudo-random permutation.\u201d Advances in Cryptology \u2014 ASIACRYPT 91 Proceedings, Lecture Notes in Computer Science Vol. 739, H. Imai, R. Rivest and T. Matsumoto ed., Springer-Verlag, 1991."},{"issue":"4","key":"20_CR9","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, \u201cHow to construct random functions,\u201d Journal of the ACM, Vol. 33, No. 4, 1986, pp. 210\u2013217.","journal-title":"Journal of the ACM"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser and S. Micali, \u201cProbabilistic encryption.\u201d J. of Computer and System Sciences, Vol. 28, April 1984, pp. 270\u2013299.","journal-title":"J. of Computer and System Sciences"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"J. Kilian and P. Rogaway, \u201cHow to protect DES against exhaustive key search.\u201d Advances in Cryptology \u2014 Crypto 96 Proceedings, Lecture Notes in Computer Science Vol. 1109, N. Koblitz ed., Springer-Verlag, 1996.","DOI":"10.1007\/3-540-68697-5_20"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"M. Luby, Pseudorandomness and Crpyptographic Applications. Princeton Uni-versity Press, 1996.","DOI":"10.1515\/9780691206844"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"M. Lubyand C. Rackoff, \u201cHow to construct pseudorandom permutations from pseudorandom functions.\u201d SIAM J. Comput, Vol. 17, No. 2, April 1988.","DOI":"10.1137\/0217022"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"M. Matsui, \u201cThe first experimental cryptanalysis of the Data Encryption Stan-dard.\u201d Advances in Cryptology \u2014 Crypto 94 Proceedings, Lecture Notes in Com-puter Science Vol. 839, Y. Desmedt ed., Springer-Verlag, 1994, pp. 1\u20132.","DOI":"10.1007\/3-540-48658-5_1"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"U. Maurer, \u201cA simplified and generalized treatment of Luby-Rackoff pseudoran-dom permutation generators.\u201d Advances in Cryptology \u2014 Eurocrypt 92 Proceed-ings, Lecture Notes in Computer Science Vol. 658, R. Rueppel ed., Springer-Verlag, 1992, pp. 239\u2013255.","DOI":"10.1007\/3-540-47555-9_21"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"M. Naor and O. Reingold, \u201cOn the construction of pseudo-random permuta-tions: Luby-Rackoff revisited.\u201d Proceedings of the 29th Annual Symposium on Theory of Computing, ACM, 1997.","DOI":"10.1145\/258533.258581"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"J. Patarin, \u201cImproved security bounds for pseudorandom permutations.\u201d Fourth ACM Conference on Computer and Communications Security, 1997.","DOI":"10.1145\/266420.266452"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"J. Patarin, \u201cAbout Feistel schemes with six (or more) rounds.\u201d To appear in Fast Software Encryption (FSE5), March 1998.","DOI":"10.1007\/3-540-69710-1_8"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"J. Pieprzyk, \u201cHow to construct pseudorandom permutations from single pseu-dorandom functions.\u201d Advances in Cryptology \u2014 Eurocrypt 90 Proceedings, Lec-ture Notes in Computer Science Vol. 473, I. Damg\u00e5rd ed., Springer-Verlag, 1990 pp. 140\u2013150.","DOI":"10.1007\/3-540-46877-3_12"},{"issue":"4","key":"20_CR20","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"C. Shannon","year":"1949","unstructured":"C. Shannon, \u201cCommunication theory of secrecy systems.\u201d Bell Systems Technical Journal, 28(4), 656\u2013715 (1949).","journal-title":"Bell Systems Technical Journal"},{"key":"20_CR21","unstructured":"V. Shoup, \u201cOn fast and provably secure message authentication based on univer-sal hashing.\u201d Advances in Cryptology \u2014 Crypto 96 Proceedings, Lecture Notes in Computer Science Vol. 1109, N. Koblitz ed., Springer-Verlag, 1996."},{"key":"20_CR22","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, \u201cNew hash functions and their use in authentica-tion and set equality.\u201d J. of Computer and System Sciences 22, 265\u2013279 (1981).","journal-title":"J. of Computer and System Sciences"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Y. Zheng, T. Matsumoto and H. Imai, \u201cImpossibility and optimality results on constructing pseudorandom permutations.\u201d Advances in Cryptology \u2014 Crypto 90 Proceedings, Lecture Notes in Computer Science Vol. 537, A. J. Menezes and S. Vanstone ed., Springer-Verlag, 1990, pp. 412\u2013422.","DOI":"10.1007\/3-540-46885-4_41"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT'98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054132","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T14:05:04Z","timestamp":1587132304000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0054132"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645184","9783540697954"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/bfb0054132","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}