On an infinite family of graphs with information ratio 2 − 1/k

Authors:
László Csirmaz;Péter Ligeti
Affiliations:
Central European University, Budapest, Hungary;Eötvös University, Rényi Institute, Budapest, Hungary
Venue:
Computing - Special Issue on the occasion of the 8th Central European Conference on Cryptography
Year:
2009

Citing 0
Cited 4

An impossibility result on graph secret sharing

Designs, Codes and Cryptography
Decomposition Construction for Secret Sharing Schemes with Graph Access Structures in Polynomial Time

SIAM Journal on Discrete Mathematics
Optimal complexity of secret sharing schemes with four minimal qualified subsets

Designs, Codes and Cryptography
On the optimization of bipartite secret sharing schemes

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider the secret sharing problem on special access structures with minimal qualified subsets of size two, i.e. secret sharing on graphs. This means that the participants are the vertices of the graph and the qualified subsets are the subsets of V(G) spanning at least one edge. The information ratio of a graph G is denoted by R(G) and is defined as the ratio of the greatest size of the shares a vertex has to remember and of the size of the secret. Since the determination of the exact information ratio is a non-trivial problem even for small graphs (i.e. for V(G) = 6), every construction can be of particular interest. Let k be the maximal degree in G. In this paper we prove that R(G) = 2 − 1/k for every graph G with the following properties: (A) every vertex has at most one neighbour of degree one; (B) vertices of degree at least 3 are not connected by an edge; (C) the girth of the graph is at least 6. We prove this by using polyhedral combinatorics arguments and the entropy method.