How to Find New Characteristic-Dependent Linear Rank Inequalities using Secret Sharing

10/29/2021
by   Victor Peña-Macias, et al.
0

Determining information ratios of access structures is an important problem in secret sharing. Information inequalities and linear rank inequalities play an important role for proving bounds. Characteristic-dependent linear rank inequalities are rank inequalities which are true over vector spaces with specific field characteristic. In this paper, using ideas of secret sharing, we show a theorem that produces characteristic-dependent linear rank inequalities. These inequalities can be used for getting lower bounds on information ratios in linear secret sharing.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/19/2020

Common Information, Matroid Representation, and Secret Sharing for Matroid Ports

Linear information and rank inequalities as, for instance, Ingleton ineq...
research
04/29/2019

How to Find New Characteristic-Dependent Linear Rank Inequalities using Binary Matrices as a Guide

In Linear Algebra over finite fields, a characteristic-dependent linear ...
research
01/27/2022

Symmetries in Linear Programming for Information Inequalities

We study the properties of secret sharing schemes, where a random secret...
research
03/27/2019

Characteristic-Dependent Linear Rank Inequalities via Complementary Vector Spaces

A characteristic-dependent linear rank inequality is a linear inequality...
research
04/28/2023

Randomness Requirements for Three-Secret Sharing

We study a secret sharing problem with three secrets where the secrets a...
research
01/22/2019

How to Use Undiscovered Information Inequalities: Direct Applications of the Copy Lemma

We discuss linear programming techniques that help to deduce corollaries...
research
08/31/2006

One method for proving inequalities by computer

In this article we consider a method for proving a class of analytical i...

Please sign up or login with your details

Forgot password? Click here to reset