{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:48:27Z","timestamp":1767340107546},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033551"},{"type":"electronic","value":"9783642033568"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03356-8_17","type":"book-chapter","created":{"date-parts":[[2009,8,18]],"date-time":"2009-08-18T10:00:39Z","timestamp":1250589639000},"page":"286-302","source":"Crossref","is-referenced-by-count":71,"title":["How to Encipher Messages on a Small Domain"],"prefix":"10.1007","author":[{"given":"Ben","family":"Morris","sequence":"first","affiliation":[]},{"given":"Phillip","family":"Rogaway","sequence":"additional","affiliation":[]},{"given":"Till","family":"Stegers","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"17_CR2","doi-asserted-by":"publisher","first-page":"333","DOI":"10.2307\/2323590","volume":"93","author":"D. Aldous","year":"1986","unstructured":"Aldous, D., Diaconis, P.: Shuffling cards and stopping times. American Mathematical Monthly\u00a093, 333\u2013348 (1986)","journal-title":"American Mathematical Monthly"},{"issue":"1","key":"17_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0196-8858(87)90006-6","volume":"8","author":"D. Aldous","year":"1987","unstructured":"Aldous, D., Diaconis, P.: Strong uniform times and finite random walks. Advances in Applied Mathematics\u00a08(1), 69\u201397 (1987)","journal-title":"Advances in Applied Mathematics"},{"issue":"2","key":"17_CR4","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1214\/aoap\/1177005705","volume":"2","author":"D. Bayer","year":"1992","unstructured":"Bayer, D., Diaconis, P.: Tracing the dovetail shuffle to its lair. Annals of Applied Probability\u00a02(2), 294\u2013313 (1992)","journal-title":"Annals of Applied Probability"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Ristenpart, T.: Format-preserving encryption. Cryptology ePrint report 2009\/251","DOI":"10.1007\/978-3-642-05445-7_19"},{"key":"17_CR6","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":"17_CR7","unstructured":"Brightwell, M., Smith, H.: Using datatype-preserving encryption to enhance data warehouse security. In: 20th National Information Systems Security Conference Proceedings (NISSC), pp. 141\u2013149 (1997)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Kanarek, P., Kuty\u0142owski, M., Lory\u015b, K.: Fast generation of random permutations via networks simulation. Algorithmica\u00a021(1) (May 1998)","DOI":"10.1007\/PL00009206"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/3-540-44448-3_39","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"A. Desai","year":"2000","unstructured":"Desai, A., Miner, S.: Concrete security characterizations of PRFs and PRPs: reductions and applications. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 503\u2013516. Springer, Heidelberg (2000)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Diaconis, P.: Group representations in Probability and Statistics. Lecture Notes\u2014Monograph series, vol.\u00a011. Institute of Mathematical Statistics (1988)","DOI":"10.1214\/lnms\/1215467407"},{"issue":"4","key":"17_CR11","doi-asserted-by":"publisher","first-page":"1483","DOI":"10.1214\/aop\/1176990628","volume":"18","author":"P. Diaconis","year":"1990","unstructured":"Diaconis, P., Fill, J.: Strong stationary times via a new form of duality. Annals of Probability\u00a018(4), 1483\u20131522 (1990)","journal-title":"Annals of Probability"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/978-3-540-74619-5_28","volume-title":"Fast Software Encryption","author":"L. Granboulan","year":"2007","unstructured":"Granboulan, L., Pornin, T.: Perfect block ciphers with small blocks. In: Biryukov, A. (ed.) FSE 2007. LNCS, vol.\u00a04593, pp. 452\u2013465. Springer, Heidelberg (2007)"},{"issue":"4","key":"17_CR13","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1002\/rsa.20131","volume":"29","author":"J. H\u00e5stad","year":"2006","unstructured":"H\u00e5stad, J.: The square lattice shuffle. Random Structures and Algorithms\u00a029(4), 466\u2013474 (2006)","journal-title":"Random Structures and Algorithms"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/11538462_30","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"E. Kaplan","year":"2005","unstructured":"Kaplan, E., Naor, M., Reingold, O.: Derandomized constructions of k-wise (almost) independent permutations. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005 and RANDOM 2005. LNCS, vol.\u00a03624, pp. 354\u2013365. Springer, Heidelberg (2005)"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Levin, D., Peres, Y., Wilmer, E.: Markov chains and mixing times. American Mathematical Society (2008)","DOI":"10.1090\/mbk\/058"},{"key":"17_CR16","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)"},{"issue":"2","key":"17_CR17","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.\u00a0on Computing\u00a017(2), 373\u2013386 (1988)","journal-title":"SIAM J.\u00a0on Computing"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/3-540-60865-6_53","volume-title":"Fast Software Encryption","author":"S. Lucks","year":"1996","unstructured":"Lucks, S.: Faster Luby-Rackoff ciphers. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol.\u00a01039, pp. 180\u2013203. Springer, Heidelberg (1996)"},{"key":"17_CR19","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":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/3-540-39200-9_34","volume-title":"EUROCRYPT 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":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-74143-5_8","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"U. Maurer","year":"2007","unstructured":"Maurer, U., Pietrzak, K., Renner, R.: Indistinguishability amplification. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 130\u2013149. Springer, Heidelberg (2007)"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Montenegro, R., Tetali, P.: Mathematical aspects of mixing times in Markov chains. Foundations and Trends in Theoretical Computer Science\u00a01(3) (2006)","DOI":"10.1561\/0400000003"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Morris, B.: Improved mixing time bounds for the Thorp shuffle and L-reversal chain (February\u00a04, 2008) arXiv:0802.0339","DOI":"10.1214\/08-AOP409"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Morris, B.: The mixing time for simple exclusion. Annals of Applied Probability\u00a016(2) (2006)","DOI":"10.1214\/105051605000000728"},{"issue":"2","key":"17_CR25","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1137\/050636231","volume":"38","author":"B. Morris","year":"2008","unstructured":"Morris, B.: The mixing time of the Thorp shuffle. SIAM J.\u00a0on Computing\u00a038(2), 484\u2013504 (2008); Earlier version in STOC 2005","journal-title":"SIAM J.\u00a0on Computing"},{"issue":"2","key":"17_CR26","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s00440-005-0434-7","volume":"133","author":"B. Morris","year":"2005","unstructured":"Morris, B., Peres, Y.: Evolving sets, mixing and heat kernel bounds. Probability Theory and Related Fields\u00a0133(2), 245\u2013266 (2005)","journal-title":"Probability Theory and Related Fields"},{"issue":"1","key":"17_CR27","doi-asserted-by":"publisher","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. J.\u00a0of Cryptology\u00a012(1), 29\u201366 (1999)","journal-title":"J.\u00a0of Cryptology"},{"key":"17_CR28","unstructured":"Patarin, J.: Generic attacks on Feistel schemes. Cryptology ePrint report 2008\/036"},{"key":"17_CR29","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\u00a0rounds are enough for 2n(1\u2009\u2212\u2009\u03b5) security. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 513\u2013529. Springer, Heidelberg (2003)"},{"key":"17_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-540-68164-9_14","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2008","author":"J. Patarin","year":"2008","unstructured":"Patarin, J.: A proof of security in O(2 n ) for the Benes scheme. In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol.\u00a05023, pp. 209\u2013220. Springer, Heidelberg (2008)"},{"key":"17_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"issue":"3","key":"17_CR32","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s001450010009","volume":"13","author":"E. Petrank","year":"2000","unstructured":"Petrank, E., Rackoff, C.: CBC\u00a0MAC for real-time data sources. J.\u00a0of Cryptology\u00a013(3), 315\u2013338 (2000)","journal-title":"J.\u00a0of Cryptology"},{"key":"17_CR33","unstructured":"Rogaway, P.: A synopsis of format-preserving encryption (manuscript) (September 2008)"},{"key":"17_CR34","unstructured":"Rudich, S.: Limits on the provable consequences of one-way functions. Ph.D.\u00a0Thesis, UC\u00a0Berkeley (1989)"},{"key":"17_CR35","series-title":"Encyclopedia of Mathematical Sciences","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-662-09444-0_5","volume-title":"Probability on Discrete Structures","author":"L. Saloff-Coste","year":"2004","unstructured":"Saloff-Coste, L.: Random walks on finite groups. In: Kesten, H. (ed.) Probability on Discrete Structures. Encyclopedia of Mathematical Sciences, vol.\u00a0110, pp. 263\u2013346. Springer, Heidelberg (2004)"},{"key":"17_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-60865-6_49","volume-title":"Fast Software Encryption","author":"B. Schneier","year":"1996","unstructured":"Schneier, B., Kelsey, J.: Unbalanced Feistel networks and block-cipher design. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol.\u00a01039, pp. 121\u2013144. Springer, Heidelberg (1996)"},{"key":"17_CR37","unstructured":"Spies, T.: Feistel finite set encryption. NIST submission (February 2008), http:\/\/csrc.nist.gov\/groups\/ST\/toolkit\/BCM\/modes_development.html"},{"key":"17_CR38","doi-asserted-by":"crossref","unstructured":"Spies, T.: Personal communications (February 2009)","DOI":"10.1093\/jama\/9780195176339.022.85"},{"key":"17_CR39","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1214\/aoms\/1177697586","volume":"40","author":"W. Steiger","year":"1969","unstructured":"Steiger, W.: A best possible Kolmogoroff-type inequality for martingales and a characteristic property. Annals of Mathematical Statistics\u00a040, 764\u2013769 (1969)","journal-title":"Annals of Mathematical Statistics"},{"key":"17_CR40","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1080\/01621459.1973.10481434","volume":"68","author":"E. Thorp","year":"1973","unstructured":"Thorp, E.: Nonrandom shuffling with applications to the game of Faro. Journal of the American Statistical Association\u00a068, 842\u2013847 (1973)","journal-title":"Journal of the American Statistical Association"},{"key":"17_CR41","unstructured":"Zechner, H.: Efficient sampling from continuous and discrete distributions. Ph.D.\u00a0Thesis, Institute for Statistics, TU\u00a0Graz (1997)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03356-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,15]],"date-time":"2024-03-15T19:01:04Z","timestamp":1710529264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03356-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033551","9783642033568"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03356-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}