Abstract
We describe a security-preserving construction of a random permutation of domain size N from a random function, the construction tolerating adversaries asking all N plaintexts, yet employing just \(\Theta(\lg N)\) calls, on average, to the one-bit-output random function. The approach is based on card shuffling. The basic idea is to use the sometimes-recursetransformation: lightly shuffle the deck (with some other shuffle), cut the deck, and then recursively shuffle one of the two halves. Our work builds on a recent paper of Ristenpart and Yilek.
Chapter PDF
Similar content being viewed by others
Keywords
References
Accredited Standards Committee X9, Incorporated (ANSI X9): X9.124: Symmetric Key Cryptography for the Financial Services Industry — Format Preserving Encryption (2011) (manuscript)
Bellare, M., Impagliazzo, R.: A Tool for Obtaining Tighter Security Analyses of Pseudorandom Function Based Constructions, with Applications to PRP to PRF Conversion. ePrint report 1999/024 (1999)
Bellare, M., Ristenpart, T., Rogaway, P., Stegers, T.: Format-Preserving Encryption. In: Jacobson Jr., M.J., Rijmen, V., Safavi-Naini, R. (eds.) SAC 2009. LNCS, vol. 5867, pp. 295–312. Springer, Heidelberg (2009)
Black, J.A., Rogaway, P.: Ciphers with Arbitrary Finite Domains. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol. 2271, pp. 114–130. Springer, Heidelberg (2002)
Brightwell, M., Smith, H.: Using Datatype-preserving Encryption to Enhance Data Warehouse Security. In: 20th National Information Systems Security Conference Proceedings (NISSC), pp. 141–149 (1997)
Did, user profile http://math.stackexchange.com/users/6179/did : Total Variation Inequality for the Product Measure. Mathematics Stack Exchange, http://math.stackexchange.com/q/72322 (2011) (last visited June 2, 2014)
Dworkin, M.: NIST Special Publication 800-38G: Draft. Recommendation for Block Cipher Modes of Operation: Methods for Format-Preserving Encryption (July 2013)
FIPS 74: Guidelines for Implementing and Using the NBS Data Encryption Standard. U.S. National Bureau of Standards, U.S. Dept. of Commerce (1981)
Granboulan, L., Pornin, T.: Perfect Block Ciphers with Small Blocks. In: Biryukov, A. (ed.) FSE 2007. LNCS, vol. 4593, pp. 452–465. Springer, Heidelberg (2007)
Håstad, J.: The Square Lattice Shuffle. Random Structures and Algorithms 29(4), 466–474 (2006)
Hoang, V.T., Morris, B., Rogaway, P.: An Enciphering Scheme Based on a Card Shuffle. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 1–13. Springer, Heidelberg (2012)
Liskov, M., Rivest, R., Wagner, D.: Tweakable Block Ciphers. J. of Cryptology 24(3), 588–613 (2011)
Morris, B.: The Mixing Time of the Thorp Shuffle. SIAM J. on Computing 38(2), 484–504 (2008)
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. 5677, pp. 286–302. Springer, Heidelberg (2009)
Naor, M., Reingold, O.: On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited. J. of Cryptology 12(1), 29–66 (1999)
Ristenpart, T., Yilek, S.: The Mix-and-Cut Shuffle: Small-Domain Encryption Secure against N Queries. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 392–409. Springer, Heidelberg (2013)
Rudich, S.: Limits on the Provable Consequences of One-Way Functions. Ph.D. Thesis, UC Berkeley (1989)
Stefanov, E., Shi, E.: FastPRP: Fast Pseudo-Random Permutations for Small Domains. Cryptology ePrint Report 2012/254 (2012)
Thorp, E.: Nonrandom Shuffling with Applications to the Game of Faro. J. of the American Statistical Association 68, 842–847 (1973)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 International Association for Cryptologic Research
About this paper
Cite this paper
Morris, B., Rogaway, P. (2014). Sometimes-Recurse Shuffle. In: Nguyen, P.Q., Oswald, E. (eds) Advances in Cryptology – EUROCRYPT 2014. EUROCRYPT 2014. Lecture Notes in Computer Science, vol 8441. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55220-5_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-55220-5_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-55219-9
Online ISBN: 978-3-642-55220-5
eBook Packages: Computer ScienceComputer Science (R0)