As time-series data from the Internet of Medical Things (IoMT) increasingly permeates various aspects of medical research, public governance, and clinical treatment, its sensitivity raises significant privacy concerns, hindering the potential of deep learning applications for cross-institutional data integration. Previous practices focused on deep learning methods based on centralized data storage and processing, which are often unsuitable for decentralized and privacy-sensitive IoMT data scenarios. Most existing methods rely on mechanisms such as trusted coordinators, which face challenges in addressing potential passive data leakage and side-channel attacks, failing to effectively protect the privacy of sensitive data during collaborative training. To address these issues, we propose a privacy-preserving collaborative training model, Secure Long Sequence Time-Series Forecasting (SecLSTF), for IoMT time-series data and design a mapping strategy between model components and Multi-Party Computation (MPC) protocols. Building on this foundation, we propose a novel secret sharing protocol, Pleione, which focuses on optimizing the computational efficiency of the low-level secret-sharing protocol. The protocol centers on a hyper-invertible matrix and adopts a paired double random expansion mechanism, significantly reducing the communication rounds required for random number generation. This optimization enhances the overall training speed of SecLSTF. Subsequently, we replace the original computational support protocol with Pleione. Experimental results show that SecLSTF-Pleione significantly reduces computational time while maintaining computational accuracy, outperforming other protocols in component efficiency. This study offers a potential pathway for cross-institutional IoMT data sharing.

Model partitioning techniques, which decompose and collaboratively execute subtasks of deep neural networks (DNNs), have emerged as a critical strategy for enhancing distributed inference efficiency. However, in mobile edge computing (MEC), dynamic load fluctuations at edge nodes and the complexity of cross-node task dependencies make the delay minimization problem extremely challenging. Existing studies predominantly adopt a decoupled optimization framework that separately addresses partitioning-offloading and pipeline scheduling, neglecting their inherent cyclic state-dependent coupling. This oversight leads to suboptimal solutions, such as pipeline stagnation caused by mismatched computation and communication timestamps. To address these challenges, we propose a multi-endpoint directed acyclic graph (DAG)-driven cooperative optimization approach, enabling partitioning-offloading and pipeline scheduling in MEC. Specifically, the approach involves two core steps: 1)Dynamic pre-scheduling: We propose an improved DNN scheduling algorithm for constrained subtasks, which simulates node-level queuing delays and pipeline stalls under real-world constraints, translating runtime states into latency objectives. 2)Partitioning and offloading solution retrieval: Based on latency objectives, we introduce a novel multi-endpoint DAG structure and design a multi-node collaborative optimization retrieval algorithm, enabling adaptive partitioning-offloading remapping of subtasks. Experiments demonstrate the superiority of the proposed method over other advanced methods, reducing the time overhead by an average of 24% and 75% in two different scenarios, respectively. The resource code can be found at: https://github.com/aiheiheiheii/Partition_Scheduling.git.

To solve the problems of vote forgery and malicious election of candidate nodes in the Raft consensus algorithm, we combine zero trust with the Raft consensus algorithm and propose a secure and efficient consensus algorithm -Verifiable Secret Sharing Byzantine Fault Tolerance Raft Consensus Algorithm (VSSB-Raft). The VSSB-Raft consensus algorithm realizes zero trust through the supervisor node and secret sharing algorithm without the invisible trust between nodes required by the algorithm. Meanwhile, the VSSB-Raft consensus algorithm uses the SM2 signature algorithm to realize the characteristics of zero trust requiring authentication before data use. In addition, by introducing the NDN network, we redesign the communication between nodes and guarantee the communication quality among nodes. The VSSB-Raft consensus algorithm proposed in this paper can make the algorithm Byzantine fault tolerant by setting a threshold for secret sharing while maintaining the algorithm’s complexity to be O(n). Experiments show that the VSSB-Raft consensus algorithm is secure and efficient with high throughput and low consensus latency.

