MKMohammad Ekramul Kabir

Mohammad Ekramul Kabir

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Mohammad Ekramul Kabir has a total of 24 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Cross-Level Security Verification for Network Functions Virtualization (NFV)

    by Alaa Oqaily, Mohammad Ekramul Kabir, Lingyu Wang, Yosr Jarraya, Suryadipta Majumdar, Makan Pourzandi, Mourad Debbabi, Sudershan L T, Mengyuan Zhang

    Network Functions Virtualization (NFV) is a popular solution for providing multi-tenant network services on top of existing cloud infrastructures in an agile and cost-effective manner. However, as NFV employs multiple levels of virtualization, it also introduces novel security challenges, such as cloud-level security breaches that are invisible to NFV-level tenants. Towards verifying the security of NFV across all the levels (a.k.a. cross-level security verification), existing solutions are mostly insufficient, as each such solution typically only focuses on one specific level (e.g., cloud, SDN, or SFC), and verifying every level separately would be expensive or even infeasible. In this paper, we propose an efficient and practical system, NFVGuard+ , for cross-level security verification for NFV. Particularly, the efficiency of NFVGuard+ is achieved by first performing the costly security verification at one level, and then extrapolating the verification result to other levels through conducting relatively lightweight consistency checks. Additionally, the practicality of NFVGuard+ is ensured by automating the essential steps (e.g., identifying security properties, collecting verification data, and conducting verification) based on a novel Entity-Relationship (ER) model of NFV stack, integrating the approach with OpenStack/Tacker (a popular choice for an NFV deployment), and finally evaluating its effectiveness using both synthetic and real data.


  • ACE-WARP: A Cost-Effective Approach to Proactive and Non-Disruptive Incident Response in Kubernetes Clusters

    by Sima Bagheri, Hugo Kermabon-Bobinnec, Mohammad Ekramul Kabir, Suryadipta Majumdar, Lingyu Wang, Yosr Jarraya, Boubakr Nour, Makan Pourzandi

    A large-scale cluster of containers managed with an orchestrator like Kubernetes are behind many cloud-native applications today. However, the weaker isolation provided by containers means attackers can potentially exploit a vulnerable container and then escape its isolation to cause more severe damages to the underlying infrastructure and its hosted applications. Defending against such an attack using existing attack detection solutions can be challenging. Due to the well known high false positive rate of such solutions, taking aggressive actions upon every alert can lead to unacceptable service disruption. On the other hand, waiting for security administrators to perform in-depth analysis and validation could render the mitigation too late to prevent irreversible damages. In this paper, we propose ACE-WARP, a cost-effective proactive and non-disruptive incident response to address such security challenges for Kubernetes clusters. First, our approach is proactive in the sense that it performs mitigation based on predicted (instead of real) attacks, which prevents irreversible damages. Second, our approach is also non-disruptive since the mitigation is achieved through live migration of containers, which causes no service disruption even in the case of false positives. Finally, to realize the full potential of this approach in containers migration, we formulate the inherent trade-off between security and cost (delay) as a multi-objective optimization problem. Our evaluation results show that ACE-WARP can successfully mitigate up to 81% of the attacks, and our optimization algorithm achieves up to 30% more threat reduction and 7% less delay while being 37 times faster compared to a standard optimization solution.


  • iCAT+: An Interactive Customizable Anonymization Tool Using Automated Translation Through Deep Learning

    by Momen Oqaily, Mohammad Ekramul Kabir, Suryadipta Majumdar, Yosr Jarraya, Mengyuan Zhang, Makan Pourzandi, Lingyu Wang, Mourad Debbabi

    Data anonymization is a viable solution for data owners to mitigate their privacy concerns. However, existing data anonymization tools are inflexible to support various privacy and utility requirements of both data owners and data users. In most cases, this limitation is due to a lack of understanding of those requirements as well as the non-customizability of the existing tools. To address this limitation, we propose iCAT+ , which is an interactive and customizable anonymization approach. More specifically, we first automate the interpretation of data owners' and data users' textual requirements by deploying a Convolutional Neural Network (CNN) model for Natural Language Processing (NLP). Second, we introduce the concept of the anonymization space to model possible combinations of per-attribute anonymization primitives based on the level of privacy and utility that each primitive provides. Third, we design an ontology model that maps the translated requirements into their appropriate anonymization primitives in the defined anonymization space corresponding to the plain data. Fourth, we evaluate the efficiency and effectiveness of iCAT+ based on both real and synthetic network data. Finally, we assess its usability through a real user study involving participants from industry and research laboratories. Our experiments show the effectiveness and efficiency of our solution (e.g., requirement translation accuracy of 99% at the data owner side and 98% at the data user side, with a computational time of around one minute for the Google cluster dataset).


  • Open Access

    A Tenant-based Two-stage Approach to Auditing the Integrity of Virtual Network Function Chains Hosted on Third-Party Clouds

    by Momen Oqaily, Suryadipta Majumdar, Lingyu Wang, Mohammad Ekramul Kabir, Yosr Jarraya, A S M Asadujjaman, Makan Pourzandi, Mourad Debbabi

    There is a growing trend of hosting chains of Virtual Network Functions (VNFs) on third-party clouds for more cost-effective deployment. However, the multi-actor nature of such a deployment may allow a mismatch to silently arise between tenant-level specifications of VNF chains and their cloud provider-level deployment. Most existing auditing approaches would face difficulties in identifying such an integrity breach. First, relying on the cloud provider may not be sufficient, since modifications made by a stealthy attacker may seem legitimate to the provider. Second, the tenant cannot directly perform the auditing due to limited access to the provider-level data. In addition, shipping such data to the tenant would incur prohibitive overhead and confidentiality concerns. In this paper, we design a tenant-based, two-stage solution where the first stage leverages tenant-level side-channel information to identify suspected integrity breaches, and then the second stage automatically identifies and anonymizes selected provider-level data for the tenant to verify the suspected breaches from the first stage. The key advantages of our solution are: (i) the first stage gives tenants more control and transparency (with the capability of identifying integrity breaches without the provider's assistance), and (ii) the second stage provides tenants higher accuracy (with the capability of rigorous verification based on provider-level data). Our solution is integrated into OpenStack/Tacker (a popular choice for NFV deployment), and its effectiveness is demonstrated via experiments (e.g., up to 90% accuracy with the first stage alone).


  • Open Access

    Coordinated Charging and Discharging of Electric Vehicles: A New Class of Switching Attacks

    by Mohsen Ghafouri, Ekram Kabir, Bassam Moussa, Chadi Assi

    In this work, we investigate that the abundance of Electric Vehicles (EVs) can be exploited to target the stability of the power grid. Through a cyber attack that compromises a lot of available EVs and their charging infrastructure, we present a realistic coordinated switching attack that initiates inter-area oscillations between different areas of the power grid. The threat model as well as linearized state-space representation of the grid are formulated to illustrate possible consequences of the attack. Two variations of switching attack are considered, namely, switching of EV charging and discharging power into the grid. Moreover, two possible attack strategies are also considered (i) using an insider to reveal the accurate system parameters and (ii) using reconnaissance activities in the absence of the grid parameters. In the former strategy, the system equations are used to compute the required knowledge to launch the attack. However, a stealthy system identification technique, which is tailored based on Eigenvalue Realization Algorithm (ERA), is proposed in latter strategy to calculate the required data for attack execution. The two-area Kundur, 39-Bus New England, and the Australian 5-area power grids are used to demonstrate the attack strategies and their consequences. The collected results demonstrate that by manipulation of EV charging stations and launching a coordinated switching attack to those portions of load, inter-area oscillations can be initiated. Finally, to protect the grid from this anticipated attack, a Support Vector Machine (SVM) based framework is proposed to detect and eliminate this attack even before being executed.


  • Assisting Residential Distribution Grids in Overcoming Large-Scale EV Preconditioning Load

    by Joseph Antoun, Mohammad Ekramul Kabir, Ribal Atallah, Bassam Moussa, Mohsen Ghafouri, Chadi Assi

    The repercussion of increased electric vehicle (EV) charging demand is notable at the distribution grid especially during the cold morning, while users tend to precondition their vehicles before leaving their premises. Moreover, due to the price declination, a tendency of installing level 2 chargers in residential premises is anticipated, which should stimulate the appearance of a new peak to the residential load profile. Hence, multiple scenarios of preconditioning are simulated, and the corresponding network’s quality metrics (e.g., voltage level and power losses) are assessed to analyze the impact. And a remarkable consequence is observed. As a consequence, to mitigate the consequences and manage the new peak load, the optimal reconfiguration of network is implemented, and unfortunately, with a larger number of EVs, this technique fails to attain the minimum voltage level. Therefore, leveraging this high number of EVs, instead of relying on the network reconfiguration, power is assumed to be injected from idle EVs through vehicle-to-grid (V2G) energy transmission. An integer linear program is formed to schedule a set of EVs in participating in V2G, and the outcome indicates that V2G alone could not compensate for the disturbance in the network. Accordingly, a hybrid method of V2G and reconfiguration is proposed and evaluated to assist the network in handling the new peak load, and this hybrid solution reduces power losses in the network by 50% on average and maintains the voltage level above the operational threshold of 0.95 p.u.


  • A Data Driven Performance Analysis Approach for Enhancing the QoS of Public Charging Stations

    by Joseph Antoun, Mohammad Ekramul Kabir, Ribal F. Atallah, Chadi Assi

    The gaining momentum of Electric Vehicles’ (EV) market is hindered mainly due to the range anxiety. Accordingly, a ubiquitous charging station (CS) network is becoming indispensable. However, due to the lack of reservations or check-in policies in EV charging, users and operators are not provided proper information regarding waiting time at public CSs. This renders users reluctant to use public CSs. In addition, this incomplete information, creates difficulties in the deployment and operation of CSs. Evidently, there is a need to improve the Quality-of-Service (QoS) such as minimizing the waiting time or blocking probability. Therefore, CS owners rely during the designing stage on some theoretical distribution for the associated parameters assumption ( i.e. , battery capacity, charging demand, charging time, waiting time, etc.). To alleviate this situation, instead of depending on theoretical assumptions, real CSs usage data for EV charging are analyzed to acquire data driven distributions. Moreover, since the charging rate is dependent on the State of Charge (SoC), instead of a constant charging rate, a SoC dependent charging model based on real experimental data is proposed and evaluated with real data. Finally, exploiting the acquired distributions and charging model, variations of the $M/G/k$ queuing system to approximate the waiting time, reneging probability and blocking probability is implemented. A detailed simulation is placed and the findings provide a direction for CS owners in determining the capacity ( i.e. , number of outlets) or parking area size to enhance the QoS.


  • A Two-Stage Protection Method for Detection and Mitigation of Coordinated EVSE Switching Attacks

    by Mohammad Ekramul Kabir, Mohsen Ghafouri, Bassam Moussa, Chadi Assi

    The new surge of interest towards mass integration of Electric Vehicles (EVs) in distribution smart grids can expose the high-voltage grid to instability conditions, for instance, through cyber threats initiated from the residential or public EV Supply Equipment (EVSE). This paper (i) investigates the impact of switching attacks on EV charging infrastructure and their impacts on the inter-area stability of the transmission grid, and (ii) proposes a two-stage detection and mitigation technique for those attacks. Initially, we demonstrate that leveraging the existing vulnerabilities in charging stations' cyberspace and the topology of the grid, an adversary can switch the injected or absorbed power of EVs with inter-area frequency and cause a blackout by destabilizing the angular speed of the grid's generators. Then, a Back Propagation Neural Network (BPNN) scheme is designed and hosted at the central management system (CMS) of a public EVSE network. Using this BPNN scheme, the switching attacks are accurately detected by analyzing the features of charging/discharging requests. Moreover, the detected attacks are mitigated by delaying or discarding the request execution. Finally, to cope with the conditions where the residential chargers are under-attack, or when the BPNN fails to provide accurate detection, a wide area H ∞ controller is designed to keep the angular speed of the synchronous generators within the acceptable limits. The effectiveness of the proposed techniques is evaluated using two-area Kundur and 5-area Australian grids.


  • Joint Routing and Scheduling of Mobile Charging Infrastructure for V2V Energy Transfer

    by Mohammad Ekramul Kabir, Ibrahim Sorkhoh, Bassam Moussa, Chadi Assi

    An adequate charging infrastructure advocates to ameliorate the range anxiety to propel the disparaged electric vehicle (EV) market. But, the high initial installation cost, requirement of suitable places and the anticipated immense load on the grid during peak times hinder to elongate the charging station network, especially in urban areas. Fortunately, the bidirectional energy transferring capability between vehicles (i.e., V2V) may act as an auxiliary solution to charge an EV at any place and at any time without leaning on a stationary charging infrastructure. In this work, we assume a market where charging providers each has a number of charging trucks equipped with a larger battery and a fast charger to charge a number of EVs at some particular parking lots. A provider intends to maximize the served number of EVs using its limited number of charging trucks, when an EV should be considered as served only if it would be fully charged during its declared charging window. All charging requests are assumed to be received by an agent which provisions a route and schedule for each charging truck and all trucks should return to the depot after serving EVs. We formulate this combinatorially hard problem as an integer linear program (ILP) to maximize the number of served EVs by determining the optimal trajectory of each truck. Owing to its complexity, we present a solution methodology by decomposing the problem using Dantzig-Wolfe decomposition approach; we divide the problem into one master problem and a set of pricing problems (one for each EV) and achieve the solution iteratively. Though the solution achieved from the decomposition might not be optimal, it is faster to be applicable in practice. We also compare the performance with two heuristic algorithms and report on the collected results.


  • Demand-Aware Provisioning of Electric Vehicles Fast Charging Infrastructure

    by Mohammad Ekramul Kabir, Chadi Assi, Hyame Alameddine, Joseph Antoun, Jun Yan, Maurice Antoun

    The concept of smart city urges for green technology to reduce carbon emission to ameliorate the global warming. Following this footprint, transportation sector is experiencing a paradigm shift and the transition to electric vehicles (EVs) has prodigious plausibility in reducing carbon emission. However, the anticipated EV penetration is hindered by several challenges, among them are their shorter driving range, slower charging rate and the lack of ubiquitous availability of charging locations, which collectively contribute to range anxieties for EVs drivers. Meanwhile, the expected immense EV load onto the power distribution network may compromise the power quality. To reduce the range anxiety, we present a two-stage solution to provision and dimension a DC fast charging station (CS) network that minimizes the deployment cost while ensuring a certain quality of experience for charging e.g., acceptable waiting times and shorter travel distances to charge. This solution also maintains the power quality by considering the distribution grid capacity, determining transformers' rating to support peak demand of EV charging and adding a minimum number of voltage regulators based on the impact over the power distribution network. We propose, evaluate and compare two CS network expansion models to determine a cost-effective and adaptive CSs provisioning solution that can efficiently expand the CS network to accommodate future EV charging and conventional load demands. We also propose two heuristic methods and compare our solution with them. Finally, a custom built Python-based discrete event simulator is developed to test our outcomes.