Towards Attack and Defense Views of Rational Delegation of Computation

Abstract

Rational delegation of computation is an important technology of mobile Internet at present, which is significant to the construction of intelligent urban computing. In order to close to practical applications, many tasks need cooperation with edge computing and cloud computing. The delegated computation scheme with rational players guarantees the reliability of the calculation results by the utility function. This paper studies the rational delegation of computation and the security attack-defense from attack and defense. Combining with the concept of average mutual information in information theory, this paper presents the attack and defense model for rationally delegating the computation. The main method of modeling is to convert the attack or defense of rationally delegated computation into communication problems in information theory and construct the attack channel and defense channel for the client and the calculator respectively. The channel capacity of the attack channel represents the attack capacity limitation of the adversary in the delegated computing environment, and that of the defense channel denotes the defense capacity limitation of clients in the delegated computation. Then, we discuss the relationship between attack limitation and defense limitation, and it shows that there are different strengths and weaknesses between the calculator and the client under different mixed strategies. Finally, the numerical analysis of experiments demonstrates that the optimal strategy of attack and defense is the strategy when the game between client and calculator reaches the equilibrium point.INDEX TERMS Rational delegation computation, mixed strategy Nash equilibrium, channel capacity, capacity limitation of attack and defense.

An incentive-compatible rational secret sharing scheme using blockchain and smart contract

“…One future direction would be to extend our scheme to rational delegation of computation such as [27], which may lead to more complex utility functions and incentive mechanisms, and we can analyze the players's capacity limitation of attack and defense. Another future direction would be to construct a composable scheme.…”

An Efficient Encryption Algorithm for the Security of Sensitive Private Information in Cyber-Physical Systems

“…Dealing with individual user data: assuming that ∆v represents the infinitesimal of interference, it can only be shared as a region, and the length of the quantization is L, thus I th = L∆v. Equation (10) can be simplified into L, and the infinitesimal ∆v of interference can be divided into the largest objective function [27][28][29][30]. Let l ∈ {1.2.…”

GLIDE: A Game Theory and Data-Driven Mimicking Linkage Intrusion Detection for Edge Computing Networks

“…e essence of network attack and defence confrontation is to detect, monitor, and promptly leverage defence mechanisms to interfere with or block attacks [1]. e attacks of the traditional edge computing network target active defence techniques, which can be mitigated to avoid data theft or data tampering by abnormal detection [2][3][4][5]. However, it cannot solve the problem of ubiquitous intrusion monitoring identification in edge computing networks.…”

“…erefore, the existing secure transmission technology generally belongs to the passive defence technology, which cannot actively avoid or suppress network attack behaviours and cannot meet the needs of security in edge computing networks. (3) In terms of network attack detection, the current research studies of mainstream intrusion detection for edge computing networks are focused on anomaly detection. Deep learning techniques are used to build behaviour models of edge computing networks and to detect and identify various types of network attacks based on model deviations.…”