Study on the Application of SPA-based Single Packet Knocking Technology in Network Security Protection and Resistance Efficacy against DDOS and Web Attacks
Bibliographic record
Abstract
In response to cybersecurity threats such as security breaches, data leakage, supply chain attacks, and ransomware viruses in digital network environments, more reliable cybersecurity architectures are needed to address these challenges.The article builds a zero-trust firewall applied to network security protection based on zero-trust architecture by integrating SPA single-packet authorisation technology and authentication scheme.Then SPA single packet authorisation technology with SM3 hash algorithm and SM4 algorithm for fully nominal encryption processing is constructed as a network security protection scheme, and the authentication protocol and trust evaluation algorithm are established by using hash and different-or function.In the simulation verification results, the communication volume of SDP client to complete one authentication is 981B, which reduces 27.17% compared to WaverleySDP overhead.The server in the SDP+SPA scenario still retains a certain amount of legitimate data after DDOS attacks and Web attacks, and receives only 53.47% of the traffic of the SDP scenario.The CPU usage of the client deployed with SPA is only 11.47 percentage points higher than that without SPA mechanism.The combination of SPA single-packet knocking technology and zero-trust architecture can achieve network security protection, and can also effectively deal with DDoS and Web attacks, and improve the performance of network security protection.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".