Derandomized Constructions of k-Wise (Almost) Independent Permutations
- 1 January 2005
- book chapter
- Published by Springer Nature
- p. 354-365
- https://doi.org/10.1007/11538462_30
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Simple Permutations Mix WellPublished by Springer Nature ,2004
- Constant-Round Oblivious Transfer in the Bounded Storage ModelPublished by Springer Nature ,2004
- Composition of Random Systems: When Two Weak Make One StrongPublished by Springer Nature ,2004
- The Security of Many-Round Luby-Rackoff Pseudo-Random PermutationsPublished by Springer Nature ,2003
- Pushing Dependent Data in Clients–Providers–Servers SystemsWireless Networks, 2003
- Stable distributions, pseudorandom generators, embeddings and data stream computationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Ciphers with Arbitrary Finite DomainsPublished by Springer Nature ,2002
- An Almost m-wise Independent Random Permutation of the CubeCombinatorics, Probability and Computing, 1996
- Constructing Small Sample Spaces Satisfying Given ConstraintsSIAM Journal on Discrete Mathematics, 1994
- How to Construct Pseudorandom Permutations from Pseudorandom FunctionsSIAM Journal on Computing, 1988