A Secure Homomorphic Routing Technique in Wireless Mesh Network (HRT for WMN) Geetanjali Rathee1 , Hemraj Saini1
1
Jaypee University of Information Technology, Computer Science Department, Waknaghat, Solan, Himachal Pradesh, India {
[email protected], hemraj1977 @yahoo.co.in}
Abstract. As Wireless Mesh Network (WMN) is deliberated as a key technology in today’s networking era, security during designing of such system plays a significant role. A number of techniques have been proposed by several researchers in order to provide the security, but leads to certain vulnerability, i.e. active attacks, computational overhead, network congestion and encryption/decryption timing delay. In order to overcome against such drawbacks this manuscript gives a novel technique based on homomorphic encryption (HE). Homomorphic encryption is a technique employed to heighten the security using algebraic operations without increasing the traffic; computational overhead. The suggested technique is evaluated against encryption/decryption parameter and proves the efficiency in comparison of existing protocols. Keywords: Wireless Mesh Network, Homomorphic encryption, Routing Protocol, Authentication, Security
1 Introduction WMN [1], a combination of Ad hoc and mesh networks have two sorts of nodes i.e. mesh router and mesh client. Mesh routers are those through which network services are accessed while mesh clients are those who utilized the network services accessed from mesh routers. There exist certain benefits of WMN i) self –configured, self-healing and self-organizing characteristic (which does not require a system administration to tell how to get the message), multi hop characteristic (in which a message can be conveyed through multiple nodes). The architecture of WMN is basically divided into three types, i.e. i) client WMN, ii) infrastructure WMN and iii) hybrid WMN. The depicted figure 1 shows the hybrid WMN architecture. Due to the dynamic nature of WMN, security [2,3] is taken to be an important parameter. In general, security is the state of being free from hazard or an attack. Because of multi hop environment and wireless media, a number of attacks can be performed by an attacker during the transmission. In order to reduce the attacks and computational overhead, communication must be carried out with minimum number of steps. The paper is divided into five sections. Section 2 discussed the related work. The proposed approach is explained in section three. The comparative study of the suggested approach is evaluated against existing technique in section four. Finally section five concludes the paper.
Fig. 1 key distribution and inter cluster communication
2 Related work This section discusses various existing routing protocols. Researchers have proposed numerous solutions [4,5] in order to enhance the security in WMN. A brief summary of existing approach is presented in table 1. In section 2.1, one of the existing approach i.e. TAODV routing protocol is discussed in detail. 2.1 TAODV Routing Protocol Initially, each MR and MC needs to register itself to a certificate authority (CA) from which they may get the cryptographic details and generate their own public or private keys. Let source node S wants to communicate with destination node d. Source S will get contact to its Authentication Server. AS identifies the client by checking its certificate and issuing a ticket for source node S. After that node S will send the message by attaching its ticket after encrypting with its private key. Each intermediate node will verify the certificate by detaching the previous ticket and forward the message by attaching its own ticket. As the message is reached to a destination node, it will read the message by detaching its previous node ticket. But the major drawback of this protocol is computational overhead (as each time MR or MC will contact with AS to get the certificate), length of the message is very high. In order to reduce the listed drawbacks, several techniques may be used (i.e. ID Based cryptography, homomorphic encryption, etc.). In our proposed approach, homomorphic encryption technique is considered.
Table 1. Comparative analysis of previous proposed protocols Protocol PANA[6] LHAP[7] AKES[8] TAODV[9]
3
Technique Authenticate clients based on IP protocols Authenticate hop by hop
Drawback Increase network congestion Increased computational overhead Polynomial based Increase communication authentication steps Authentication using third Asymmetric coding, third party participation party involvement
Possible attack Active attack Spoofing attack, eavesdrop attack Spoofing attack Eavesdrop attacks
Proposed System
Homomorphic encryption [10,11] is into and onto mapping of algebraic operations performed over plaintext. It is used during the message encryption in order to ensure the security. 3.1 Homomorphic Technique In this manuscript, we have used a gray code converter which is used to cipher text a binary coded file. The process of cipher text generation is shown in figure 2. For encrypting the message, binary coded file will be converted into gray code so that the original file may not be accessible. At the destination node, a reverse process will be followed to get the original plaintext.
Fig. 2 Homomorphic Conversion
3.2 Homomorphic Routing Technique The entire network is divided into several domains. Each domain has its own domain server in order to reduce the computational overhead. Domain server has a direct contact with main server for accessing the network services.
Fig. 3 Homomorphic Routing Technique Let Mesh Client MC 1 wants to communicate with Mesh Client MC 2 (as depicted in figure 3), and then following steps will be performed: 1. Mesh Client MC 1 will contact with its domain server. 2. A Domain server will generate pu/pr keys for both MC 1 and MC 2 and correspondingly send the Pu keys to both the clients. 3. By getting the public key form domain server. MC 1 and MC 2 exchange their public keys to generate their private keys. 4. The message will be converted into binary form by using, the type cast operation (i.e. character to decimal, decimal to binary). 5. In this the binary form of the message will convert into the gray code through gray code converter. 6. Mesh Client MC 1 will send the cipher text message by attaching its private key to MC 2. The diagrammatic step is shown in figure 3. By using the above six steps, the message M will reach to the destination node in encryption form, then destination node will follow its reverse order to get the original plaintext.
4 Performance Evaluation The proposed approach is evaluated against encryption, decryption time parameter and proved the efficiency against previous approach.
4.1 Encryption Time
It is defined as how much time an algorithm takes to encrypt the message. The process of encryption is depicted in figure 4.
Fig. 4 Encryption Process The depicted figure 5 shows that the encryption time of the proposed approach is increased at a constant rate while TADOV encryption time is increased at the exponential rate as the size of the file increases.
Fig. 5 Encryption Timing Graph
4.2 Decryption Time
It is measured at the destination node. The time taken by decryption is always less than an encryption file as there is no need to write the entire file into an array and do the typecasting. The comparisons chart of decryption is shown in figure 6.
Fig. 6 Decryption Timing Graph
6 Conclusion In order to enhance the security with reduced computational overhead, a new algebraic technique is encountered i.e. homomorphic encryption in routing. To prove the authenticity, the proposed approach is evaluated over encryption, decryption parameters and shows the comparison chart against TADOV routing protocol.
Reference [1].Akyildiz, Ian F., and Xudong Wang.A survey on wireless mesh networks. In; IEEE conference on Communications Magazine, 43(9); 2005. [2]. A. A. Franklin and C. S. R. Murthy. An introduction to wireless mesh networks. Security in Wireless Mesh Networks(book chapter), CRC Press,USA;2007.
[3].Ben Salem, N. & Hubaux, J.-P.:Securing Wireless Mesh Networks. In:, IEEE Wireless Communication, 13(2), pp. 50-55, 2006. [4].J. Sen, N. Funabiki et al. Secure routing in wireless mesh networks. Wireless Mesh Networks (book chapter), INTECH, Croatia; 2011. [5].Cheikhrouhou, O.; Maknavicius, M. & Chaouchi, H.: Security Architecture in a Multi-Hop Mesh Network. In:, Proceedings of the 5th Conference on Security Architecture Research(SAR), Seignosse-Landes,2006. [6]. Parthasarathy, Mohan. "Protocol for carrying authentication and network access (PANA) threat analysis and security requirements." 2005. [7]. Zhu, Sencun, et al. "LHAP: a lightweight hop-by-hop authentication protocol for ad-hoc networks." Distributed Computing Systems Workshops, 2003. Proceedings. 23rd International Conference on. IEEE, 2003.
[8] He, Bing, et al. "An efficient authenticated key establishment scheme for wireless mesh networks." Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE. IEEE, 2010. [9]. Uddin, Mueen, et al. "Improving performance of mobile Ad Hoc networks using efficient tactical On demand distance vector (TAODV) routing algorithm." International Journal of Innovative Computing, Information and Control (IJICIC) ,pp. 4375-4389, 8(6) 2012. [10]. Ogburn, Monique, Claude Turner, and Pushkar Dahal. "Homomorphic encryption." Procedia Computer Science 20, pp. 502-509, 2013. [11]. Singh, Vineet Kumar, and Maitreyee Dutta. "Secure Cloud Network using Partial Homomorphic Algorithms." International Journal of Advanced Research in Computer Science 5.5, 2014.
