Perfect Secrecy under Deep Random assumption
This addresses the fundamental problem of secure communication for parties without prior shared secrets, proposing a new paradigm that could impact cryptography and information theory.
The authors tackled the problem of designing a perfectly secure information exchange protocol without shared private information, achieving secret information exchange with accuracy close to perfection and knowledge close to zero for any opponent, beyond the Shannon limit.
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.