Research on Data Security Protection Strategies in Cloud Computing Environment
Bibliographic record
Abstract
In today's increasingly complex and dynamic network structure, cloud computing brings great convenience to computer users and meets people's requirements for rapid computer data processing.The article firstly analyzes the cloud computing architecture and the security threats existing in the cloud environment, and explains the importance of cloud computing access control mechanism to ensure data security, starting from the traditional access control.Then it introduces the multiauthority attribute access control scheme based on blockchain and elliptic curve improvement, on the basis of which it proposes a blockchain-based cloud data security sharing model and a blockchain transaction privacy protection scheme, which both meets the user data privacy protection needs and realizes privacy computing.Finally, the security of the two schemes is analyzed, and compared with other schemes with the same mechanism.The results show that the blockchain-based cloud data security sharing scheme has better performance and scalability, which shows a stable linear growth of 1x, and the time load introduced by this scheme while enhancing the security of the encrypted data sharing system is acceptable compared to the other schemes to satisfy the application scenarios with large-scale access requests.At the same time, the blockchain transaction privacy protection scheme ensures data privacy while the average time consumed meets the user's requirements for fast response.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.003 |
| Science and technology studies | 0.002 | 0.002 |
| Scholarly communication | 0.004 | 0.009 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".