Metraipolis › archive › dc_efefaf9024fb

IPEK: Event-Criticality-Aware Evidential Trust Management against Strategic Insider Attacks in Vehicular Ad Hoc Networks — arXiv:2604.07532

Source: arXiv (en)
Original: https://arxiv.org/abs/2604.07532
License (as archived): CC0-1.0
Archived: 2026-10-19T05:31:06.161Z
SHA-256 of the archived text: 3c52216a6995b23869d6445b9c5032d4dd36a92f5c93a3cad01169102402c5ac
Stable URL of this page: https://metraipolis.com/documento/dc_efefaf9024fb

How to cite

IPEK: Event-Criticality-Aware Evidential Trust Management against Strategic Insider Attacks in Vehicular Ad Hoc Networks — arXiv:2604.07532 — arXiv (en), https://arxiv.org/abs/2604.07532 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_efefaf9024fb (Metraipolis archive dc_efefaf9024fb, sha256 3c52216a6995b23869d6445b9c5032d4dd36a92f5c93a3cad01169102402c5ac)

BibTeX

@misc{dcefefaf9024fb,
  title = {IPEK: Event-Criticality-Aware Evidential Trust Management against Strategic Insider Attacks in Vehicular Ad Hoc Networks — arXiv:2604.07532},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2604.07532},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_efefaf9024fb; sha256 3c52216a6995b23869d6445b9c5032d4dd36a92f5c93a3cad01169102402c5ac},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2604.07532. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Event-based trust management in vehicular ad hoc networks is vulnerable to strategic insider attackers who report trivial events correctly to build reputation, falsify reports on safety-critical events, and corrupt the trust feedback they provide about other vehicles. This paper proposes IPEK, an event-criticality-aware evidential trust management framework. IPEK combines an asymmetric local trust that scales rewards and penalties with event severity and location criticality, a reporter-credibility test that discounts feedback deviating systematically from the consensus of witnesses, and a Dempster-Shafer global trust that fuses feedback with Yager's rule, historical combination and risk accentuation. Closed-form properties quantify how quickly trust is lost and regained and show why Yager's rule keeps the global state revisable. IPEK is evaluated in simulation against a trust cascading-based dissemination scheme and the beta reputation system under eight attacks, with severity-, location-, on-off- and continuously triggered attackers falsifying their reports alone or also their feedback, at attacker ratios from 10% to 40%. Threshold-free separation measures are complemented by closed-loop revocation with frozen thresholds. With up to 25% attackers, IPEK achieves a significantly higher F1-score than both baselines under all attacks, with false positive rates of 0.9-15.5% against 7.8-49.7% and 26.0-41.4%, and it remains robust up to 40% attackers when only reports are falsified. Under fully colluding attackers that also corrupt feedback, all methods break down beyond about one third of attackers; this envelope and a longer detection delay are reported as limitations.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-13 in cs.DC).
Categorie arXiv: Networking and Internet Architecture (cs.NI) ; Cryptography and Security (cs.CR); Distributed, Parallel, and Cluster Computing (cs.DC).
Pagina del lavoro: https://arxiv.org/abs/2604.07532 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T05:15:56.867Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-08-13?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).