Authors
Mihir Bellare, Thomas Ristenpart, Phillip Rogaway, Till Stegers
Publication date
2009
Conference
Selected Areas in Cryptography: 16th Annual International Workshop, SAC 2009, Calgary, Alberta, Canada, August 13-14, 2009, Revised Selected Papers 16
Pages
295-312
Publisher
Springer Berlin Heidelberg
Description
Format-preserving encryption (FPE) encrypts a plaintext of some specified format into a ciphertext of identical format—for example, encrypting a valid credit-card number into a valid credit-card number. The problem has been known for some time, but it has lacked a fully general and rigorous treatment. We provide one, starting off by formally defining FPE and security goals for it. We investigate the natural approach for achieving FPE on complex domains, the “rank-then-encipher” approach, and explore what it can and cannot do. We describe two flavors of unbalanced Feistel networks that can be used for achieving FPE, and we prove new security results for each. We revisit the cycle-walking approach for enciphering on a non-sparse subset of an encipherable domain, showing that the timing information that may be divulged by cycle walking is not a damaging thing to leak.
Total citations
2009201020112012201320142015201620172018201920202021202220232024212102122233023412217232620346
Scholar articles
M Bellare, T Ristenpart, P Rogaway, T Stegers - Selected Areas in Cryptography: 16th Annual …, 2009