Derandomized constructions of k-wise (almost) independent permutations

Lecture Notes in Computer Science

Volumn 3624, Issue , 2005, Pages 354-365

  Kaplan, Eyal ^a   Naor, Moni ^b   Reingold, Omer ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FUNCTION EVALUATION; FUNCTIONS; GRAPH THEORY;

INDEPENDENT FUNCTIONS; LOG-SPACE ALGORITHMS; PERMUTATIONS; PSEUDORANDOM GENERATORS;

RANDOM PROCESSES;

EID: 26944471646     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11538462_30     Document Type: Conference Paper

References (27)

1. N. Alon and J. Spencer, The Probabilistic Method, Wiley, 1992.
2. A. Bar-Noy, J. Naor and B. Schieber, Pushing Dependent Data in Clients-Providers-Servers Systems, Wireless Networks 9(5), 2003, pp. 421-430.
3. J. Black and P. Rogaway, Ciphers with Arbitrary Finite Domains. Topics in Cryptology - CT-RSA 2002, Lecture Notes in Computer Science, vol. 2271, Springer, 2002, 114-130.
4. A. Brodsky and S. Hoory, Simple Permutations Mix Even Better, Arxiv math.CO/0411098.
5. Y. Z. Ding, D. Harnik, A. Rosen and R. Shaltiel, Constant-Round Oblivious Transfer in the Bounded Storage Model, First Theory of Cryptography Conference, TCC 2004, LNCS vol. 2951, Springer, pp. 446-472
6. W. T. Gowers, An almost m-wise independent random permutation of the cube, Combinatorics, Probability and Computing, vol. 5(2), 1996, pp. 119-130.
7. S. Hoory, A. Magen, S. Myers, and C. Rackoff, Simple permutations mix well, The 31st International Colloquium on Automata, Languages and Programming (ICALP), 2004.
8. P. Indyk, Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation, FOCS 2000, pp. 189-197.
9. D. Koller and N. Megiddo, Constructing small sample spaces satisfying given constraints, SIAM J. Discrete Math., vol. 7(2), 1994, pp. 260-274.
10. M. Luby and C. Rackoff, How to construct pseudorandom permutations and pseudorandom functions, SIAM J. Comput., vol. 17, 1988, pp. 373-386.
11. U. M. Maurer and K. Pietrzak, The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations, EUROCRPYT 2003, LNCS vol. 2656, Springer, pp. 544-561.
12. U. M. Maurer and K. Pietrzak, Composition of Random Systems: When Two Weak Make One Strong, First Theory of Cryptography Conference, TCC 2004, LNCS vol. 2951, Springer, pp. 410-427.
13. B. Morris, On the mixing time for the Thorp shuffle, STOC 2005, pp. 403-412.
14. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, New York (NY), 1995.
15. M. Naor and O. Reingold, On the Construction of Pseudorandom Permutations: Luby-Rackoff Revisited, J. of Cryptology, vol. 12(1), Springer-Verlag, 1999, pp. 29-66.
16. N. Nisan, Pseudorandom generators for space-bounded computation, Combinatorica 12(4), 1992, 449-461.
17. N. Nisan and D. Zuckerman, Randomness is Linear in Space, J. Comput. Syst. Sci. vol. 52(1), 1996, pp. 43-52.
18. J. Patarin, Improved security bounds for pseudorandom permutations, 4th ACM Conference on Computer and Communications Security, 1997, pp. 142-150.
19. n(1-epsilon) Security, CRYPTO 2003: pp. 513-529.
20. J. Patarin Security of Random Feistel Schemes with 5 or More Rounds, CRYPTO 2004, pp. 106-122.
21. O. Reingold, Undirected ST-Connectibvity in Log-Space, STOC 2005, pp. 376-385.
22. O. Reingold, L. Trevisan, S. Vadhan, Pseudorandom Walks in Biregular Graphs and the RL vs. L Problem, ECCC, TR05-22, February 2005.
23. S. Rudich, Limits on the provable consequences of one-way functions, PhD Thesis, U. C. Berkeley.
24. A. Sinclair, Improved bounds for mixing rates of Markov chains and multicommodity flow, Combinatorics, Probability and Computing, vol. 1(4), 1992, pp. 351-370.
25. A. Siegel, On Universal Classes of Extremely Random Constant-Time Hash Functions, SIAM Journal on Computing 33(3), 2004, pp. 505-543.
26. D. Sivakumar, Algorithmic derandomization via complexity theory, STOC 2002, pp. 619-626
27. E. Thorp, Nonrandom shuffling with applications to the game of Faro, Journal of the American Statistical Association, vol. 68, 1973, pp. 842-847.