How to construct pseudorandom permutations from pseudorandom functions
SIAM Journal on Computing - Special issue on cryptography
Constructing Small Sample Spaces Satisfying Given Constants
SIAM Journal on Discrete Mathematics
Randomized algorithms
Journal of Computer and System Sciences
Improved security bounds for pseudorandom permutations
Proceedings of the 4th ACM conference on Computer and communications security
Algorithmic derandomization via complexity theory
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Ciphers with Arbitrary Finite Domains
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
Stable distributions, pseudorandom generators, embeddings and data stream computation
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Pushing dependent data in clients-providers-servers systems
Wireless Networks
On Universal Classes of Extremely Random Constant-Time Hash Functions
SIAM Journal on Computing
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The mixing time of the thorp shuffle
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The security of many-round Luby-Rackoff pseudo-random permutations
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Pseudorandom walks on regular digraphs and the RL vs. L problem
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Finding Frequent Items over General Update Streams
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Implementing Huge Sparse Random Graphs
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Indistinguishability amplification
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
On the security of pseudorandomized information-theoretically secure schemes
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
S-T connectivity on digraphs with a known stationary distribution
ACM Transactions on Algorithms (TALG)
Pseudorandom generators for combinatorial shapes
Proceedings of the forty-third annual ACM symposium on Theory of computing
De dictionariis dynamicis pauco spatio utentibus
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Probabilistic existence of rigid combinatorial structures
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.03 |
Constructions of k-wise almost independent permutations have been receiving a growing amount of attention in recent years. However, unlike the case of k-wise independent functions, the size of previously constructed families of such permutations is far from optimal. This paper gives a new method for reducing the size of families given by previous constructions. Our method relies on pseudorandom generators for space-bounded computations. In fact, all we need is a generator, that produces “pseudorandom walks” on undirected graphs with a consistent labelling. One such generator is implied by Reingold's log-space algorithm for undirected connectivity [21,22]. We obtain families of k-wise almost independent permutations, with an optimal description length, up to a constant factor. More precisely, if the distance from uniform for any k tuple should be at most δ, then the size of the description of a permutation in the family is $O(kn +\log \frac 1 {\delta})$.