Provably unbreakable hyper-encryption in the limited access model

@article{Rabin2005ProvablyUH,
  title={Provably unbreakable hyper-encryption in the limited access model},
  author={Michael O. Rabin},
  journal={IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, 2005.},
  year={2005},
  pages={34-37}
}
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… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
11 Citations
8 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Recent developments in extractors (Survey paper),” Current trends in theoretical computer science

  • R. Shaltiel
  • The Challenge of the New Century,
  • 2005
1 Excerpt

Rabin, “Information theoretically secure communication in the limited storage model,

  • M.O.Y. Aumann
  • Advances in Cryptology-Crypto 99, Lectures in…
  • 1999
1 Excerpt

Finger printing by random polynomials,

  • M. O. Rabin
  • Computer Science, DEAS, Harvard University,
  • 1981
2 Excerpts

Similar Papers

Loading similar papers…