Hyper Encryption and Everlasting Secrets

Abstract

A fundamental problem in cryptography is that of secure communication over an insecure channel, where a sender Alice wishes to communicate with a receiver Bob, in the presence of a powerful Adversary $\mathcal{A}\mathcal{D}$. The primary goal of encryption is to protect the privacy of the conversation between Alice and Bob against $\mathcal{A}\mathcal{D}$ . Modern cryptographic research has identified additional essentially important criteria for a secure encryption scheme. Namely that the encryption be non-malleable, be resistant to various chosen plaintext and ciphertext attacks, and if so desired, will allow the receiver to authenticate the received message and its sender. All these issues are now settled for the case that the Adversary $\mathcal{A}\mathcal{D}$ is computationally unbounded.