Information Sharing By Spanning Trees of a Graph By Labelled Sequence as A Key
P. Bala Manoj Kumar1, K. Sai Teja2, A. Manimaran3, G. Deepa4, B. Praba5
1P. Bala Manoj Kumar, Department of Software and Systems, School of Information Technology, VIT, Vellore -632014, India.
2K. Sai Teja, Department of Software and Systems, School of Information Technology, VIT, Vellore, India.
3A. Manimaran, Department of Mathematics, School of Advanced Sciences, VIT, Vellore, India.
4G. Deepa, Department of Mathematics, School of Advanced Sciences, VIT, Vellore – 632014, India.
5B. Praba, SSN College of Engineering, Chennai.
Manuscript received on 2 August 2019. | Revised Manuscript received on 8 August 2019. | Manuscript published on 30 September 2019. | PP: 3498-3503 | Volume-8 Issue-3 September 2019 | Retrieval Number: C5249098319/2019©BEIESP | DOI: 10.35940/ijrte.C5249.098319
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Keeping the Information Sharing to manage cyber risks as a key, Security Intelligence speaks about secured data every day in today’s world. Hence it is considered that Cyber security is a Data Analytics challenge. For this reason, many researchers were effectively working on privacy protection and Liability protection. As a supporting hand for these global issues to secure data transfer, we propose a method to encrypt and decrypt the messages instantly by spanning trees of a graph with labelled tree sequences.
Keywords: Encryption; Decryption; Spanning Tree; Labelled Sequence; Algorithm
Scope of the Article: Information Retrieval