Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Universal Optimality of Apollonian Cell Encoders

Fabrizio Biondi 1, 2 Thomas Given-Wilson 2 Axel Legay 2
2 TAMIS - Threat Analysis and Mitigation for Information Security
Inria Rennes – Bretagne Atlantique , IRISA-D4 - LANGAGE ET GÉNIE LOGICIEL
Abstract : Preserving privacy of private communication against an attacker is a fundamental concern of computer science security. Unconditional encryption considers the case where an attacker has unlimited computational power, hence no complexity result can be relied upon for encryption. Optimality criteria are defined for the best possible encryption over a general collection of entropy measures. This paper introduces Apollonian cell encoders, a class of shared-key cryptosystems that are proven to be universally optimal. In addition to the highest possible security for the message, Apollonian cell encoders prove to have perfect secrecy on their key allowing unlimited key reuse. Conditions for the existence of Apollonian cell encoders are presented, as well as a constructive proof. Further, a compact representation of Apollonian cell encoders is presented, allowing for practical implementation.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/hal-01571226
Contributor : Fabrizio Biondi <>
Submitted on : Thursday, February 22, 2018 - 5:13:13 PM
Last modification on : Thursday, January 7, 2021 - 4:40:15 PM

File

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01571226, version 3

Citation

Fabrizio Biondi, Thomas Given-Wilson, Axel Legay. Universal Optimality of Apollonian Cell Encoders. 2018. ⟨hal-01571226v3⟩

Share

Metrics

Record views

432

Files downloads

726