IEEE/ICACT20260208 Slide.18        [Big Slide]       Oral Presentation
To conclude, this work proposes a scalable and secure framework for federated learning in IoV. Our design combines deterministic stack-script verification at RSUs, on-chain HID–public key binding for conditional privacy and traceability, and committee-based Chained HotStuff for scalable consensus. In evaluation, C-CHS consistently improves both throughput and latency compared with PBFT and original CHS, with larger gains at higher node counts. A remaining limitation is committee-internal communication overhead. As future work, we plan to develop a more efficient committee communication mechanism than the gossip protocol and to introduce reputation-based committee election.

[Go to Next Slide]
Select Voice: