Instant_Anonymity: A Lightweight Semantic Privacy Guarantee for 5G-Enabled IIoT
Bibliographic record
Abstract
Data publication and sharing are critical components of assessing network infrastructures in the Internet of Things for quality-of-service enhancement. Especially, the advancement in communication technology (e.g., 5G/6G) enables the improvement of the current bottlenecks in the Industrial Internet of Things. Recent approaches remove raw data and their source to achieve a privacy guarantee. However, the data are already anonymized; these still reveal the victim’s extra information using linkage attacks. When data are updated and combined or noise is introduced as part of conventional privacy protection approaches, such as <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$k$</tex-math></inline-formula> -anonymity, l-diversity, or differential privacy, the usefulness of the released data is diminished, however, posing data utility and computation constraints. In recent years, lightweight privacy-preservation techniques have been proposed for these reasons. However, most of the focus is on syntactic privacy instead of semantic privacy guarantee. Therefore, this article proposes a lightweight semantic privacy-preservation framework for maintaining privacy with high utility efficiency. The proposed paradigm ensures semantic privacy by combining probabilistic random sampling with Instant_Anonymity. Compared to <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$k$</tex-math></inline-formula> -anonymity, the suggested model demonstrates improved data utility with lower utility errors of 0.00036 and 0.41 for Kullback–Leibler divergence and query error, respectively. The classification accuracy is improved by 0.2%. In addition, the proposed approach is simpler to implement in computation time than the existing state-of-the-art lightweight privacy-preserving strategies.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.002 |
| Open science | 0.016 | 0.001 |
| 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".