Key-agreement exists if and only if the "interactive vs non interactive Kolmogorov problem" is not in ioBPP: a short proof
Computational Complexity
2025-04-24 v1 Information Theory
math.IT
Abstract
Ball, Liu, Mazor and Pass proved that the existence of key-agreement protocols is equivalent to the hardness of a certain problem about interactive Kolmogorov complexity. We generalize the statement and give a short proof of the difficult implication.
Cite
@article{arxiv.2504.16311,
title = {Key-agreement exists if and only if the "interactive vs non interactive Kolmogorov problem" is not in ioBPP: a short proof},
author = {Bruno Bauwens and Bruno Loff},
journal= {arXiv preprint arXiv:2504.16311},
year = {2025}
}