Construction of a Uniform Access Structure Using Minimum Independent Dominating Vertices | ||
| Engineering and Technology Journal | ||
| Article 12, Volume 32, 5B, May 2014, Pages 966-979 PDF (629.85 K) | ||
| DOI: 10.30684/etj.32.5B.13 | ||
| Authors | ||
| KadhimA. Kadhim; Nadia M.G.Al-Saidi; Nuha A. Rajab | ||
| Abstract | ||
| The most important technologies in modern society are the information security; it is founded to provide a protection to the transmitted data. Secret sharing scheme is one of the methods designated to protect the secret data. It is a method that allows a secret to be shared among a set of participants in such a way that only qualified subsets of them can recover the secret by pooling their share together, but no less sets can do that. Many mathematical structures are used to create a secret sharing scheme; the one that based on graph access structure is the most widely used structure. In this paper, a new horizon for the construction of the perfect secret sharing schemes of rank 2 and 3 is opened by proposing of a new algorithm to construct a uniform access structure in a connected, simple, undirected, r-regular graph G.This has been done by introducing for the first time the minimum independent dominating set of vertices in a graph. The efficiency of this method is deduced to prove that the proposed method has an improvement over other previous methods. | ||
| Keywords | ||
| uniform access structure; Minimum Independent Dominating Set; Secret Sharing Scheme; Information Rate; Rank | ||
|
Statistics Article View: 151 PDF Download: 44 |
||