Universal Optimality of Apollonian Cell Encoders - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2017

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.
Fichier principal
Vignette du fichier
main.pdf (242.37 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01571226 , version 1 (01-08-2017)
hal-01571226 , version 2 (16-10-2017)
hal-01571226 , version 3 (22-02-2018)

Identifiants

  • HAL Id : hal-01571226 , version 1

Citer

Fabrizio Biondi, Thomas Given-Wilson, Axel Legay. Universal Optimality of Apollonian Cell Encoders. 2017. ⟨hal-01571226v1⟩
499 Consultations
403 Téléchargements

Partager

Gmail Facebook X LinkedIn More