## CryptoDB

### Paul Camion

#### Publications

Year
Venue
Title
2005
EPRINT
In this paper we will extend the Benes and Luby-Rackoff 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 $\tau$ of the transmitted bits. By using Benes, Luby-Rackoff iterations, concatenations and fixing at 0 some values, we will show in this paper how to design near optimal pseudo-random functions for all values of $\tau$. Moreover we will show how to design near optimal pseudo-random permutations when $\tau$ can have any value such that the number of bits obtained by Charlie is smaller than the square root of all the transmitted bits.
1996
CRYPTO
1996
EUROCRYPT
1991
CRYPTO
1991
EUROCRYPT
1988
EUROCRYPT

Eurocrypt 1995
Eurocrypt 1989

#### Coauthors

Anne Canteaut (2)
Claude Carlet (1)
Pascale Charpin (1)
Philippe Godlewski (1)
Jacques Patarin (2)
Nicolas Sendrier (1)