FCFei Chen

Fei Chen

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Fei Chen has a total of 115 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Secure Edge Data Auditing with Multiple Vendors and Servers

    by Haojun Miao, Zifeng Qin, Fei Chen

    Mobile Edge Computing (MEC) has emerged as a key enabler for latency-sensitive applications by bringing computation and data storage closer to end users. Ensuring Edge Data Integrity (EDI) in MEC environments has thus become increasingly critical. While existing work primarily addresses Single-Vendor Multi-Server Edge Data Integrity (SVMS-EDI), practical MEC deployments often involve multiple application vendors (AVs) sharing edge servers. This multi-vendor setting introduces significant computation and communication overhead and weakens trust assumptions, as AVs cannot be fully trusted under the Multi-Vendor Multi-Server (MVMS) model. Consequently, robust solutions tailored to MVMS-EDI are needed. This paper presents MVMS-HMAC, a novel scheme that combines HMAC-based verification with distributed ledger to efficiently and securely address the MVMS-EDI problem. The scheme effectively mitigates key threats, including cheating by malicious AVs and forge, replace, and replay attacks from compromised edge servers. Through selective auditing, MVMS-HMAC minimizes computation and communication costs while preserving strong security guarantees. Theoretical analysis and experiments confirm its correctness, security, and efficiency, demonstrating clear advantages over existing approaches. Our work advances the field by providing a comprehensive MVMS-EDI problem model, a practical security framework, and an open-source implementation to support adoption.


  • Decentralized Self-Auditing Multiple Cloud Storage in Compressed Provable Data Possession

    by Yang Yang, Yanjiao Chen, Ping Xiong, Fei Chen, Jing Chen

    As cloud storage becomes popular, more and more users tend to outsource their data to powerful cloud severs. To prevent a single point of failure, users prefer to store data on multiple cloud servers from different cloud service providers. However, after outsourcing data to cloud servers, users lose the control of their data, which may incur many serious security issues, such as abnormal data tampering and deleting. It is necessary for users to audit multiple cloud storage aperiodically. In this article, we aim to design a decentralized self-auditing solution for multiple cloud storage, in which cloud servers can audit the integrity of each other, and thus no third-party entity is required. First, based on basic algebra, our protocol realizes decentralized self-auditing multiple cloud storage that only involves encrypted user data. Second, we design a proof exchanging mechanism, making any number of cloud servers form the same final integrity proof with a linear number of interactions. Third, our solution can achieve cloud dynamics, which can freely enable and disable a cloud server to provide storage service. At last, security proof and performance evaluation show that the proposed protocol has provable security and high efficiency.


  • A Two-Stage Approach for Fair Data Trading Based on Blockchain

    by Fei Chen, Haohui Zhang, Tao Xiang, Joseph K. Liu

    How to enable fairness for e-commerce applications has attracted years of research. Recent research has proposed employing blockchain smart contract as an efficient trusted third party (TTP) to enable fair data trading. However, the state-of-the-art schemes suffer from two issues, i.e., they either fail to work for situations where data validity cannot be encoded as an oracle function in the smart contract, or leak data to attackers for free. To resolve these issues, this paper proposes a two-stage approach for blockchain-based fair data trading. The main idea is to employ a lightweight off-chain TTP and an on-chain smart contract to handle dispute issues. Both the TTP and smart contract only require a logarithmic complexity for making arbitration in case of disputes; moreover, they are not invoked when there is no dispute. The rationale is that although the off-chain TTP cannot be eliminated, it is only needed in a minimal sense to judge the validity of the traded data. The proposed approach designs a new cryptographic protocol that combines sampling, commitment schemes, and encryption schemes to achieve this logarithmic efficiency. The proposed approach also features privacy protection. Experimental evaluation of the public Ethereum blockchain confirms that the proposed approach is practically usable. Specifically, for a dataset of 15GB, the off-chain computation for each trading party costs approximately 80 seconds while on-chain computation costs around 30 seconds; the additional storage cost is around 9MB; the gas cost is approximately 2.23 million GWei.


  • Open Access

    Hybrid HP-BOA: An Optimized Framework for Reliable Storage of Cloud Data Using Hybrid Meta-Heuristic Algorithm

    by Adnan Tahir, Fei Chen, Bashir Hayat, Qaisar Shaheen, Zhong Ming, Arshad Ahmad, Ki-Il Kim, Byung Hyun Lim

    The prime objective of the cloud data storage process is to make the service, irrespective of being infinitely extensible, a more reliable storage and low-cost model that also encourages different data storage types. Owing to the storage process, it must satisfy the cloud users’ prerequisites. Nevertheless, storing massive amounts of data becomes critical as this affectsthe data quality or integrity. Hence, this poses various challenges for existing methodologies. An efficient, reliable cloud storage model is proposed using a hybrid heuristic approach to overcome the challenges. The prime intention of the proposed system is to store the data effectively in the cloud environment by resolving two constraints, which are general and specific (structural). The cloud data were initially gathered and used to analyze the storage performance. Since the data were extensive, different datasets and storage devices were considered. Every piece of data was specified by its corresponding features, whereas the devices were characterized by the hardware or software components. Subsequently, the objective function was formulated using the network’s structural and general constraints. The structural constraints were determined by the interactions between the devices and data instances in the cloud. Then, the general constraints regarding the data allocation rules and device capacity were defined. To mitigate the constraints, the components were optimized using the Hybrid Pelican–Billiards Optimization Algorithm (HP-BOA) to store the cloud data. Finally, the performance was validated, and the results were analyzed and compared against existing approaches. Thus, the proposed model exhibited the desired results for storing cloud data appropriately.


  • Cloud Object Storage Synchronization: Design, Analysis, and Implementation

    by Fei Chen, Zhipeng Li, Changkun Jiang, Tao Xiang, Yuanyuan Yang

    Cloud storage synchronization among different computing terminals has attracted large-scale uses among enterprise and individual users. It enables users to maintain the same copy of data in real time, which eases users the tedious yet error-prone data management burden. However, existing cloud storage synchronization systems are in a closed form. Users are fixed to a certain cloud service provider, which makes it hard to transfer from one provider to another when balancing factors such as performance, cost, security, etc. To bridge this gap, this article proposes a new synchronization system based on standard cloud object storage. Specifically, we first formulate the cloud object storage synchronization problem by defining some useful concepts. We then use the idea of state encoding and a push-pull paradigm to propose a cloud object storage synchronization system. The proposed system supports real-time, multiple-terminal, and cloud-independent storage synchronization. We also prototyped the proposed system. The experimental results show that the proposed system is promising for practical usages.


  • Protecting Vaccine Safety: An Improved, Blockchain-Based, Storage-Efficient Scheme

    by Laizhong Cui, Zhe Xiao, Fei Chen, Hua Dai, Jianqiang Li

    In recent years, vaccine safety incidents have occurred frequently. To protect vaccine safety, researchers have proposed to use blockchain to secure the vaccine circulation process. Technically, blockchain has some limitations in solving vaccine and other supply chain problems, such as large on-chain storage consumption and low throughput. To better alleviate these restrictions, we propose an improved, blockchain-based, storage-efficient vaccine safety protection scheme in this work. Specifically, we first model the vaccine circulation process. We then design a system to protect vaccine circulation using blockchain, cloud, and cryptographic mechanisms. The proposed system leverages the cloud to implement the vaccine circulation model. Correspondingly, it uses the blockchain to store circulating data certificates and signatures. We evaluated the proposed conceptual model using a consortium blockchain. The experimental results show that the proposed system is efficient.


  • An Efficient Identity-Based Provable Data Possession Protocol With Compressed Cloud Storage

    by Yang Yang, Yanjiao Chen, Fei Chen, Jing Chen

    Cloud storage is more and more prevalent in practice, and thus how to check its integrity becomes increasingly essential. A classical solution is identity-based (ID-based) provable data possession (PDP), which supports certificateless cloud storage auditing without entire user data. However, existing ID-PDP protocols always require that cloud users outsource data blocks, authenticators and a small-sized file tag to the cloud, and make use of the heavy elliptic curve cryptography over bilinear pairing. These disadvantages would result in vast storage, communication, and computation costs, which is unexpected, especially for resource-limited cloud users. To improve the performance, this paper proposes a novel cryptographic primitive: ID-based PDP with compressed cloud storage. In this model, cloud storage auditing can be achieved by using only encrypted data blocks in a self-verified way, and original data blocks can be reconstructed from the outsourced data. Thus, data owners no longer need to store original data blocks on the cloud. We also use some basic algebraic operations to realize a concrete ID-based PDP protocol with compressed cloud storage, which is quite efficient due to no heavy cryptographic operations involved. The proposed protocol can easily be extended to support the other practical functions by using the primitive replacement technique. The proposed protocol is strictly proven to have the properties of correctness, privacy, unforgeability and detectability. Finally, we give plenty of theoretical analysis and experimental results to validate the efficiency of the proposed protocol.