.png){kind=icon}
.png){kind=icon}
Return
A data encryption access control algorithm based on zero-trust model with degree of discretization
.png){kind=icon}
OA
AI
DOI：10.1016/j.eij.2025.100825.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Due to the issues of false positives and false negatives in trust assessment in existing data encryption access control, the defense capability against network attacks is poor, resulting in a decrease in the integrity of transmitted data, and low encryption efficiency in the context of big data scale. Therefore, to ensure the security of data resources during sharing and access and prevent unauthorized access and data leakage, a data encryption access control algorithm based on the Zero Trust model with degree of differentiation is proposed. The algorithm employs the Zero Trust model and degree of differentiation as the core structure, evaluates user trust values using fuzzy hierarchical analysis, and subsequently updates user attributes and encrypts them based on the concept of degree of differentiation. By utilizing the core logical components of the Zero Trust model, the algorithm encrypts access for revoked users and generates a new user attribute group key for each irrevocable user. This method effectively achieves revocable attribute encryption access control. The test results show that the proposed algorithm can determine the trust level of all users in the network, with a total of 6 false positives and 10 false negatives in 1000 experiments, and can accurately evaluate the trust value of users; And it has good encryption performance. When the security level reaches 100, the key length is only 88 bits, which can complete encryption more efficiently and effectively improve the defense ability against network attacks. Its effective data transmission integrity can reach 100 %; In addition, at a scale of 100 GB, the proposed method has encryption speeds that are 5.3 times and 1.4 times faster than the comparison method, respectively. Moreover, at a big data scale of 10 TB, the comparison method failed to encrypt due to high memory requirements, while the proposed algorithm can effectively complete encryption with an encryption time of 8850.5 s, which has a good efficiency advantage and is suitable for large-scale data encryption scenarios.
Keywords:
Zero Trust model
Degree of differentiation
Revocable attributes
Encryption access control
Attribute updating
Logical component
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.3
Papers:
770
Citations:
1.4K