Designing a Graph Anonymization Framework for Secure Packet Transmission in the IP Over Ethernet LAN
DOI:
https://doi.org/10.26438/ijcse/v6i9.650654Keywords:
Encryption, Decryption, IPEL, IPSec, SSL, Graph AnonymizationAbstract
Ethernet Local Area Network (LAN) has become almost omnipresent today. Ethernet has scored over its competitor LAN technologies because of its simplicity, ruggedness and low cost as well as, the advantages it enjoyed owing to its early entry into the LAN market. Despite many research work and development efforts in the area of data communication’s security, the importance of internal local area network LAN security is still underestimated. Ethernet LAN has always been known to be an insecure technology. There is no way in the Ethernet LAN protocol to check the authentication or message integrity. Intruder can hack the IP packet header and create packets with false IP addresses or MAC addresses. In this paper we discuss about the design of a secured packet transport scheme in the IP over Ethernet LAN (IPEL) based on graph anonymization approach. To ensure secure communication, the identity of IP packet source and destination needs to be hidden from intruder. In our proposed scheme each host in the IPEL encrypts the header part of IP packet using graph anonymization algorithm and forwards to the next node. On receiving the packet host performs decryption using graph de-anonymization algorithm to read the packet header. This approach of securing IP packet header offers good scalability, possibly low cost and also promises a reasonable level of security in the IPEL
References
A.S. Tenenbaum,”ComputerNetworks”, 4th Ed., Pearson Education Asea, LPE, 2003.
J.F. Kurose ad K.W. Ross, ”Computer Networking: A Top-Down Approach Featuring the Internet”, 3rd Ed., Pearson Education Asea, LPE,2005.
B. A. Forouzan, "Data Communications ad Networking”, 4th Ed., Tata McGraw-Hill, New Delhi, 2004.
Metcalfe, R.M ad Boggs, D.R, “Ethernet: Distributed Packet Switching for Local Computer Networks”, Communication of the ACM. Vol 19, pp 395-404, July 1976.
C.E. Spurgeon,, “Ethernet-The Definitive Guide”, Orielly/Shroff Publishers & Distributors (India), 2000.
A Leon,-Garcia and I. Widjaja, ”Communication Networks”, 2nd Ed., Tata McGraw-Hill, New Delhi, 2004.
R. Perlman, ”Interconnections: Bridges ad Routers”, Addison Wesley,1994.
L. L. Peterson ad B.S. Davie, ”Computer Networks: A systems Approach”, 3rd Ed. Morgan Kaufman, 2003
D. E. Comer, “Internetworking with TCP/IP Principles, Protocols, and Architecture”, 4th Ed., Prentice-Hall, 2003
W. Stallings, "Network Security Essentials: Application ad Stadards “, 4th Ed.,Pearson Eduction Asea,LPE,2013
J. Katz,Y. Lindell, ”Introduction to modern cryptography” Chapman & Hall/CRC Press, 2007.
N.Deo, ,”Graph Theory with Applications to Engineering and Computer Science”, New Ed, Prentice-Hall, 2003.
C.C. Aggarwal, Y.Li and P.S.Yu, “On the hardness of graph annonymization.” In Proceedings of the 11th IEEE International Conference on Data Mining(ICDN’11),pp 1002-10007,IEEE,2011
K. Liu, , and E. Terzi,. “Towards identity anonymization on graphs”. In SIGMOD Conference (2008), pp. 93–106
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
