Generating Tree Decomposition of Graphs with Imperialist Competitive Algorithm for Use in Secret Sharing Scheme

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Rajaati Bavil Olyaei M.; Hooshmandasl M. R.

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF ELECTRONIC AND CYBER DEFENCE Year:2019 | Volume:7 | Issue:3 Page(s): 105-111

Download Full-Text

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion

View:

300

Download:

Cites:

Information Journal Paper

Title

Generating Tree Decomposition of Graphs with Imperialist Competitive Algorithm for Use in Secret Sharing Scheme

Author(s)

Rajaati Bavil Olyaei M. | Hooshmandasl M. R. | Issue Writer Certificate

Keywords

Secret SharingQ1

Edge dominating setQ1

Tree decompositionQ1

Imperialist Competitive Algorithm (ICA)Q1

Abstract

Secret Sharing refers to methods of distributing a secret amongst a group of participants, each of whom is assigned with a share of the secret. The secret can be reconstructed only when a sufficient number, of possibly different types of shares are combined together. Different Secret Sharing methods have been presented, such as Secret Sharing schemes based on dominating set and Edge dominating set. In Edge dominating set method, it is required that all of the Edge dominating sets are obtained for the graph, which is a NP-complete problem. All of the Edge dominating sets can be easily obtained, using Tree decomposition of the graph and dynamic programming. Although generating Tree decomposition of a graph with finite treewidth can be solved in polynomial time, but it is shown to be NP-complete for general graphs. In this paper, to generate Tree decompositions of general graphs, we use the notion of Imperialist Competitive Algorithm (ICA) which can be applied in parallel. Therefore, the proposed method, in addition to being a new method for implementation of the Secret Sharing scheme, can reduce runtime by up to five percent in parallel.

Cites

No record.

References

No record.

Cite

APA: Copy

Rajaati Bavil Olyaei, M., & Hooshmandasl, M. R.. (2019). Generating Tree Decomposition of Graphs with Imperialist Competitive Algorithm for Use in Secret Sharing Scheme. JOURNAL OF ELECTRONIC AND CYBER DEFENCE, 7(3 ), 105-111. SID. https://sid.ir/paper/358314/en

Vancouver: Copy

Rajaati Bavil Olyaei M., Hooshmandasl M. R.. Generating Tree Decomposition of Graphs with Imperialist Competitive Algorithm for Use in Secret Sharing Scheme. JOURNAL OF ELECTRONIC AND CYBER DEFENCE[Internet]. 2019;7(3 ):105-111. Available from: https://sid.ir/paper/358314/en

IEEE: Copy

M. Rajaati Bavil Olyaei, and M. R. Hooshmandasl, “Generating Tree Decomposition of Graphs with Imperialist Competitive Algorithm for Use in Secret Sharing Scheme,” JOURNAL OF ELECTRONIC AND CYBER DEFENCE, vol. 7, no. 3 , pp. 105–111, 2019, [Online]. Available: https://sid.ir/paper/358314/en

Related Journal Papers