SUM GRAPH BASED ACCESS STRUCTURE IN A SECRET SHARING SCHEME

Secret sharing scheme is a method to distribute secret information to a set P of participants so that only authorised subsets of P can reconstruct the secret. A set of subsets of P that can reconstruct the secret is called an access structure of the scheme. A simple undirected graph G is called a sum graph if there exists a labeling L of the vertices of G into distinct numbers, usually positive integers, such that any two distinct vertices u and v of G are adjacent if and only if there is a vertex w whose label is L(w) = L(u) + L(v). In this paper, we will show how sum labeling can be used for representing the graphs of the access structures of a secret sharing scheme. We will combine a known secret sharing scheme such as the classical Shamir scheme with a graph access structure represented using sum graph labeling to obtain a new secret sharing scheme.