Information Hiding Using Matroid Theory

DOI10.1016/J.AAM.2021.102205MaRDI QIDQ6348560arXivFDO

Authors Ragnar Freij-Hollanti, O. I. Kuznetsova

Publication date 7 September 2020

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.AAM.2021.102205

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

arXiv classification

cs.ITmath.COmath.IT

Abstract: 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.

This page was built for publication: Information Hiding Using Matroid Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6348560)