Delay-CJ: A novel cryptojacking covert attack method based on delayed strategy and its detection

Xu, Guangquan; Dong, Wenyu; Xing, Jun; Lei, Wenqing; Liu, Jian; Gong, Lixiao; Feng, Meiqi; Zheng, Xi; Liu, Shaoying

doi:10.1016/j.dcan.2022.04.030

Cited by 27 publications

(11 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The process of transmitting key information for authentication between

{AG}_j

and

{SM}_i

has been implemented in the simulation. In the simulated environment, the total simulation time is 1500 s. The routing protocol is set to Destination‐Sequenced Distance Vector (DSDV) and the medium access control (MAC) is considered as the standard IEEE 802.11 as in Reference 41. Cell radius is set as 200 m. The SG environments is divided into 19 small cells and the distance between the two AG is set as 300 m.…”

Section: Performance Analysismentioning

confidence: 99%

PSAK: A provably secure authenticated key agreement scheme based on extended Chebyshev chaotic maps for smart grid environments

Wang

Zhou

et al. 2023

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…The process of transmitting key information for authentication between

{AG}_j

and

{SM}_i

Section: Performance Analysismentioning

confidence: 99%

PSAK: A provably secure authenticated key agreement scheme based on extended Chebyshev chaotic maps for smart grid environments

Wang

Zhou

et al. 2023

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…As technology evolves, data security is facing more and more attacks [14,15]. The current data privacy protection technologies for wearable devices are mainly based on cryptography and perturbation [16].…”

Section: Related Workmentioning

confidence: 99%

“…If the derivatives of adjacent data points are opposite, and the time interval (t int ) between the former point and the starting point (i.e., t cur and t sta respectively) is greater than α, the former is kept and the latter is compared with the next data point. Repeat the previous steps until the list1 is traversed, and the retained points together with the starting and ending points are the salient points, which are stored in list2 (lines [10][11][12][13][14][15][16][17][18][19][20][21][22].…”

Section: Plos Onementioning

confidence: 99%

Local differential privacy protection for wearable device data

Wang

et al. 2022

PLoS ONE

View full text Add to dashboard Cite

Personal data collected by wearable devices contains rich privacy. It is important to realize the personal privacy protection for user data without affecting the data collection of wearable device services. In order to protect users’ personal privacy, a collection scheme based on local differential privacy is proposed for the collected single attribute numerical stream data. At first, the stream data points collected by the wearable device are censored to identify the salient points, and the adaptive Laplacian mechanism is used to add noise to these salient points according to the assigned privacy budget; then the collector reconstructs and fits the stream data curve to the noise-added salient points, so as to protect the personal privacy of the data. This scheme is experimented on the heart rate dataset, and the results show that when the privacy budget is 0.5 (i.e., at higher privacy protection strength), the mean relative error is 0.12, which is 57.78% lower than the scheme of Kim et al. With the satisfaction of user privacy protection, the usability of mean value estimation of wearable device stream data is improved.

show abstract

“…Ma et al [39] presented an adaptive large neighborhood search algorithm to find nearoptimal solutions for larger-size time-dependent VRPs. In addition, some other algorithms are also presented for solving VRPs and the other optimization problems [40][41][42][43][44][45][46][47][48][49][50][51].…”

Section: Related Workmentioning

confidence: 99%

A Novel Multistrategy-Based Differential Evolution Algorithm and Its Application

Jin-yin¹,

Shang

Jing

et al. 2022

Electronics

View full text Add to dashboard Cite

To address the poor searchability, population diversity, and slow convergence speed of the differential evolution (DE) algorithm in solving capacitated vehicle routing problems (CVRP), a new multistrategy-based differential evolution algorithm with the saving mileage algorithm, sequential encoding, and gravitational search algorithm, namely SEGDE, is proposed to solve CVRP in this paper. Firstly, an optimization model of CVRP with the shortest total vehicle routing is established. Then, the saving mileage algorithm is employed to initialize the population of the DE to improve the initial solution quality and the search efficiency. The sequential encoding approach is used to adjust the differential mutation strategy to legalize the current solution and ensure its effectiveness. Finally, the gravitational search algorithm is applied to calculate the gravitational relationship between points to effectively adjust the evolutionary search direction and further improve the search efficiency. Four CVRPs are selected to verify the effectiveness of the proposed SEGDE algorithm. The experimental results show that the proposed SEGDE algorithm can effectively solve the CVRPs and obtain the ideal vehicle routing. It adopts better search speed, global optimization ability, routing length, and stability.

show abstract

Delay-CJ: A novel cryptojacking covert attack method based on delayed strategy and its detection

Cited by 27 publications

References 7 publications

PSAK: A provably secure authenticated key agreement scheme based on extended Chebyshev chaotic maps for smart grid environments

PSAK: A provably secure authenticated key agreement scheme based on extended Chebyshev chaotic maps for smart grid environments

Local differential privacy protection for wearable device data

A Novel Multistrategy-Based Differential Evolution Algorithm and Its Application

Contact Info

Product

Resources

About