Traditional video conference systems depend largely on computational complexity to ensure system security, but with the development of high-performance computers, the existing encryption system will be seriously threatened. To solve this problem, a hybrid encryption scheme for quantum secure video conferencing combined with blockchain is proposed in this study. In the system solution architecture, first, the quantum key distribution network is embedded in the classic network; then, the “classical + quantum” hybrid encryption scheme is designed according to the secret level required for the video conference content. Besides, the real-time monitoring module of the quantum key distribution network is designed to ensure that users can check the running state of the network at any time. Meeting minutes can be shared by combining with blockchain. In order to quickly query meeting minutes, a cache-efficient query method based on B+ tree is proposed. The experimental results show that compared with the traditional video conference system, the quantum secure video conference system sufficiently integrates the technical advantages of the quantum key distribution to resist the security threats such as channel eavesdropping and high-performance computational attacks while ensuring the stable operation of the classic system, thus providing a video conference system with a higher security level. Meanwhile, the query time cost of blockchain with different lengths is tested, and the query efficiency of the proposed method is 3.15-times higher than the original query efficiency of blockchain.

In the digital era, secure data sharing has become a core requirement for enabling cross-domain collaboration, cloud computing, and Internet of Things (IoT) applications, as well as a critical measure for safeguarding privacy and defending against malicious attacks. In light of the risks of data leakage and misuse in open environments, achieving efficient, controllable, and privacy-preserving data sharing has emerged as a key research focus. This paper first provides a systematic review of the prevailing secure data sharing technologies, including proxy re-encryption, searchable encryption, key agreement and distribution, and attribute-based encryption, summarizing their design principles and application features. Subsequently, game-theoretic modeling based on incentive theory is introduced to construct a strategic interaction framework between data owners and data users, aiming to analyze and optimize benefit allocation mechanisms. Furthermore, the paper explores the integration of game theory with secure sharing mechanisms to enhance the sustainability and stability of the data sharing ecosystem. Finally, it outlines the critical challenges currently faced in secure data sharing and discusses future research directions, offering theoretical insights and technical references for building a more comprehensive data sharing framework.

As the medical information systems continue to develop, the sharing of electronic medical records (EMRs) is becoming a vital tool for improving the quality and efficiency of medical services. However, during the process of sharing EMRs, establishing mutual-trust relationships and increasing users’ participation are urgent problems to be solved. Current solutions mainly focus on incentive mechanisms for users’ honest and active participation, but often ignore the potential impact of research institutions’ behavior on users’ trust and participation. To address this, this paper proposes an incentive mechanism based on evolutionary game theory. It combines the unchangeable nature of blockchain and the dynamic adjustment characteristics of evolutionary games to build a secure and trustworthy incentive system. This system considers the potential malicious behaviors of both users and research institutions, encouraging research institutions to protect users’ privacy, reduce users’ concerns, and guide users to actively contribute data. At the same time, it ensures data security and system trust through clear rewards and punishments. Based on this, we have carried out a comprehensive simulation using game theory. The results confirm that our designed incentive mechanism can effectively achieve its expected goals.

With the advancement of the information age, various information-based products have become increasingly prevalent, leading to a corresponding rise in the volume of data requiring encrypted transmission. Consequently, secure key distribution has become particularly critical, especially in large-scale communication scenarios. Considering practical limitations such as offline availability and low performance among communication participants, we propose an asynchronous group quantum key distribution scheme based on a max heap structure and blockchain technology within classical networks. In this scheme, quantum keys serve as group communication keys, and the encrypted transmission of quantum keys is facilitated through a max heap constructed according to user information. Specifically, during the initialization phase, users upload relevant information to the Key Distribution Center (KDC), while in the key distribution phase, the blockchain stores encrypted temporary group keys, enabling asynchronous access. The proposed scheme not only reduces performance consumption for users within the group but also leverages the intrinsic properties of the max heap to dynamically balance loads. Moreover, the scheme achieves both forward and backward secrecy and demonstrates favorable performance in terms of storage efficiency and computational cost.

In order to satisfy the demand of mobile secure communication for quantum keys, this study proposes a commercial quantum key distribution (QKD) based quantum key injection scheme for mobile termina...