Home Archive
Archive
2024 Volume 61 Issue 10  Published: 2024-10-01
    Secure Circulation of Data Elements
  • Zepeng Wang , Chao Ma , Zhuangzhuang Zhang , Libing Wu , Xiaochuan Shi
    doi: 10.7544/issn1000-1239.202440387

    In recent years, the industrial control network has been developing rapidly. The advantages of digitization, intelligence, and automation have brought significant benefits to the industry while also introducing increasingly complex and variable attack threats. In the context of data element security, timely detection and response to industrial control network threats have become an urgent task to be solved. By continuously monitoring and analyzing the data flow in industrial control networks, the problem of industrial control network threat detection can be transformed into a time series anomaly detection problem. However, the existing time-series anomaly detection methods are limited by the quality of industrial control network datasets and are often sensitive to only a single type of anomaly while ignoring other anomalies. Therefore, in this paper, we propose a deep reinforcement learning and data augmentation based threat detection method in industrial control networks (DELTA). DELTA introduces a novel data augmentation selection technique for time series datasets, which allows for the selection of appropriate data augmentation operations sets tailored to different baseline models to enhance the quality of the industrial control network time series datasets. Simultaneously, deep reinforcement learning algorithms (A2C/PPO) dynamically select candidate models from the baseline models at different time points, leveraging multiple types of anomaly detection models to address the issue of sensitivity to single-type anomalies. The experimental results compared with the existing time series anomaly detection models show that DELTA has a significant improvement in accuracy and F1 value over all baseline models at an acceptable cost of additional time consumption, which verifies the effectiveness and practicality of the method.

  • Secure Circulation of Data Elements
  • Haobo Li , Mohan Li , Peng Chen , Yanbin Sun , Zhihong Tian
    doi: 10.7544/issn1000-1239.202440496

    Data identification is a prerequisite for achieving precise data governance, effectively ensuring the security of data elements during cross-domain transfer. Currently, there are methods for generating identifiers for individual data, but as the scale of data continues to expand, identifiers at the data level cannot be directly applied to the dataset level. This also introduces issues of identifiers being “easily damaged” and “difficult to embed”. To effectively address these issues, we adopt the design concept of network honeypoint from the “guardian” model proposed by academician Fang Binxing. Utilizing the idea of deception defense, we propose an anti-damage data identification technology based on dataset honeypoint for cross-domain data transfer scenarios, and design a complete method for generating and embedding dataset honeypoints. First, for cross-domain data transfer scenarios, dataset honeypoints are designed. By enhancing the concealment of dataset honeypoints and increasing their redundancy, the issue of identifiers being “easily damaged” is addressed. Second, by ensuring that the form of dataset honeypoint is indistinguishable from real data, the issue of identifiers being “difficult to embed” is resolved. Finally, experiments conducted on both image and encrypted text data modalities demonstrate that dataset honeypoints possess high anti-damage capability, high robustness, and low performance overhead.

  • Secure Circulation of Data Elements
  • Xiujun Wang , Lei Mo , Xiao Zheng , Linna Wei , Jun Dong , Zhi Liu , Longkun Guo
    doi: 10.7544/issn1000-1239.202440481

    Many cloud native database applications need to handle massive data streams. To analyze group trend information in these data streams in real time without compromising individual user privacy, these applications require the capability to quickly create differentially private histograms for the most recent dataset at any given moment. However, existing histogram publishing methods lack efficient data structures, making it difficult to rapidly extract key information to ensure real-time data usability. To address this issue, we deeply analyze the relationship between data sampling and privacy protection, and propose a sampling based fast publishing algorithm with differential privacy for data stream (SPF). SPF introduces an efficient data stream sampling sketch structure (EDS) for the first time, which samples and statistically estimates data within a sliding window and filters out unreasonable data, enabling rapid extraction of key information. Then, we demonstrate that the approximations output by the EDS structure are theoretically equivalent to adding differential privacy noise to the true values. Finally, to meet the privacy protection strength provided by the user while reflecting the true situation of the original data stream, an adaptive noise addition algorithm based on efficient data stream sampling is proposed. According to the relationship between the user-provided privacy protection strength and the privacy protection strength provided by the EDS structure, the algorithm adaptively generates the final publishable histogram through privacy allocation. Experiments show that compared with existing algorithms, SPF significantly reduces time and space overhead while maintaining the same data usability.

  • Secure Circulation of Data Elements
  • Yunshu Hu , Jun Zhou , Zhenfu Cao , Xiaolei Dong
    doi: 10.7544/issn1000-1239.202440453

    As the development of the emerging areas of network services such as big data and cloud computing, data element has played an increasingly critical role in the fields of intelligent e-health and scientific research. Gene sequencing technology is widely used in many fields to determine the cause and category of a patient’s disease, by processing the patient’s gene sequence. Due to constrained storage and computing resources, local users often need to rent resource-abundant cloud servers, unfortunately always working in untrusted environments, to fulfill the computationally-intensive task of large-scale gene sequencing function evaluation. To guarantee users’ data privacy and the correctness of computing results, most of the state-of-the-art methods exploit the techniques of public key fully homomorphic encryption and secure multiparty computation to achieve data privacy, and the technique of Yao’s garbled circuit or bilinear paring to achieve correctness verification. Owing to the fact that huge computational overhead and communication overhead are required in the cryptographic primitives mentioned above, they are inappropriate for efficiency needs of the resource-constrained local users in gene sequence analysis. To address this challenging issue, in this paper, a lightweight verifiable privacy-preserving gene sequence analysis scheme in the multi-user setting is proposed. Firstly, we design an efficient verifiable multi-key homomorphic data encapsulation mechanism VMK-HDEM. The proposed VMK-HDEM enables batch outsourced function evaluation on L different input instances over the encrypted domain. The usage time complexity of public key encryption on each user $ {S en}_{i} $’s end is O(L), independent of the dataset size $ {n}_{i} $, which significantly decreases the computational cost of local users. For verification, the size of the proof is $ O({deg}_{F}) $ where $ {deg}_{F} $ denotes the degree of the function, independent to the size of user’s dataset $ {n}_{i} $. Furthermore, based on our constructed cryptographic primitive VMK-HDEM, a lightweight and efficient verifiable privacy-preserving gene sequence analysis scheme LWPPGS is proposed. It not only can preserve the privacy of both users’ gene datasets and the results of gene sequence analysis, but also efficiently verify the correctness of the outcome. Finally, formal security proof and experimental simulation results show the security and practicability of our proposed VMK-HDEM and LWPPGS.

  • Secure Circulation of Data Elements
  • Bing Han , Hao Wang , Min Fang , Yongchao Zhang , Lu Zhou , Chunpeng Ge
    doi: 10.7544/issn1000-1239.202440489

    Lightweight mobile devices with limited resources often alleviate their computational and storage burdens by outsourcing large-scale data to cloud storage servers. However, this cloud storage model is susceptible to the possibility of selfish cloud servers discarding data to conserve storage resources. Therefore, there is a need for effective integrity verification of cloud-stored data to ensure its correct and intact storage. Existing cloud storage integrity verification mechanisms lack a reliable approach to perform real-time, multiple verifications of data under the premise of data privacy protection. We propose an integrity verification mechanism based on a trusted execution environment. It generates trustworthy proofs in isolated areas to ensure that the cloud server remains unaware of the data and the entire proof generation process, thereby compelling honest assurance of data integrity throughout the process. To further enhance the security of the proposed solution, we introduce blockchain smart contracts to provide trustworthy storage and verification of proofs. Additionally, we address the issue of resource scarcity on the client side by proposing an efficient verification mechanism based on cuckoo filters. Experimental results demonstrate that this method can achieve high execution efficiency and practicality while ensuring the integrity verification of private data.

  • Secure Circulation of Data Elements
  • Wei Li , Wei Feng , Yu Qin , Dengguo Feng
    doi: 10.7544/issn1000-1239.202440480

    Confidential computing (CC) is based on the hardware TEE, which protects the confidentiality and integrity of data in use through isolation, integrity measurement, and remote attestation, and is protected from attacks by privileged adversaries. However, the measurement and attestation mechanisms of existing CC platforms focus on the launch time integrity instead of the runtime. When potential memory vulnerabilities in user workloads are exploited by adversaries, it can lead to attacks such as control flow hijacking. The existing CC platforms that only protect integrity at startup cannot effectively prevent or detect such runtime attacks. To address that, we propose a scheme of runtime monitoring in CC based on dynamic integrity measurement. By introducing control and data flow measurements into the TEE and verifying the measurements by a trusted verifier, the remote attestation and runtime integrity protection are achieved on the CC platform. The implementation of our prototype on CSV/SEV servers with confidential VM/container architecture shows that the scheme achieves higher runtime security with about 16% performance overhead.

  • Privacy Preserving Based on Blockchain
  • Wenpeng Song , Liang Zhang , Yuhang Ma
    doi: 10.7544/issn1000-1239.202440351

    The continuous rapid development of Internet technology has brought increasing convenience for data sharing. However, data security and privacy issues have also emerged. Taking healthcare as an example, people hope to seek treatment quickly and claim reimbursement promptly, but do not want to disclose their medical records and expenses in hospitals. To adapt to the above data sharing scenarios, we propose a decentralized identity (DID) model based on blockchain and proxy re-encryption (PRE). Further, we achieve a data sharing framework for smart healthcare. Blockchain is leveraged to avoid the problem of single-node failure, ensuring data availability and data consistency. PRE is employed to achieve the separation of data generation, management and usage. This character is identical to that of the DID model, where verifiable credential (VC) issuance and verification are separated. Besides, PRE helps to achieve the goal of patient-centered healthcare. Furthermore, we obtain verifiable presentation (VP) by using the BLS aggregation signatures, which enable us to combine and authenticate multiple VCs. We incorporate blockchain as a decentralized trusted third party to check the correctness of cryptographic operations, achieving data verifiability and audibility in an encrypted mode. Also, we make a scrupulous security analysis of the proposed framework and compare it with related work. Finally, we conduct comprehensive experiments based on Ethereum and IPFS (inter-planetary file system), demonstrating the feasibility and efficiency of our solution.

  • Privacy Preserving Based on Blockchain
  • Yuhong Ke , Chao Lin , Xinyi Huang , Wei Wu , Yujie Chen
    doi: 10.7544/issn1000-1239.202440468

    In the digital era, data have become a core asset for the functioning of society, and identity authentication credentials are among the most critical and sensitive data elements. Traditional password-based authentication methods require servers to store credential information such as usernames and passwords, which poses a serious risk of data leakage. Passwordless authentication technology based on public-key cryptography replaces traditional passwords with public-private key pairs. Users employ their private keys to compute signatures for authentication information, while servers only store public information like public keys, thus eliminating the issue of servers leaking private key information. However, existing passwordless authentication systems face challenges such as incompatibility across multiple platforms, high latency in online authentication, and the difficulty of recovering private keys when devices are lost. Moreover, the transparency and auditability of these systems need improvement. To address these problems, we propose an efficient, multi-platform compatible, passwordless identity authentication scheme based on blockchain technology. The scheme combines FIDO2 passwordless authentication with blockchain, allowing users to generate and upload multiple account public keys to the blockchain network for public verification by service providers. Through optimizations such as offline account pre-registration, pre-computation of signatures, and on-chain data synchronization, the scheme achieves interoperability, low overhead, and scalability for large-scale user authentication. The scheme also incorporates an encrypted backup mechanism, enabling users to recover backup data using stored encrypted keys even if their devices are lost. Furthermore, the scheme leverages the immutable data storage provided by blockchain, allowing all participants to query the status of authentication authorizations, thus enhancing system transparency. We comprehensively evaluate the security and performance of the proposed scheme. Theoretical analysis and experiments show that the proposed scheme reduces online computational overhead by 89.09% and communication overhead by 85.57% compared with similar schemes while maintaining low-latency responses under high-load conditions.

  • Privacy Preserving Based on Blockchain
  • Longlong Zhu , Xiang Chen , Haodong Chen , Jitang Niu , Wenjing Liu , Shengrui Lin , Dong Zhang , Chunming Wu
    doi: 10.7544/issn1000-1239.202440477

    Blockchain suffers from network dynamics and management difficulties, making the anomalies such as DDoS attacks and account takeovers possible. Existing approaches that detect anomalies in blockchains extract features, such as historical transaction information and transaction frequencies, from blockchain accounts to identify anomalies. However, the increasing scale of blockchain data results in the challenge of high memory consumption and low detection accuracy in the feature extraction of existing approaches. To address this challenge, we propose a blockchain anomaly detection mechanism that achieves detection accuracy and reduces resource footprints. This mechanism embraces approximate sketching algorithms to transform the detection of blockchain anomalies into that of malicious accounts, including intra-block accounts and inter-block accounts. For intra-block accounts, i.e., the malicious accounts that occur inside a single block and the mechanism uses sketching algorithms to collectively filter out those accounts with high precision. For inter-block accounts, malicious accounts can be hardly detected by analyzing the information of a single block, it aggregates multi-block information to accurately detect those accounts. We evaluate our mechanism with real Ethereum block data comprising of 88847 blocks. Our results indicate that compared with typical existing approaches, our mechanism improves the recall of detecting blockchain anomalies by up to 6.3 times and the F1 score by up to 4.4 times. Therefore, our proposed blockchain anomaly detection mechanism can bring benefits to regulating blockchain transaction behaviors and maintain system security.

  • Privacy Preserving Based on Blockchain
  • Chuan Zhang , Zihao Wang , Jinwen Liang , Mengxuan Liu , Haotian Deng , Liehuang Zhu
    doi: 10.7544/issn1000-1239.202440472

    With the development of data assetization in enterprises, consortium blockchains have become the core infrastructure for data transactions within enterprise alliances. Constructing a decentralized, tamper-proof, and access-controlled data trading market using consortium blockchains can enhance the credibility of data transactions and reduce the risk of data leakage. However, with the increase in enterprise alliances, how to promote the circulation of data elements across different enterprise alliances and resist security threats such as data privacy leaks, data fraud, and payment repudiation have become an urgent problem in the field of data circulation. To address this, we propose a privacy-preserving data element transaction audit scheme for cross-consortium-blockchains. This scheme uses consortium blockchains for data attestation and employs smart contracts on a relay chain for data verification and payment management. By combining Pedersen commitments and Shamir’s secret sharing techniques, we construct a zero-knowledge proof mechanism to prevent data fraud without disclosing data elements. Additionally, a bilinear mapping-based data element integrity audit mechanism is introduced, allowing for the verification of data element receipts without revealing data privacy, effectively solving the problem of payment repudiation. Through theoretical analysis and experimental evaluation, the proposed scheme’s effectiveness and reliability are verified. The experimental results in a local simulation environment demonstrate that the proposed scheme is feasible and efficient.

  • Privacy Preserving Based on Blockchain
  • Zhenyu Li , Yong Ding , Chen Yi , Hai Liang
    doi: 10.7544/issn1000-1239.202440367

    With the advancement of the new technological revolution and industrial transformation, secure and reliable data circulation has become a pressing issue. To address this, data exchanges have begun leveraging blockchain technology to facilitate data circulation, thereby enhancing trust and regulatory capabilities during the process. However, blockchain technology still faces challenges in handling large-scale data element exchanges efficiently. To improve efficiency in the circulation of data elements via blockchain, we propose a blockchain data exchange acceleration method. Firstly, a dynamic location model for data circulation is introduced to aid data exchanges in managing the direction of data flows. Secondly, a data element aggregation upload method is proposed, enabling deep aggregation of data elements with specified circulation destinations, thus accelerating blockchain data exchange. Thirdly, an optional automatic deduplication download method is presented to address application issues encountered in blockchain-based data circulation. Finally, experimental results demonstrate that the proposed blockchain data exchange acceleration method, when combined with blockchain transaction packaging technologies, significantly enhances the efficiency of data element exchanges. Compared with the asynchronous data exchange method provided by existing blockchain frameworks, our method achieves approximately a 9.24 times improvement in data exchange performance.

  • Privacy Preserving Based on Blockchain
  • Jiakun Hao , Peng Xiang , Yifei He , Jianbo Gao , Zhi Guan , Anming Xie , Zhong Chen
    doi: 10.7544/issn1000-1239.202440456

    In the digital era, data, as a critical factor of production, is essential for economic growth, technological innovation, and enhancing corporate competitiveness. Traditional centralized data trading systems pose a series of data and transaction security risks. Although decentralized data trading systems based on blockchain technology have emerged, which can guarantee security for data transactions through blockchain and smart contracts, systems based on blockchain still struggle with cross-regional, cross-domain, and international data transactions. They primarily face the following three challenges: 1) Consistency of cross-domain identity resolution results. 2) Availability of cross-domain identity resolution services. 3) Security and compliance issues for cross-domain data trading systems. To address these issues, we design a secure and efficient cross-domain identity resolution mechanism based on decentralized identity technology and construct a secure, regulated decentralized data trading system based on this mechanism. The identity resolution mechanism includes a set of cross-domain protocols that ensure the consistency of resolution results and an incentive mechanism that ensures the availability of services executing these protocols. The decentralized data trading system supports granular regulation based on identity attributes and ensures the atomicity of cross-domain data transactions. Experimental verification shows that this system meets the design targets. By batch constructing cross-domain resolution requests, the identity cross-domain resolution protocol and caching mechanism can ensure the correctness of the resolution results, with the resolution latency being only 45% of the cross-domain resolution latency. Additionally, the cache can increase the hit rate by 72% through active and passive update mechanisms. The system is also compatible with multiple blockchain systems, and cross-domain data transactions can be completed within an average of 2.3 blocks, making the system efficiency within an acceptable range.

  • Artificial Intelligence Security for Data Elements
  • Biao Jin , Xiang Lin , Jinbo Xiong , Weijing You , Xuan Li , Zhiqiang Yao
    doi: 10.7544/issn1000-1239.202440413

    Constructing an excellent deep neural network (DNN) model requires a large amount of training data, high-performance equipment, and profound expertise and knowledge. Therefore, DNN models should be regarded as the intellectual property (IP) of their owners. Protecting the IP of a DNN model also underscores the appreciation for the value of the data elements integral to its development and training process. However, DNN models are vulnerable to attacks such as theft, tampering, and illegal dissemination by malicious users. The quest for effective strategies to protect their IP has emerged as a pivotal area of academic research and an urgent challenge confronting the industry. Unlike existing related reviews, we focus on the application scenarios of DNN model watermarking. We mainly review the methodologies for DNN model IP protection based on watermarking technology from two dimensions: robust model watermarking for model copyright declaration and fragile model watermarking for model integrity verification. We discuss their characteristics, advantages, and limitations. Additionally, we elaborate on the practical application of DNN model watermarking technology. Finally, by summarizing the common technologies of various methods, we prognosticate future research directions for DNN model IP protection.

  • Artificial Intelligence Security for Data Elements
  • Jialang Liu , Yanming Guo , Mingrui Lao , Tianyuan Yu , Yulun Wu , Yunhao Feng , Jiazhuang Wu
    doi: 10.7544/issn1000-1239.202440487

    Federated learning is designed for data privacy and data security issues, after a large number of clients are trained locally in a distributed manner, the central server then aggregates the model parameter updates provided by each local client, but the central server is unable to see how these parameters are updated, and this feature creates a serious security issue, i.e., a malicious participant can train a poisoned model and upload the parameters in the local model, and then globally model to introduce backdoor features. In this paper, we focus on the security and robustness research under the scenarios specific to federated learning, i.e., backdoor attack and defense, summarize the scenarios that generate backdoor attacks under federated learning, summarize the latest methods of backdoor attack and defense under federated learning, and compare and analyze the performance of the various attack and defense methods, revealing their advantages and limitations. Finally, we point out various potential directions and new challenges for backdoor attacks and defenses under federated learning.

  • Artificial Intelligence Security for Data Elements
  • Zhen Qin , Tianming Zhuang , Guosong Zhu , Erqiang Zhou , Yi Ding , Ji Geng
    doi: 10.7544/issn1000-1239.202440449

    In recent years, the rapid development of artificial intelligence technology, particularly deep learning, has led to its widespread application in various fields such as computer vision and natural language processing. However, recent research indicates potential security risks associated with these advanced AI models could compromise their reliability. In light of this concern, this survey delves into cutting-edge research findings pertaining to security attacks, attack detection, and defense strategies for artificial intelligence models. Specifically regarding model security attacks, our work focuses on elucidating the principles and technical status of adversarial attacks, model inversion attacks, and model theft attacks. With regards to model attack detection methods explored in this paper, they include defensive distillation techniques, regularization approaches, outlier detection, robust statistics. As for model defense strategies examined in this study, they encompass adversarial training measures, model structure defense mechanisms, query control defenses along with other technical means. This comprehensive survey not only summarizes but also expands upon techniques and methodologies relevant to ensuring the security of artificial intelligence models thereby providing a solid theoretical foundation for their secure applications while simultaneously enabling researchers to gain a better understanding of the current state-of-the-art research within this field facilitating informed decisions when selecting future research directions.

  • Artificial Intelligence Security for Data Elements
  • Yuyu Yin , Guangqiang Wu , Youhuizi Li , Xinyu Wang , Honghao Gao
    doi: 10.7544/issn1000-1239.202440476

    With the accelerated advancement of digitization, data elements have become the core driving force for the operation of modern society. However, at the same time, data security issues have become increasingly prominent, with frequent occurrences of data breaches and privacy violations, causing serious losses to individuals, organizations, and even countries. Against this backdrop, the security of data elements has become the focus of attention from all sectors of society, and the issue of data privacy protection in deep learning models has also attracted widespread attention. Among them, machine unlearning, as a key technology for protecting user’s privacy, aims to enable models to remove the influence of specific data while maintaining generalization performance for remaining data, providing an effective solution for protecting the security of data elements in deep learning models. Existing machine unlearning methods are mainly divided into two categories: exact unlearning and approximate unlearning. However, exact unlearning methods need to intervene in the original training process of the models, while approximate unlearning methods find it difficult to strike a balance between unlearning performance and model generalization ability. To address these issues, we propose an approximate unlearning framework based on feature constraints and adaptive loss balancing. We adopt a “forgetting-recovering” machine unlearning framework. First, for the “forgetting” process, in order to mimic the feature outputs of retrained models for the forgetting samples, we use a randomly initialized model that has not been trained on the forgetting samples to guide the feature outputs of the unlearning model, constraining forgetting at the feature level to avoid easily obtaining forgetting data information from the model. Then, a small amount of data is used for fine-tuning to “recover” the generalization performance of models on the remaining data. At the same time, we regard the above machine unlearning framework as a multi-task optimization problem and introduce adaptive loss balance to automatically balance the “forgetting” and “recovering” tasks, preventing the model from “over-forgetting” or “over-recovering”, so that the “forgetting” and “recovering” tasks can be trained relatively balanced and steadily. Extensive experiments on 3 image classification datasets show that our method can effectively forget the forgetting data and achieve optimal performance in multiple metrics.