Encryption is a fundamental building block for computer and communications technologies. Existing encryption methods depend for their security on unproven assumptions. We propose a new model, the limited access model for enabling a simple and practical provably unbreakable encryption scheme. A voluntary network of tens of thousands of computers each maintain and update random pages, and act as page server nodes. A sender and receiver share a random key K. They use K to randomly select the same PSNs and download the same random pages. These are employed in groups of say 30 pages to extract one time pads common to S and R. Under reasonable assumptions of an adversary's inability to monitor all PSNs, and easy ways for S and R to evade monitoring while downloading pages, hyper encryption is clearly unbreakable. The system has been completely implemented
[1]
Michael O. Rabin,et al.
Hyper-Encryption and Everlasting Security
,
2002,
STACS.
[2]
Gheorghe Paun,et al.
Current Trends in Theoretical Computer Science: The Challenge of the New Century
,
2004
.
[3]
Ueli Maurer.
Conditionally-perfect secrecy and a provably-secure randomized cipher
,
2004,
Journal of Cryptology.
[4]
Ueli Maurer,et al.
Optimal Randomizer Efficiency in the Bounded-Storage
Model
,
2003,
Journal of Cryptology.
[5]
Yonatan Aumann,et al.
Everlasting security in the bounded storage model
,
2002,
IEEE Trans. Inf. Theory.
[6]
Yonatan Aumann,et al.
Information Theoretically Secure Communication in the Limited Storage Space Model
,
1999,
CRYPTO.