emergency communication networks of small groups, optimized Byzantine Generals’ Problem, fast ECDSA, lightweight trusted security scheme based on Byzantine Generals’ Problem
Public communication infrastructures are susceptible to disasters. Thus, the Emergency Communication Networks (ECNs) of small groups are necessary to maintain real-time communication during disasters. Given that ECNs are self-built by users, the unavailability of infrastructures and the openness of wireless channels render them insecure. ECN security, however, is a rarely studied issue despite of its importance. Here, we propose a security scheme for the ECNs of small groups. Our scheme is based on the optimized Byzantine Generals’ Problem combined with the analysis of trusted security problems in ECNs. Applying the Byzantine Generals’ Problem to ECNs is a novel approach to realize two new functions, debugging and error correction, for ensuring system consistency and accuracy. Given the limitation of terminal devices, the lightweight fast ECDSA algorithm is introduced to guarantee the integrity and security of communication and the efficiency of the network. We implement a simulation to verify the feasibility of the algorithm after theoretical optimization.
Tsinghua University Press
Fugang Liu, Jiawei Xu, Feng Hu et al. Lightweight Trusted Security for Emergency Communication Networks of Small Groups. Tsinghua Science and Technology 2018, 23(2): 195-202.