{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:18:26Z","timestamp":1787318306328,"version":"3.56.0"},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642054433","type":"print"},{"value":"9783642054457","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","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-05445-7_19","type":"book-chapter","created":{"date-parts":[[2009,11,3]],"date-time":"2009-11-03T10:03:23Z","timestamp":1257242603000},"page":"295-312","source":"Crossref","is-referenced-by-count":187,"title":["Format-Preserving Encryption"],"prefix":"10.1007","author":[{"given":"Mihir","family":"Bellare","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Ristenpart","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Phillip","family":"Rogaway","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Till","family":"Stegers","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/978-3-642-05445-7_19","volume-title":"SAC 2009","author":"M. Bellare","year":"2009","unstructured":"Bellare, M., Ristenpart, T., Rogaway, P., Stegers, T.: Format-Preserving Encryption. In: Jacobson, M.J., Rijmen, V., Safavi-Naini, R. (eds.) SAC 2009. LNCS, vol.\u00a05867, pp. 295\u2013312. Springer, Heidelberg (2009)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11761679_25","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"M. Bellare","year":"2006","unstructured":"Bellare, M., Rogaway, P.: The security of triple encryption and a framework\u00a0for\u00a0code-based\u00a0game-playing\u00a0proofs. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 409\u2013426. Springer, Heidelberg (2006)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1007\/978-3-540-85174-5_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"M. Bellare","year":"2008","unstructured":"Bellare, M., Fischlin, M., O\u2019Neill, A., Ristenpart, T.: Deterministic encryption: definitional equivalences and constructions without random oracles. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 360\u2013378. Springer, Heidelberg (2008)"},{"key":"19_CR4","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":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/978-3-540-85174-5_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"A. Boldyreva","year":"2008","unstructured":"Boldyreva, A., Fehr, S., O\u2019Neill, A.: On notions of security for deterministic encryption, and efficient constructions without random oracles. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 335\u2013359. Springer, Heidelberg (2008)"},{"key":"19_CR6","unstructured":"Brightwell, M., Smith, H.: Using datatype-preserving encryption to enhance data warehouse security. In: 20th NISSC Proceedings, pp. 141\u2013149 (1997), \n                    \n                      http:\/\/www.csrc.nist.gov\/nissc\/1997"},{"issue":"2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0196-6774(89)90016-3","volume":"10","author":"C. Colbourn","year":"1989","unstructured":"Colbourn, C., Day, R., Nel, L.: Unranking and ranking spanning trees of a graph. Journal of Algorithms\u00a010(2), 271\u2013286 (1989)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"19_CR8","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/TIT.1973.1054929","volume":"19","author":"T. Cover","year":"1977","unstructured":"Cover, T.: Enumerative source encoding. IEEE Transactions on Information Theory\u00a019(1), 73\u201377 (1977)","journal-title":"IEEE Transactions on Information Theory"},{"key":"19_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":"19_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H.\u00a0Freeman and Company, New York (1979)"},{"key":"19_CR11","first-page":"440","volume-title":"17th Annual ACM Symposium on the Theory of Computing (STOC 1985)","author":"A. Goldberg","year":"1985","unstructured":"Goldberg, A., Sipser, M.: Compression and Ranking. In: 17th Annual ACM Symposium on the Theory of Computing (STOC 1985), pp. 440\u2013448. ACM Press, New York (1985)"},{"issue":"4","key":"19_CR12","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. Journal of the ACM\u00a033(4), 792\u2013807 (1986)","journal-title":"Journal of the ACM"},{"issue":"2","key":"19_CR13","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J.\u00a0Comput.\u00a0Syst.\u00a0Sci.\u00a028(2), 270\u2013299 (1984)","journal-title":"J.\u00a0Comput.\u00a0Syst.\u00a0Sci."},{"key":"19_CR14","volume-title":"Formal Languages and their Relation to Automata","author":"J. Hopcroft","year":"1969","unstructured":"Hopcroft, J., Ullman, J.: Formal Languages and their Relation to Automata. Addison-Wesley, Reading (1969)"},{"issue":"2","key":"19_CR15","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1002\/rsa.3240070205","volume":"7","author":"M. Jerrum","year":"1995","unstructured":"Jerrum, M.: A very simple algorithm for estimating the number of k-colorings of a low-degree graph. Random Structures and Algorithms\u00a07(2), 157\u2013165 (1995)","journal-title":"Random Structures and Algorithms"},{"key":"19_CR16","series-title":"Seminumerical Algorithms","volume-title":"The Art of Computer Programming","author":"D. Knuth","year":"1997","unstructured":"Knuth, D.: The Art of Computer Programming, 3rd edn. Seminumerical Algorithms, vol.\u00a02. Addison-Wesley, Reading (1997)","edition":"3"},{"key":"19_CR17","unstructured":"Liebehenschel, J.: Ranking and unranking of a generalized Dyck language and the application to the generation of random trees. S\u00e9minaire Lotharingien de Combinatoire\u00a043 (2000)"},{"key":"19_CR18","unstructured":"ISO\/IEC 7812-1:2006. Identification cards \u2013 Identification of issuers \u2013 Part 1: Numbering system"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/3-540-60922-9_47","volume-title":"STACS 96","author":"P. Kelsen","year":"1996","unstructured":"Kelsen, P.: Ranking and unranking trees using regular reductions. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol.\u00a01046, pp. 581\u2013592. Springer, Heidelberg (1996)"},{"key":"19_CR20","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":"19_CR21","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 of Computing\u00a017(2), 373\u2013386 (1988)","journal-title":"SIAM Journal of Computing"},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"189","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. 189\u2013203. Springer, Heidelberg (1996)"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"M\u00e4kinen, E.: Ranking and unranking left Szilard languages. Report A-1997-2, Department of Computer\u00a0Science, University of Tampere (1997)","DOI":"10.1080\/00207169808804677"},{"key":"19_CR24","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":"19_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-642-03356-8_17","volume-title":"CRYPTO 2009","author":"B. Morris","year":"2009","unstructured":"Morris, B., Rogaway, P., Stegers, T.: How to encipher messages on a small domain: deterministic encryption and the Thorp shuffle. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 286\u2013302. Springer, Heidelberg (2009)"},{"issue":"1","key":"19_CR26","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 pseudorandom permutations: Luby-Rackoff revisited. Journal of Cryptology\u00a012(1), 29\u201366 (1999)","journal-title":"Journal of Cryptology"},{"key":"19_CR27","unstructured":"National Bureau of Standards. FIPS PUB 74. Guidelines for Implementing and Using the NBS Data Encryption Standard (April\u00a01, 1981)"},{"key":"19_CR28","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 pseudorandom permutation generators based on the DES Scheme. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 301\u2013312. Springer, Heidelberg (1992)"},{"key":"19_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-45682-1_14","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"J. Patarin","year":"2001","unstructured":"Patarin, J.: Generic attacks on Feistel schemes. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 222\u2013238. Springer, Heidelberg (2001)"},{"key":"19_CR30","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":"19_CR31","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":"19_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/11935230_26","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"J. Patarin","year":"2006","unstructured":"Patarin, J., Nachef, V., Berbain, C.: Generic attacks on unbalanced Feistel schemes with contracting functions. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol.\u00a04284, pp. 396\u2013411. Springer, Heidelberg (2006)"},{"key":"19_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"19_CR34","unstructured":"PCI Security Standards Council. Payment Card Industry Data Security Standard Version 1.2, \n                    \n                      https:\/\/www.pcisecuritystandards.org\/security_standards\/pci_dss.shtml"},{"issue":"3","key":"19_CR35","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":"19_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"19_CR37","unstructured":"Schroeppel, R.: Personal communication, approximately (2001)"},{"key":"19_CR38","unstructured":"Sipser, M.: Introduction to the Theory of Computation, 2nd edn. Thomson Press (2006)"},{"key":"19_CR39","unstructured":"Spies, T.: Format preserving encryption. Unpublished white paper, \n                    \n                      www.voltage.com\n                    \n                    \n                   Database and Network Journal (December 2008), Format preserving encryption: \n                    \n                      www.voltage.com"},{"key":"19_CR40","doi-asserted-by":"crossref","unstructured":"Spies, T.: Personal communications (February 2009)","DOI":"10.1093\/jama\/9780195176339.022.85"},{"key":"19_CR41","unstructured":"Spies, T.: Feistel finite set encryption mode. Manuscript, posted on NIST\u2019s website on (February 6, 2008), \n                    \n                      http:\/\/www.csrc.nist.gov\/groups\/ST\/toolkit\/BCM\/documents\/proposedmodes\/ffsem\/ffsem-spec.pdf"},{"key":"19_CR42","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L. Valiant","year":"1979","unstructured":"Valiant, L.: The complexity of computing the permanent. Theoretical Computer Science\u00a08, 189\u2013201 (1979)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-05445-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T11:30:45Z","timestamp":1580297445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-05445-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642054433","9783642054457"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-05445-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}