Hyper-encryption

Hyper-encryption is a form of <a href="/facts/Encryption/16q29Fdv">encryption</a> invented by <a href="/facts/Michael_O._Rabin/M6NHIb5J">Michael O. Rabin</a> which uses a high-bandwidth source of public <a href="/facts/Random/QJQBoEX5">random</a> <a href="/facts/Bit/S972NSaD">bits</a>, together with a <a href="/facts/Secret_key/5W5PAmT4">secret key</a> that is shared by only the sender and recipient(s) of the message. It uses the assumptions of <a href="/facts/Ueli_Maurer_(cryptographer)/QTrE4VAY">Ueli Maurer</a>'s 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 <a href="/facts/One-time_pad/03hA9XSQ">one-time pad</a>, hyper-encryption can be proved to be <a href="/facts/Information-theoretically_secure/DG2q6XeI">information-theoretically secure</a>, 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 <a href="/facts/Krishna_Palem/5pWpL3g3">Krishna Palem</a> et al. using the Probabilistic CMOS or <a href="/facts/PCMOS/yqSxJrvW">PCMOS</a> technology and was shown to be ~205 times more efficient in terms of Energy-Performance-Product.

Hyper-encryption open-in-new

Hyper-encryption