On sum graph-based access structure In a secret sharing scheme

• Main Authors: De Chavez, David Matthew R., Sebastian, Isiah Wilfred A.
• Format: text
• Language: English
• Published: Animo Repository 2018
• Subjects: Physical Sciences and Mathematics
• Online Access: https://animorepository.dlsu.edu.ph/etd_bachelors/18589
• Institution: De La Salle University

This study is an exposition of the paper by Slamet et al. [8] on a new type of secrete sharing scheme based on an access structure. The authors of this study provided concrete examples where the new secret sharing scheme is applied. Secret sharing scheme is a method to distribute secret information to a set P of participants so that only authorized 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. In the paper by Slamet et al. [8], they used Shamir's secret sharing scheme together with the concept of exclusive sum graph labeling to provide a new secret sharing scheme based on an access structure. A simple undirected graph G is called a sum graph if there exists a labeling L of the vertices of G into distinct 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). A variation of this concept called exclusive sum graph labeling was de ned by Slamet et al. [8]. The survey paper by Gallian [2] provides an overview of the results about sum graphs and exclusive sum graphs. Shamir's secret sharing scheme is a type of secret sharing scheme to distribute the secret, give a share to each participant, and reconstruct the secret using a technique called Lagrange polynomial interpolation [7]. Combining the concepts of Shamir's secret sharing scheme and sum graph labeling, a new secret sharing scheme with a size 2 access structure was formed. Some examples can be found in the paper on the application of this new scheme.