# Hyper-encryption

> Mediated Wiki article. Canonical URL: https://mediated.wiki/source/Hyper-encryption
> Markdown URL: https://mediated.wiki/source/Hyper-encryption.md
> Source: https://en.wikipedia.org/wiki/Hyper-encryption
> Source revision: 1267470250
> License: Creative Commons Attribution-ShareAlike 4.0 International (https://creativecommons.org/licenses/by-sa/4.0/)

**Hyper-encryption** is a form of [encryption](/source/Encryption) invented by [Michael O. Rabin](/source/Michael_O._Rabin) which uses a high-bandwidth source of public [random](/source/Random) [bits](/source/Bit), together with a [secret key](/source/Secret_key) that is shared by only the sender and recipient(s) of the message.[1] It uses the assumptions of [Ueli Maurer](/source/Ueli_Maurer_(cryptographer))'s [bounded-storage model](/source/Bounded-storage_model) as the basis of its secrecy. Although everyone can see the data, decryption by adversaries without the secret key is still not feasible, because of the space limitations of storing enough data to mount an attack against the system.

Unlike almost all other cryptosystems except the [one-time pad](/source/One-time_pad), hyper-encryption can be proved to be [information-theoretically secure](/source/Information-theoretically_secure), provided the storage bound cannot be surpassed. Moreover, if the necessary public information cannot be stored at the time of transmission, the plaintext can be shown to be impossible to recover, regardless of the computational capacity available to an adversary in the future, even if they have access to the secret key at that future time.

A highly energy-efficient implementation of a hyper-encryption chip was demonstrated by [Krishna Palem](/source/Krishna_Palem) et al. using the Probabilistic CMOS or [PCMOS](/source/PCMOS) technology and was shown to be ~205 times more efficient in terms of Energy-Performance-Product.[2][3]

## See also

- [Perfect forward secrecy](/source/Perfect_forward_secrecy)
- [Randomness extractor](/source/Randomness_extractor)

## References

1. Rabin, M.O. (2005-10-19). ["Provably unbreakable hyper-encryption in the limited access model"](http://pdfs.semanticscholar.org/40a1/a4beec910bd48add69b9e8cb803a97544828.pdf). *IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, 2005*. pp. 34–37. [doi:10.1109/ITWTPI.2005.1543953](https://doi.org/10.1109/ITWTPI.2005.1543953). ISBN 978-0-7803-9491-9. [S2CID 16850139](https://api.semanticscholar.org/CorpusID:16850139). [Archived](https://web.archive.org/web/20170914013558/http://pdfs.semanticscholar.org/40a1/a4beec910bd48add69b9e8cb803a97544828.pdf) 2017-09-14 at the Wayback Machine. Retrieved 2021-04-30.

1. ["Revolutionary microchip uses 30 times less power"](https://web.archive.org/web/20120218194953/http://www.rice.edu/nationalmedia/news2009-02-08-pcmos.shtml). Rice University. Archived from [the original](http://www.rice.edu/nationalmedia/news2009-02-08-pcmos.shtml) on 2012-02-18. Retrieved 2012-07-28.

1. Lakshmi N. Chakrapani; Bilge E. S. Akgul; Suresh Cheemalavagu; Pinar Korkmaz; Krishna V. Palem; Balasubramanian Seshasayee. ["Ultra Efficient Embedded SOC Architectures based on Probabilistic CMOS (PCMOS) Technology"](https://www.cs.rice.edu/~kvp1/pubs/crest-tech-05-08-02.pdf). Design Automation and Test in Europe Conference (DATE), 2006. [Archived](https://web.archive.org/web/20080425134715/https://www.cs.rice.edu/~kvp1/pubs/crest-tech-05-08-02.pdf) 2008-04-25 at the Wayback Machine.

## Further reading

- Y. Z. Ding and M. O. Rabin. *Hyper-encryption and everlasting security.* In 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 2285 of *Lecture Notes in Computer Science*, pp. 1–26. Springer-Verlag, 2002.
- Jason K. Juang, [Practical Implementation and Analysis of Hyper-Encryption.](http://groups.csail.mit.edu/cis/theses/juang-meng-eecs-2009.pdf) Masters dissertation, MIT Department of Electrical Engineering and Computer Science, 2009-05-22.

## External links

- Lu, Chi-Jen (18–22 August 2002). ["Hyper-Encryption against Space-Bounded Adversaries from On-Line Strong Extractors"](https://www.iacr.org/archive/crypto2002/24420257/24420257.ps). Vol. Advances in Cryptology – CRYPTO '02, Lecture Notes in Computer Science. Springer-Verlag. [Archived](https://web.archive.org/web/20150429212032/https://www.iacr.org/archive/crypto2002/24420257/24420257.ps) 2015-04-29 at the Wayback Machine.
- Dziembowski, Stefan & Maurer, Ueli (May 19, 2002). ["Tight security proofs for the bounded-storage model"](https://web.archive.org/web/20170706132856/ftp://ftp.inf.ethz.ch/pub/crypto/publications/DziMau02.pdf). *Proceedings of the thiry-fourth annual ACM symposium on Theory of computing*. pp. 341–350. [doi:10.1145/509907.509960](https://doi.org/10.1145/509907.509960). ISBN 978-1581134957. [S2CID 11042024](https://api.semanticscholar.org/CorpusID:11042024). Archived from [the original](ftp://ftp.inf.ethz.ch/pub/crypto/publications/DziMau02.pdf) on 2017-07-06.
- [\[1\]](https://web.archive.org/web/20060901193344/http://athome.harvard.edu/dh/hvs.html), video of a lecture by Professor [Michael O. Rabin](/source/Michael_O._Rabin).[dead link]

---
Adapted from the Wikipedia article [Hyper-encryption](https://en.wikipedia.org/wiki/Hyper-encryption) by Wikipedia contributors ([contributor history](https://en.wikipedia.org/wiki/Hyper-encryption?action=history)). Available under [Creative Commons Attribution-ShareAlike 4.0 International](https://creativecommons.org/licenses/by-sa/4.0/). Changes may have been made.