Co-Residence Data Theft Attacks on <i>N</i>-Version Programming-Based Cloud Services With Task Cancelation
Gregory Levitin, Liudong Xing, Yanping Xiang
Abstract
Powered by virtualization, the cloud computing has brought good merits of cost effective and on-demand resource sharing among many users. On the other hand, cloud users face security risks from co-residence attacks when using this virtualized platform. Particularly, a malicious attacker may create side channels to steal data from a target user’s virtual machine (VM) that co-resides with the attacker’s VM on the same physical server. This article models a cloud service undergoing the co-residence data theft attacks. The threshold-voting-based <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${N}$ </tex-math></inline-formula> -version programming (NVP) is implemented to improve the service reliability, where multiple service component versions (SCVs) are activated in parallel to perform the requested service. The final output is determined upon receiving a threshold number of identical outputs from the SCVs, immediately followed by canceling all outstanding SCVs to reduce expenses. Probabilistic models are first introduced to evaluate performance metrics of the considered service, including the data theft probability, service success probability, expected service operation time, and expected utility. Optimization problems are further solved to find the optimal number of SCVs maximizing the expected utility. Interactions among different model parameters and VM allocation policies, as well as their effects on the considered performance metrics and on the optimization solutions are studied through examples.