Print ISSN: 1681-6900

Online ISSN: 2412-0758

Keywords : rank


E–Voting System based on Secret Sharing Scheme

N. M. G. Al-Saidi; M. M. Abdulhadi

Engineering and Technology Journal, 2017, Volume 35, Issue 1B, Pages 13-18
DOI: 10.30684/etj.35.1B.3

The electoral process is considered as one of the important and sensitive operations that take place from time to time in all countries of the world and need to be protected. The importance of the electronic voting came because, it provides a maintaining for the secrecy of the vote, as well as, the speed, accuracy and credibility of the vote counts. This is due to the growing of the technology that always needs for electronic process and for new approaches to achieve high security. In this paper, a new E-voting system is designed based on secret sharing scheme. The new protocol is implemented to show its efficiency in terms of computational time and cost.

Construction of a Uniform Access Structure Using Minimum Independent Dominating Vertices

KadhimA. Kadhim; Nadia M.G.Al-Saidi; Nuha A. Rajab

Engineering and Technology Journal, 2014, Volume 32, Issue 5, Pages 966-979
DOI: 10.30684/etj.32.5B.13

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.