论文标题
使用Matroid理论隐藏信息
Information Hiding Using Matroid Theory
论文作者
论文摘要
受到私人信息检索问题的启发,我们考虑了两个用户需要建立通信协议以传输秘密而不将其透露给外部观察者的设置。这是一个问题,即在需要在坐标集集合中同意规定的代码时,线性代码的大小。我们展示了这种协议的效率如何取决于基础线性通信代码的衍生曲线。此外,我们提供了几种足够的组合条件,以便何时无法进行秘密传播。
Inspired by problems in Private Information Retrieval, we consider the setting where two users need to establish a communication protocol to transmit a secret without revealing it to external observers. This is a question of how large a linear code can be, when it is required to agree with a prescribed code on a collection of coordinate sets. We show how the efficiency of such a protocol is determined by the derived matroid of the underlying linear communication code. Furthermore, we provide several sufficient combinatorial conditions for when no secret transmission is possible.