{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:01:56Z","timestamp":1772283716682,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540681595","type":"print"},{"value":"9783540681649","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68164-9_14","type":"book-chapter","created":{"date-parts":[[2008,5,30]],"date-time":"2008-05-30T06:48:34Z","timestamp":1212130114000},"page":"209-220","source":"Crossref","is-referenced-by-count":10,"title":["A Proof of Security in O(2 n ) for the Benes Scheme"],"prefix":"10.1007","author":[{"given":"Jacques","family":"Patarin","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/3-540-68339-9_27","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"W. Aiello","year":"1996","unstructured":"Aiello, W., Venkatesan, R.: Foiling Birthday Attacks in Length-Doubling Transformations - Benes: a non-reversible alternative to Feistel. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 307\u2013320. Springer, Heidelberg (1996)"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"M. Bellare","year":"1999","unstructured":"Bellare, M., Goldreich, O., Krawczyk, H.: Stateless evaluation of pseudorandom functions: Security beyond the birthday barrier. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, Springer, Heidelberg (1999)"},{"key":"14_CR3","unstructured":"Bellare, M., Impagliazzio, R.: A Tool for Obtaining Tighter Security Analysis of Pseudorandom Based Constructions, with Applications to PRP to PRF Conversion,Cryptology ePrint archive: 19995\/024: Listing for 1999"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"I. Damg\u00e5rd","year":"1990","unstructured":"Damg\u00e5rd, I.: Design Principles of Hash Functions. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, Springer, Heidelberg (1990)"},{"key":"14_CR5","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. JACM\u00a033, 792\u2013807 (1986)","journal-title":"JACM"},{"key":"14_CR6","unstructured":"Luby, M.: Pseudorandomness and Its Cryptographic Applications. In: Princeton Computer Science Notes, Princeton University Press, Princeton"},{"issue":"2","key":"14_CR7","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 Journal on Computing\u00a017(2), 373\u2013386 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/3-540-45539-6_34","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"S. Lucks","year":"2000","unstructured":"Lucks, S.: The Sum of PRP Is a Secure PRF. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 470\u2013487. Springer, Heidelberg (2000)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-47555-9_21","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","author":"U. Maurer","year":"1993","unstructured":"Maurer, U.: A simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generators. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 239\u2013255. Springer, Heidelberg (1993)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/3-540-48405-1_4","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"U. Maurer","year":"1999","unstructured":"Maurer, U.: Information-Theoretic Cryptography. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 47\u201364. Springer, Heidelberg (1999)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-46035-7_8","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"U. Maurer","year":"2002","unstructured":"Maurer, U.: Indistinguishability of Random Systems. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 110\u2013132. Springer, Heidelberg (2002)"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/3-540-39200-9_34","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"U. Maurer","year":"2003","unstructured":"Maurer, U., Pietrzak, K.: The security of Many-Round Luby-Rackoff Pseudo-Random Permutations. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 544\u2013561. Springer, Heidelberg (2003)"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/PL00003817","volume":"12","author":"M. Naor","year":"1997","unstructured":"Naor, M., Reingold, O.: On the construction of pseudo-random permutations: Luby-Rackoff revisited. Journal of Cryptology\u00a012, 29\u201366 (1997); In: Proc. 29th ACM Symp. on Theory of Computing, pp. 189\u2013199 (1997) (extented abstract)","journal-title":"Journal of Cryptology"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/3-540-46766-1_25","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"J. Patarin","year":"1992","unstructured":"Patarin, J.: New results on pseudo-random permutation generators based on the DES scheme. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 301\u2013312. Springer, Heidelberg (1992)"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1145\/266420.266452","volume-title":"4th ACM Conference on Computer and Communications Security","author":"J. Patarin","year":"1997","unstructured":"Patarin, J.: Improved security bounds for pseudorandom permutations. In: 4th ACM Conference on Computer and Communications Security, Zurich, April 1-4, 1997, pp. 142\u2013150. ACM Press, New York (1997)"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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                    n(1\u2009\u2212\u2009\u03b5) Security. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 513\u2013529. Springer, Heidelberg (2003)"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/978-3-540-28628-8_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"J. Patarin","year":"2004","unstructured":"Patarin, J.: Security of Random Feistel Schemes with 5 or more rounds. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 106\u2013122. Springer, Heidelberg (2004)"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/11734727_10","volume-title":"Information Security and Cryptology - ICISC 2005","author":"J. Patarin","year":"2006","unstructured":"Patarin, J., Montreuil, A.: Benes and Butterfly Schemes Revisited. In: Won, D.H., Kim, S. (eds.) ICISC 2005. LNCS, vol.\u00a03935, pp. 92\u2013116. Springer, Heidelberg (2006)"},{"key":"14_CR19","unstructured":"Patarin, J., Camion, P.: Design of near-optimal pseudorandom permutations in the information-theoretic model, Cryptology ePrint archive: 2005\/153: Listing for 2005"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68164-9_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:38:50Z","timestamp":1620002330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68164-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540681595","9783540681649"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68164-9_14","relation":{},"subject":[]}}