Visible to the public Biblio

Filters: Author is Kazemi, M.  [Clear All Filters]
Kazemi, M., Delavar, M., Mohajeri, J., Salmasizadeh, M..  2018.  On the Security of an Efficient Anonymous Authentication with Conditional Privacy-Preserving Scheme for Vehicular Ad Hoc Networks. Iranian Conference on Electrical Engineering (ICEE). :510–514.

Design of anonymous authentication scheme is one of the most important challenges in Vehicular Ad hoc Networks (VANET). Most of the existing schemes have high computational and communication overhead and they do not meet security requirements. Recently, Azees et al. have introduced an Efficient Anonymous Authentication with Conditional Privacy-Preserving (EAAP) scheme for VANET and claimed that it is secure. In this paper, we show that this protocol is vulnerable against replay attack, impersonation attack and message modification attack. Also, we show that the messages sent by a vehicle are linkable. Therefore, an adversary can easily track the vehicles. In addition, it is shown that vehicles face with some problems when they enter in a new Trusted Authority (TA) range. As a solution, we propose a new authentication protocol which is more secure than EAAP protocol without increasing its computational and communication overhead.

Jalili, A., Ahmadi, V., Keshtgari, M., Kazemi, M..  2015.  Controller placement in software-defined WAN using multi objective genetic algorithm. 2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI). :656–662.

SDN is a promising architecture that can overcome the challenges facing traditional networks. SDN enables administrator/operator to build a simpler, customizable, programmable, and manageable network. In software-defined WAN deployments, multiple controllers are often needed, and the location of these controllers affect various metrics. Since these metrics conflict each other, this problem can be regarded as a multi-objective combinatorial optimization problem (MOCO). A particular efficient method to solve a typical MOCO, which is used in the relevant literature, is to find the actual Pareto frontier first and give it to the decision maker to select the most appropriate solution(s). In small and medium sized combinatorial problems, evaluating the whole search space and find the exact Pareto frontier may be possible in a reasonable time. However, for large scale problems whose search spaces involves thousands of millions of solutions, the exhaustive evaluation needs a considerable amount of computational efforts and memory used. An effective alternative mechanism is to estimate the original Pareto frontier within a relatively small algorithm's runtime and memory consumption. Heuristic methods, which have been studied well in the literature, proved to be very effective methods in this regards. The second version of the Non-dominated Sorting Genetic Algorithm, called NSGA-II has been carried out quite well on different discrete and continuous optimization problems. In this paper, we adapt this efficient mechanism for a new presented multi-objective model of the control placement problem [7]. The results of implementing the adapted algorithm carried out on the Internet2 OS3E network run on MATLAB 2013b confirmed its effectiveness.

Kazemi, M., Azmi, R..  2014.  Privacy preserving and anonymity in multi sinks wireless sensor networks with master sink. Computing, Communication and Networking Technologies (ICCCNT), 2014 International Conference on. :1-7.

The wireless network is become larger than past. So in the recent years the wireless with multiple sinks is more useful. The anonymity and privacy in this network is a challenge now. In this paper, we propose a new method for anonymity in multi sink wireless sensor network. In this method we use layer encryption to provide source and event privacy and we use a label switching routing method to provide sink anonymity in each cluster. A master sink that is a powerful base station is used to connect sinks to each other.