Data Sharing

This paper introduces a new reputation-enhanced shard-based Byzantine fault-tolerant scheme tailored for zero-trust human digital twin (HDT) systems. This distinctive framework seeks to improve throughput and diminish latency in data sharing by integrating a parallel validation-based reputation-enhanced practical Byzantine fault tolerance consensus process with a priority-based block-adding method to counter forking attacks. Overall, the approach uses a Q-network to handle the considerable dimensions of the action space in the problem at hand. Consequently, this solution effectively enriches the authentication, authorization, and verification endeavors in HDT systems via an increase in throughput and a decrease in latency, presenting a potent answer to secure and effectual data interchange in HDT setups.