MétaCan
Menu
Back to cohort
Record W4409882804 · doi:10.1109/jiot.2025.3564766

Fault-Tolerant Differential Privacy Routing of Human–Cyber–Physical Fusion Systems for Large Language Models Security

2025· article· en· W4409882804 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Internet of Things Journal · 2025
Typearticle
Languageen
FieldComputer Science
TopicBig Data and Digital Economy
Canadian institutionsÉcole de Technologie Supérieure
FundersFok Ying Tung Education FoundationNatural Science Foundation of Fujian ProvinceNational Natural Science Foundation of China
KeywordsComputer scienceDifferential privacyComputer securityCyber-physical systemRouting (electronic design automation)Computer networkDistributed computingData mining

Abstract

fetched live from OpenAlex

The rapid proliferation of Internet of Things (IoT) systems has introduced complex networks of interconnected devices, computational resources, and web-based communication infrastructure. Privacy protection in IoT data routing is critical to enabling secure deployment of large language models (LLMs) for processing distributed sensor data, user queries, and device-generated content. However, IoT environments inherently involve heterogeneous devices, dynamic network topologies, and resource-constrained nodes, complicating the design of privacy-preserving routing mechanisms that simultaneously ensure reliability across diverse communication layers. To address these challenges, we propose an innovative FtPR (Fault-tolerant Privacy Routing) model based on secure multiparty computing mechanism, which enables secure and efficient data fusion and transmission in IoT networks. FtPR establishes a novel connection between IoT device clusters and data center network architecture AQDNn routers, leveraging the hierarchical architecture of AQDNn to construct completely independent spanning trees (CIST). By exploiting the non-overlapping paths between nodes in distinct CISTs, FtPR achieves fault-tolerant routing while maintaining privacy guarantees. Building on this framework, we introduce a secure multiparty computing mechanism to perturb link weights in the AQDNn. This ensures that link weights across different CISTs adhere to constrained ranges, preventing adversarial inference of routing paths. Each node operates with localized knowledge of its connected link weights, eliminating the need for global network visibility. Consequently, even if malicious actors compromise one or multiple nodes, they cannot reconstruct end-to-end communication paths, thereby preserving route anonymity. Experimental results demonstrate that FtPR improves IoT network performance and security, reducing misclassification rates and marginal release score compared to state-of-the-art methods.

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.

Full frame distilled prediction

Teacher imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.951
Threshold uncertainty score0.513

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.021
GPT teacher head0.283
Teacher spread0.262 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it