Welcome to the resource topic for 2013/560
Title:
Sometimes-Recurse Shuffle: Almost-Random Permutations in Logarithmic Expected Time
Authors: Ben Morris, Phillip Rogaway
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 \textit{sometimes-recurse} transformation: 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.
ePrint: https://eprint.iacr.org/2013/560
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .