The benes network is q(q-1)/2n-almost q-set-wise independent

A switching network of depth d is a layered graph with d layers and n vertices in each layer. The edges of the switching network do not cross between layers and in each layer the edges form a partial matching. A switching network defines a stochastic process over S_n that starts with the identity permutation and goes through the layers of the network from first to last, where for each layer and each pair (i, j) in the partial matching of the layer, it applies the transposition (ij) with probability half. A switching network is good if the final distribution is close to the uniform distribution over S_n. A switching network is ε-almost q-permutation-wise independent if its action on any ordered set of size q is almost uniform, and is ε-almost q-set-wise independent if its action on any set of size q is almost uniform. Mixing of switching networks (even for q-permutation-wise and q-set-wise independence) has found several applications, mostly in cryptography. Some applications further require some additional properties from the network, e. g., the existence of an algorithm that given a permutation can set the switches such that the network generates the given permutation, a property that the Benes network has. Morris, Rogaway and Stegers showed the Thorp shuffle (which corresponds to applying two or more butterflies one after the other) is q-permutation-wise independent, for q = n γ for γ that depends on the number of sequential applications of the butterfly network. The techniques applied by Morris et al. do not seem to apply for the Benes network. In this work we show the Benes network is almost q-set-wise independent for q up to about √n. Our technique is simple and completely new, and we believe carries hope for getting even better results in the future.