Design of Near-Optimal Pseudorandom Functions and Pseudorandom Permutations in the Information-Theoretic Model

In this paper we will extend the Benes and Luby-Racko# constructions to design various pseudo-random functions and pseudo-random permutations with near optimal information-theoretic properties. An example of application is when Alice wants to transmit to Bob some messages against Charlie, an adversary with unlimited computing power, when Charlie can receive only a percentage # of the transmitted bits