Universal Optimality of Apollonian Cell Encoders
Résumé
Preserving privacy of private communication against an attacker is a fundamental concern of computer science security. Unconditional cryptography considers the case where the attacker has unlimited computational power, hence no complexity result can be used for encryption. This paper introduces Apollonian cell encoders, a class of shared-key cryptosystems that are proven to be universally optimal and have a very compact representation. Conditions for the existence of Apollonian cell encoders are presented, as well as a constructive proof. Contrarily to perfectly secret cryptosytems, Apollonian cell encoders allow for unconditionally secure cryptography while supporting unlimited key reuse.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...