Simple Permutations Mix Well
نویسندگان
چکیده
We study the random composition of a small family of O(n3) simple permutations on {0, 1}n. Specifically we ask what is the number of compositions needed to achieve a permutation that is close to k-wise independent. We improve on a result of Gowers [1] and show that up to a polylogarithmic factor, n3k3 compositions of random permutations from this family suffice. We further show that the result applies to the stronger notion of k-wise independence against adaptive adversaries. This question is essentially about the rapid mixing of the random walk on a certain graph, and we approach it using a new technique to construct canonical paths. We also show that if we are willing to use a much larger family of simple permutations then we can guaranty closeness to k-wise independence with fewer compositions and fewer random bits.
منابع مشابه
Information Leakage in Mix Networks with Randomized Partial Checking
We present a previously unknown vulnerability of mix networks (mix nets) that use pseudorandom permutations and that are audited with randomized partial checking (RPC). Our method relies on two simple observations: A mix that generates pseudorandom permutations only generates a limited subset of all possible permutations; in practical cases, RPC exposes enough information to uniquely identify t...
متن کاملSimple permutations mix even better
We study the random composition of a small family of O(n) simple permutations on {0, 1}n. Specifically we ask how many randomly selected simple permutations need be composed to yield a permutation that is close to k-wise independent. We improve on the results of Gowers [12] and Hoory et al. [13] and show that up to a polylogarithmic factor, nk compositions of random permutations from this famil...
متن کاملA Public Shuffle without Private Permutations
In TCC 2007, Adida and Wikström proposed a novel approach to shuffle, called a public shuffle, in which a shuffler can perform shuffle publicly without needing information kept secret. Their scheme uses an encrypted permutation matrix to shuffle ciphertexts publicly. This approach significantly reduces the cost of constructing a mix-net to verifiable joint decryption. Though their method is suc...
متن کاملA Survey of Simple Permutations
We survey the known results about simple permutations. In particular, we present a number of recent enumerative and structural results pertaining to simple permutations, and show how simple permutations play an important role in the study of permutation classes. We demonstrate how classes containing only finitely many simple permutations satisfy a number of special properties relating to enumer...
متن کاملMix-Compress-Mix Revisited: Dispensing with Non-invertible Random Injection Oracles
We revisit the problem of building dual-model secure (DMS) hash functions that are simultaneously provably collision resistant (CR) in the standard model and provably pseudorandom oracle (PRO) in an idealized model. Designing a DMS hash function was first investigated by Ristenpart and Shrimpton (ASIACRYPT 2007); they put forth a generic approach, called Mix-Compress-Mix (MCM), and showed the f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 348 شماره
صفحات -
تاریخ انتشار 2004