On implementation of a practical crypto-system in the limited access model

Most of the existing encryption schemes used for practical applications rely on un-proven assumptions. The limited access model proposed by Michael Rabin, describes a crypto-system which is provably unbreakable without any assumption on the computational power of an adversary. But this model makes assumption on the inaccessibility of a distributed source of randomness. In this paper we describe precisely an encryption scheme in the limited access model, which provides improvements over some previous attempts. We also describe the design of a physical random number generator required for the model. Also, we provide values for certain parameters involved in the scheme and argue about its security. Finally we provide some implementational details of a prototype which we implemented.