Voice over IP (VoIP) is commonly known as phone service over the Internet. Any service using public IP network requires certain extent of security. Demand for security in VOIP technology is increasing. VPN is one of the commonly used methods to secure VOIP traffic. In this paper we simulated behavior of a VOIP communication while running over a GRE VPN Tunnel using OPNET Modeler 17.5. During the simulation, such performance parameters as: choice of voice signaling protocol, voice Codec, parameters arising from network QoS (in this study, homogenous vs. heterogeneous network environment) and type of VPN tunneling protocol, were examined. We evaluated performance of VOIP communications in homogenous and heterogeneous network environments, configured based on two different signaling protocols, namely H.323 and SIP. Also, G.711 and G.723 were configured and tested as the choice for voice Codecs. GRE was implemented as the tunneling protocol. Result analysis of this study indicated that GRE Tunnel didn’t show a significant increase in such call quality of service (QoS) performance factors as: end-to-end delay, call setup time, or a decrease in call MOS value. Even though in a non-ideal (heterogeneous) network environment, call quality of service (QoS) performance factors shoed poor results; however, there was no significant evidence to suggest that GRE Tunnel is the root cause for such poor results.

In the present paper we have proposed a new variant of AES cipher with high level of security and an elegant construction called TIGRIS cipher. The TIGRIS name has been derived from one of the two famous rivers in Iraq. The proposed TIGRIS cipher is a revision for the proposed Euphrates cipher which has already been published. It has been designed with a good coherent structure that is based on solid algebraic and well mathematical opinions. The proposed cipher uses the SPN structure and what is known by the Galois Field GF (28). It is an iterated cipher that has a conservative design which is easily implemented on both hardware and software. It operates with block size of 128-bits and with three variable key lengths of 128-bits, 192-bits and 256-bits in addition to sixteen rounds or multiples of four rounds. The proposed cipher works with good invertible operations’ stages and a compact duplicated ciphering key. The Tigris cipher construction strategy includes the adoption of construction a new S-box with high non-linearity that uses the same routines of the AES-S-box stage but with different modular arithmetic of irreducible polynomial and different affine matrix in addition to the distinct constant vector. The second and the third layers of the proposed model are based on the shifting concept for the confusion and diffusion process with reversible operations. The last layer of the proposed model is the key addition layer that is responsible for the expanding and generating the ciphering key by two directions those of row and column expansion, which are associated with two constant vectors of golden ratio and base nature algorithm as a fixed word to eliminate any weak or semi-weak ciphering key.

Vehicular Ad-hoc Networks is one of the emerging research areas of Mobile ad- hoc network. One of the key problems of VANET is changing topology of vehicles which leads to frequent disconnections. Therefore, for communication among the running vehicles, routing of the message becomes a challenging problem. Although, many routing protocols have been proposed in the literatures, but the performance of these protocols, in different scenarios, depends on the value of parameters used in. The objective of our work is to find best fitness function value for Ad-hoc on demand multipath distance vector routing protocol, in real scenario map by obtaining an optimal value of parameters using Magnetic Optimization Algorithm. Therefore, in this paper, we have proposed an algorithm based on Magnetic Optimization Algorithm which finds the optimal value of parameters for Ad-hoc on demand multipath distance vector routing protocol in a given scenario. The fitness function guides Magnetic Optimization Algorithm to achieve the best fitness value. The experimental results, using the optimal value of parameters obtained by Magnetic Optimization Algorithm, show 81.41% drop in average end-to-end delay, 39.24 % drop in Normalized Routing Loads, and slight rise (0.77%) in the packet delivery ratio as compared to using default value of parameters in Ad-hoc on demand multipath distance vector routing protocol.

This paper presents the performance evaluation of 3G mobile networks for one kind of multimedia application called Voice over IP (VoIP) within Bangkok, the capital city of Thailand, using Line and Skype, two popular VoIP applications. This study used evaluation of voice quality provided by both applications. The tests have been conducted using stationary scenarios over 5 major 3G mobile networks, served by 5 operators, within 14 universities in the inner city of Bangkok in order to gather data of degraded speech files. Then, the data was measured using Perceptual Evaluation of Speech Quality (PESQ) to find Mean Opinion Score (MOS) before analyzing with ANOVA and T-test, which are statistical tools, so that the discussion and conclusion can be eventually derived.

Today, information collectors, particularly statistical organizations, are faced with two conflicting issues. On one hand, according to their natural responsibilities and the increasing demand for the collected data, they are committed to propagate the information more extensively and with higher quality and on the other hand, due to the public concern about the privacy of personal information and the legal responsibility of these organizations in protecting the private information of their users, they should guarantee that while providing all the information to the population, the privacy is reasonably preserved. This issue becomes more crucial when the datasets published by data mining methods are at risk of attribute and identity disclosure attacks. In order to overcome this problem, several approaches, called p-sensitive k-anonymity, p+-sensitive k-anonymity, and (p, α)-sensitive k-anonymity, were proposed. The drawbacks of these methods include the inability to protect micro datasets against attribute disclosure and the high value of the distortion ratio. In order to eliminate these drawbacks, this paper proposes an algorithm that fully protects the propagated micro data against identity and attribute disclosure and significantly reduces the distortion ratio during the anonymity process.

Development of location estimation algorithms with improvement in location precision with lower cost, less energy consumption and less hardware support has become more important for many applications in Wireless Sensor Networks (WSNs). This paper addresses the problem of secure location determination, known as secure localization in WSNs using voting based technique which gives a search region in presence of anchor nodes. From the obtained search region trilateration is applied to know the position of sensor nodes. To avoid the involvement of sensor nodes in further location estimation process, bilateration is applied. Experimental analysis shows that the maximum number of nodes can be localized and accurate location of a node can be determined efficiently with low estimation error. To avoid the attacks and involvement of malicious nodes in the localization process, we implement an improved authentication and security algorithm. Using few location reference points in the localization process reduces the communication cost. The proposed scheme also provides very good localization accuracy.

Field-Programmable Gate Arrays (FPGAs) have turned out to be a well-liked target for implementing cryptographic block ciphers, a well-designed FPGA solution can combine some of the algorithmic flexibility and cost efficiency of an equivalent software implementation with throughputs that are comparable to custom ASIC designs. The recently proposed Secure Force (SF) shows good results in terms of resource utilization compared to older ciphers. SF appears as a promising choice for power and resource constrained secure systems and is well suited to an FPGA implementation. In this paper we explore the design decisions that lead to area/delay tradeoffs in a full loop-unroll implementation of SF-64 on FPGA. This work provides hardware characteristics of SF along with implementation results that are optimal in terms of throughput, latency, power utilization and area efficiency.

The term Phishing is a kind of spoofing website which is used for stealing sensitive and important information of the web user such as online banking passwords, credit card information and user’s password etc. In the phishing attack, the attacker generates the warning message to the user about the security issues, ask for confidential information through phishing emails, ask to update the user’s account information etc. Several experimental design considerations have been proposed earlier to countermeasure the phishing attack. The earlier systems are not giving more than 90 percentage successful results. In some cases, the system tool gives only 50-60 percentage successful result. In this paper, a novel algorithm is developed to check the performance of the anti-phishing system and compared the received data set with the data set of existing anti-phishing tools. The performance evaluation of novel anti-phishing system is studied with four different classification data mining algorithms which are Class Imbalance Problem (CIP), Rule based Classifier (Sequential Covering Algorithm (SCA)), Nearest Neighbour Classification (NNC), Bayesian Classifier (BC) on the data set of phishing and legitimate websites. The proposed system shows less error rate and better performance as compared to other existing system tools.