<p>Cooperative V2X is evolving toward city-scale deployment, yet current infrastructures still lack a network substrate that jointly provides cross-domain trust, low-latency finality, and privacy-preserving, auditable evidence for safety-critical decisions. This paper proposes a federated-trust sharded blockchain that turns heterogeneous vehicular and roadside measurements into accountable records and enables real-time forensic collaboration and secure data sharing across operators and city management authorities. A federated trust oracle fuses GNSS, OBD, IMU, RSU observations, and device attestations into uncertainty-aware scores that steer committee election, voting weights, and traffic shaping in each shard. On this basis, we design a hybrid cross-shard commit protocol with adaptive finality, combining atomic channels for forensic-critical transactions and optimistic channels for routine collaboration, and we establish safety/liveness conditions and provide proof sketches under the stated partial-synchrony assumptions and bounded collusion. For the forensic layer, a two-stage pipeline anchors minimal sufficient evidence with sub-second local finality, while editable proofs built on traffic-aware extended Merkle trees and zero-knowledge attestations support publicly verifiable, legally compliant edits with <InlineEquation ID="IEq1"><EquationSource Format="TEX">$O(\log n)$</EquationSource><EquationSource Format="MATHML"><math><mrow><mi>O</mi><mo stretchy="false">(</mo><mo>log</mo><mi>n</mi><mo stretchy="false">)</mo></mrow></math></EquationSource></InlineEquation> verification overhead. An SLA-aware, learning-assisted scheduler adapts committee size, batching, and cross-shard parallelism to dynamic traffic and attack patterns so as to meet latency, throughput, and rollback targets. Large-topology containerized emulation on a dedicated workstation, complemented by a small hardware-in-the-loop testbed, shows that the proposed framework achieves sub-second forensic anchoring and 95th-percentile cross-shard finality below <InlineEquation ID="IEq2"><EquationSource Format="TEX">$1.2$</EquationSource><EquationSource Format="MATHML"><math><mrow><mn>1.2</mn></mrow></math></EquationSource></InlineEquation> s. Across the representative baselines used in this study, it improves effective throughput by up to <InlineEquation ID="IEq3"><EquationSource Format="TEX">$35\%$</EquationSource><EquationSource Format="MATHML"><math><mrow><mn>35</mn><mo>%</mo></mrow></math></EquationSource></InlineEquation>; in particular, at comparable <InlineEquation ID="IEq4"><EquationSource Format="TEX">$L_{p95}$</EquationSource><EquationSource Format="MATHML"><math><msub><mi>L</mi><mrow><mi>p</mi><mn>95</mn></mrow></msub></math></EquationSource></InlineEquation>, it achieves <InlineEquation ID="IEq5"><EquationSource Format="TEX">$1.6$</EquationSource><EquationSource Format="MATHML"><math><mrow><mn>1.6</mn></mrow></math></EquationSource></InlineEquation>–<InlineEquation ID="IEq6"><EquationSource Format="TEX">$2.3\times $</EquationSource><EquationSource Format="MATHML"><math><mrow><mn>2.3</mn><mo>×</mo></mrow></math></EquationSource></InlineEquation> higher TPS than the single-chain HotStuff baseline under the tested emulation conditions, while reducing rollback rate and per-event bandwidth by up to <InlineEquation ID="IEq7"><EquationSource Format="TEX">$40\%$</EquationSource><EquationSource Format="MATHML"><math><mrow><mn>40</mn><mo>%</mo></mrow></math></EquationSource></InlineEquation> and <InlineEquation ID="IEq8"><EquationSource Format="TEX">$25\%$</EquationSource><EquationSource Format="MATHML"><math><mrow><mn>25</mn><mo>%</mo></mrow></math></EquationSource></InlineEquation>, respectively. These results indicate that the proposed system can shorten incident response, strengthen accountability in crash investigations and recalls, and provide a practical foundation for privacy-preserving, transparent data collaboration between mobility operators and urban management departments.</p>

Federated-trust sharded blockchain for real-time forensics and secure data collaboration in cooperative V2X

期刊论文
出版模式：

开放获取
发表日期：

2026年5月4日

查看全文

Yongming Zhang,
Chaoyue Li,
Lei Liu,
Yangjun Sun,
Xiaolong Xu

摘要

Cooperative V2X is evolving toward city-scale deployment, yet current infrastructures still lack a network substrate that jointly provides cross-domain trust, low-latency finality, and privacy-preserving, auditable evidence for safety-critical decisions. This paper proposes a federated-trust sharded blockchain that turns heterogeneous vehicular and roadside measurements into accountable records and enables real-time forensic collaboration and secure data sharing across operators and city management authorities. A federated trust oracle fuses GNSS, OBD, IMU, RSU observations, and device attestations into uncertainty-aware scores that steer committee election, voting weights, and traffic shaping in each shard. On this basis, we design a hybrid cross-shard commit protocol with adaptive finality, combining atomic channels for forensic-critical transactions and optimistic channels for routine collaboration, and we establish safety/liveness conditions and provide proof sketches under the stated partial-synchrony assumptions and bounded collusion. For the forensic layer, a two-stage pipeline anchors minimal sufficient evidence with sub-second local finality, while editable proofs built on traffic-aware extended Merkle trees and zero-knowledge attestations support publicly verifiable, legally compliant edits with $O(\log n)$ $O (log n)$ verification overhead. An SLA-aware, learning-assisted scheduler adapts committee size, batching, and cross-shard parallelism to dynamic traffic and attack patterns so as to meet latency, throughput, and rollback targets. Large-topology containerized emulation on a dedicated workstation, complemented by a small hardware-in-the-loop testbed, shows that the proposed framework achieves sub-second forensic anchoring and 95th-percentile cross-shard finality below $1.2$ $1.2$ s. Across the representative baselines used in this study, it improves effective throughput by up to $35\%$ $35 %$ ; in particular, at comparable $L_{p95}$ $L_{p 95}$ , it achieves $1.6$ $1.6$ –$2.3\times $ $2.3 \times$ higher TPS than the single-chain HotStuff baseline under the tested emulation conditions, while reducing rollback rate and per-event bandwidth by up to $40\%$ $40 %$ and $25\%$ $25 %$ , respectively. These results indicate that the proposed system can shorten incident response, strengthen accountability in crash investigations and recalls, and provide a practical foundation for privacy-preserving, transparent data collaboration between mobility operators and urban management departments.