Internet of things (IoT) development tends to reduce the reliance on centralized servers. The zero-trust distributed system combined with blockchain technology has become a hot topic in IoT research. However, distribution data storage services and different blockchain protocols make network interoperability and cross-platform more complex. Relay chain is a promising cross-chain technology that solves the complexity and compatibility issues associated with blockchain cross-chain transactions by utilizing relay blockchains as cross-chain connectors. Yet relay chain cross-chain transactions need to collect asset information and implement asset transactions via two-way peg. Due to the release of user transaction information, there is the issue of privacy leakage. In this article, we propose a cross-chain privacy protection protocol based on the Groth16 zero-knowledge proof algorithm and coin-mixing technology, which changes the authentication mechanism and uses a combination of generating functions to map virtual external addresses in transactions. It allows fast cross-chain anonymous transactions while hiding the genuine user’s address. The experiment shows that, in a zero-trust IoT context, our scheme can effectively protect user privacy information, accomplish controlled transaction traceability operations, and guarantee cross-chain transaction security.

Although 5G and beyond communication technology empower a large number of edge heterogeneous devices and applications, the stringent security remains a major concern when dealing with the millions of edge computing tasks in the highly dynamic heterogeneous networks (HDHNs). Blockchains contribute significantly to addressing security challenges by guaranteeing the reliability of data and information. Since the node’s mobility, there are risks of exiting the network and leaving the remaining tasks noncomputed. Therefore, we model the cost function of offloaded computing tasks as a dynamic stochastic game. To reduce the computational complexity, the Time-Variant Mean-Field term (TVMF) is adopted to solve the cost-optimized problem. What’s more, we design an Adaptivity-Aware Practical byzantine fault tolerance consensus Protocol (AAPP) to dynamically formulate domains, execute leader node selection with regard to task completion and quickly verify computational results. In addition, a Dynamic Multi-domain Fractional Repetition uncoded repair storage (DMFR) scheme with variant redundancy is proposed to reduce the storage pressure and repair overhead. The simulation is implemented to demonstrate our scheme outperforms the benchmarks in terms of cost and time overhead.

With the rapid deployment of Internet of Things (IoT) devices in various industries and fields, the massive amount of data produced by these devices can yield greater value through sharing. A critical challenge in the data-sharing process is ensuring that the data are high quality. However, the quality of data provided by a large number of IoT devices is impacted by the variability of factors contributing to the data quality (DQ). Effective and safe sharing of perception data by the limited resources of IoT devices is a problem worth investigating. In this article, we propose a smart contract-based and DQ-driven incentive mechanism. First, a smart contract is proposed to realize security in the data-sharing process, while the proposed DQ evaluation mechanism ensures the quality of the shared data. Second, a two-layer Stackelberg game of nested coalitional (TLSNC) scheme is designed to obtain the maximum overall social welfare according to the trust score obtained during DQ evaluation while satisfying the limitation of loose and insufficient computing resources. Moreover, we designed a smart contract for automatic execution of the data-sharing transaction and used a trusted execution environment (TEE) to complete the security calculation of shared data. Finally, the numerical results reveal the effectiveness of the DQ evaluation mechanism and the security of our TEE-based model. Based on the proposed scheme, sustainable incentives for user participation and high-quality data sharing can be achieved. In addition, our system can significantly improve the overall social welfare compared to traditional solutions.

Owing to the technology of 5G and beyond, collaborative edge computing-as-a-service has enabled trillions of interconnected edge applications. It has also become a prospective paradigm for providing computing services by offloading computationally intensive assignments to mobile-edge servers or fog nodes due to terminals constrained computing and caching resources. Nevertheless, in this process, trust of computing-as-a-service scheduling and edge data sharing in heterogeneous systems is an unavoidable challenge of paramount importance. As a powerful tool that addresses security issues, blockchains can ensure the trustworthiness and irreversibility of computing data by consensus mechanisms. However, in the Industrial Internet of Energy (IIoE), the storage burden of a single blockchain has increased. Therefore, from the perspective of a stable real-time operation, we propose a multiedgechain structure that accommodates thousands of edge data and promotes on-chain data efficiency to achieve cross-chain edge data sharing for heterogeneous blockchain systems. Moreover, aiming at the profits of computing resource scheduling in the IIoE, a two-stage Stackelberg game strategy with an optimal scheduling demand and reward is provided considering the edge user’s preferences and risk factors. Finally, the simulation results verify the superiority of the proposed scheme, regarding the game equilibrium, utility optimization, and data sharing efficiency of cloud–edge collaboration.