Traditional cloud-centric approaches to medical data sharing pose risks related to real-time performance, security, and stability. Medical and healthcare data encounter challenges like data silos, privacy breaches, and transmission latency. In response to these challenges, this paper introduces a blockchain-based framework for trustworthy medical data sharing in edge computing environments. Leveraging healthcare consortium edge blockchains, this framework enables fine-grained access control to medical data. Specifically, it addresses the real-time, multi-attribute authorization challenge in CP-ABE through a Distributed Attribute Authorization strategy (DAA) based on blockchain. Furthermore, it tackles the key security issues in CP-ABE through a Distributed Key Generation protocol (DKG) based on blockchain. To address computational resource constraints in CP-ABE, we enhance a Distributed Modular Exponentiation Outsourcing algorithm (DME) and elevate its verifiable probability to “1”. Theoretical analysis establishes the IND-CPA security of this framework in the Random Oracle Model. Experimental results demonstrate the effectiveness of our solution for resource-constrained end-user devices in edge computing environments.

Conventional blockchain consensus protocols tailored for the Internet of Vehicles (IoV) usually face low transaction throughput, high latency, and elevated communication overhead issues. To address these issues, in this paper, we propose ESBCP, an efficient and secure blockchain consensus protocol for the IoV environment. Firstly, considering the significant performance differences among nodes in the IoV, we designed a blockchain consensus model for the IoV. Roadside units execute a trust evaluation mechanism to select high-quality vehicle nodes for the consensus process, thereby reducing the likelihood of malicious nodes in the consensus cluster. Secondly, we designed a node partition strategy to adapt to the dynamic feature of the IoV. Finally, addressing the mobility of nodes in the IoV, we introduced a dynamic unique node list. Vehicle nodes can promptly select nodes with high reliability from the list of communicable nodes to join their unique node list, while also promptly removing nodes with low reliability from their unique node list. Combining these strategies, we propose DK-PBFT, an improved Practical Byzantine Fault Tolerance consensus algorithm. The algorithm meets the efficiency and mobility requirements of vehicular networks. Through theoretical analysis, ESBCP could prevent external and internal security risks while reducing communication overhead. Experimental verification demonstrated that ESBCP effectively reduces consensus latency and improves transaction throughput. Our proposed ESBCP can be used in other application scenarios that require high consensus efficiency.

With the continuous development of blockchain technology and economy, blockchain applications have been well developed in multiple key areas. The demand for interoperability between different blockchains is also increasing. Cross-chain protocol has become a major approach to solve cross-chain problems by defining a series of cross-chain processes and standards. In response to the problems of long transaction time, high transaction costs, and high degree of centralization in most cross-chain protocols, this paper proposes a three-stage cross-chain protocol based on transaction notary groups and verification notary groups. Without increasing transaction costs and transaction time, the centralization problem of notary mechanism cross-chain technology is solved, realizing secure and fast interaction between different blockchains. Experimental results show that as long as malicious nodes in the notary group do not exceed one-third, the three-stage cross-chain protocol can effectively ensure the security of cross-chain transactions and solve the centralization problem.

Blockchain, as a distributed trust database, has been widely applied in the field of trustworthy sharing of Internet of Things (IoT) sensor data. A single hash mechanism has achieved, to some extent, the trustworthy on-chain storage of blockchain sensor data, that is, the consistency of data on and off the chain. However, it still faces potential security risks such as collision attacks, short password attacks, and rainbow table attacks. To address this issue, this paper proposes a resiliently secure blockchain sensor data trustworthy sharing model based on a mimic hash mechanism. Specifically, in response to the security risks that may arise from the single hash mechanism, this study innovatively introduces a mimic hash mechanism and proposes two methods for constructing mimic hashes based on Verifiable Random Function (VRF) and Cyber Mimic Defense (CMD) in dedicated Wireless Sensor Networks (WSNs) and open public networks, respectively. Theoretical analysis and experimental results demonstrate that this model effectively solves the problem of trustworthy on-chain storage of sensor data in edge computing environments, enhancing the trustworthiness and security of the data on the chain.

Web3.0 aims to foster a trustworthy environment enabling user trust and content verifiability. However, the proliferation of fake news undermines this trust and disrupts social ecosystems, making the effective alignment of visual-textual semantics and accurate content verification a pivotal challenge. Existing methods still struggle with deep cross-modal interaction and the adaptive calibration of discrepancies. To address this, we introduce the Bidirectional Semantic Enhancement and Adversarial Network (BSEAN). BSEAN first extracts features using large pre-trained models: a hybrid encoder for text and the Swin Transformer for images. It then employs a Bidirectional Modality Mapping Network, governed by cycle consistency, to achieve preliminary semantic alignment. Building on this, a Semantic Enhancement and Calibration Network explores inter-modal dependencies and quantifies semantic deviations to enhance discriminative capability. Finally, a Dual Adversarial Learning framework bolsters event generalization and representation consistency through adversarial training with event and modality discriminators. Experiments on public Weibo and Twitter datasets validate BSEAN’s superior performance across all metrics, demonstrating its efficacy in tackling the complex challenges of deep cross-modal interaction and dynamic modality calibration within Web3.0 social networks.

Blockchain sharding is a promising approach to improving system scalability. However, traditional designs rely on lock-based cross-shard commit protocols, which introduce significant performance bottlenecks due to repeated on-chain communication and consensus. The emergence of complex cross-shard contracts further exacerbates these issues. Although recent off-chain execution models reduce on-chain overhead by decoupling contract execution from consensus, they still incur high communication costs and struggle to maintain state consistency. To address these challenges, this paper presents a sharding framework that seamlessly integrates on-chain and off-chain processing. By leveraging Trusted Execution Environments (TEEs), the framework enables secure and efficient off-chain execution of cross-shard smart contracts. It incorporates an off-chain execution hub for verifiable contract execution and a state-aware cross-shard commit protocol to guarantee correctness. Furthermore, a genetic algorithm-based contract-migration strategy dynamically reduces cross-shard interactions. Prototype evaluations show that the proposed framework significantly outperforms mainstream sharding solutions, achieving at least 2.1× higher throughput and reducing cross-shard transaction latency by over 52.6%.