Perfect Secrecy under Deep Random assumption
Abstract
We present a new idea to design perfectly secure information exchange protocol, based on so called Deep Randomness, which means randomness relying on hidden probability distribution. Such idea drives us to introduce a new axiom in probability theory, thanks to which we can design a protocol, beyond Shannon limit, enabling two legitimate partners, sharing originally no common private information, to exchange secret information with accuracy as close as desired from perfection, and knowledge as close as desired from zero by any unlimitedly powered opponent.
Cite
@article{arxiv.1507.08258,
title = {Perfect Secrecy under Deep Random assumption},
author = {Thibault de Valroger},
journal= {arXiv preprint arXiv:1507.08258},
year = {2019}
}
Comments
30 pages main and 48 pages annex. V12: A more accurate proof of Theorem 1 is given, where Advantage Distillation is proved without the use of Maurer error correcting technique. Addition of a more precise and more efficient method to generate recursively each new distribution in the Deep Random Generator described in section 4