Zifeng Xu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Zifeng Xu has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Fucai Zhou
School of Software, Northeastern University, Shenyang, China
7 shared publications - Qiang Wang
Northeastern University
3 shared publications - Shiyue Qin
School of Computer Science and Engineering, Northeastern University, Shenyang, China
2 shared publications - Zongye Zhang
Software College, Northeastern University, Shenyang, China
2 shared publications Chao Wang
Hainan University
1 shared publicationDuoqiang Li
Hainan University
1 shared publication
Latest Publications
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 118353-118366
FSP-YOLO: A Lightweight Algorithm for Ship Detection in SAR Images Under Complex Backgrounds
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 118353-118366
Open AccessFSP-YOLO: A Lightweight Algorithm for Ship Detection in SAR Images Under Complex Backgrounds
- Open Access
- 22 November 2020
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2020, 1-13
Privacy-Preserving Graph Operations for Mobile Authentication
Along with the fast development of wireless technologies, smart devices have become an integral part of our daily life. Authentication is one of the most common and effective methods for these smart devices to prevent unauthorized access. Moreover, smart devices tend to have limited computing power, and they may possess sensitive data. In this paper, we investigate performing graph operations in a privacy-preserving manner, which can be used for anonymous authentication for smart devices. We propose two protocols that allow two parties to jointly compute the intersection and union of their private graphs. Our protocols utilize homomorphic encryption to prevent information leakage during the process, and we provide security proofs of the protocols in the semihonest setting. At last, we implement and evaluate the efficiency of our protocols through experiments on real-world graph data.
- 22 November 2020
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2020, 1-13
Open AccessPrivacy-Preserving Graph Operations for Mobile Authentication
Along with the fast development of wireless technologies, smart devices have become an integral part of our daily life. Authentication is one of the most common and effective methods for these smart devices to prevent unauthorized access. Moreover, smart devices tend to have limited computing power, and they may possess sensitive data. In this paper, we investigate performing graph operations in a privacy-preserving manner, which can be used for anonymous authentication for smart devices. We propose two protocols that allow two parties to jointly compute the intersection and union of their private graphs. Our protocols utilize homomorphic encryption to prevent information leakage during the process, and we provide security proofs of the protocols in the semihonest setting. At last, we implement and evaluate the efficiency of our protocols through experiments on real-world graph data.
- Open Access
- 13 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 66828-66838
Privacy-Preserving Image Retrieval and Sharing in Social Multimedia Applications
Every day social multimedia applications generate millions of images. To handle such huge amount of images, an optimal solution is using the public cloud, since it has powerful storage capability. Images usually contain a wealth of sensitive information, therefore social service providers need not only to provide services such as retrieval and sharing but also to protect the privacies of the images. In this paper, we propose a privacy-preserving scheme for content-based image retrieval and sharing in social multimedia applications. First, the users extract visual features from the images, and perform locality-sensitive hashing functions on visual features to generate image profile vectors. We then model the retrieval on the images as the equality search on the image profile vectors. To enable accurate and efficient retrieval, we design the secure index structure based on cuckoo hashing, which has constant lookup time. To meet the requirements of dynamic image updating, we enrich our service with image insertion and deletion. In order to reduce the key management overhead and the access control overhead in social applications, we process keys using secret sharing techniques to enable the users holding similar images to query and decrypt images independently. Finally we implement the prototype of the proposed scheme, and perform experiments over encrypted image databases.
- 13 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 66828-66838
Open AccessPrivacy-Preserving Image Retrieval and Sharing in Social Multimedia Applications
Every day social multimedia applications generate millions of images. To handle such huge amount of images, an optimal solution is using the public cloud, since it has powerful storage capability. Images usually contain a wealth of sensitive information, therefore social service providers need not only to provide services such as retrieval and sharing but also to protect the privacies of the images. In this paper, we propose a privacy-preserving scheme for content-based image retrieval and sharing in social multimedia applications. First, the users extract visual features from the images, and perform locality-sensitive hashing functions on visual features to generate image profile vectors. We then model the retrieval on the images as the equality search on the image profile vectors. To enable accurate and efficient retrieval, we design the secure index structure based on cuckoo hashing, which has constant lookup time. To meet the requirements of dynamic image updating, we enrich our service with image insertion and deletion. In order to reduce the key management overhead and the access control overhead in social applications, we process keys using secret sharing techniques to enable the users holding similar images to query and decrypt images independently. Finally we implement the prototype of the proposed scheme, and perform experiments over encrypted image databases.
- Open Access
- 12 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 50472-50484
Privacy-Preserving Substring Search on Multi-Source Encrypted Gene Data
Substring searching on gene sequence data is widely used for analyzing the association between a list of gene mutations and a specific disease. As substring search usually has a high computational cost, deploying it in the cloud has become a popular solution. Moreover, the cloud allows easier data sharing among medical organizations. Since the gene data contains private information, medical organizations usually outsource encrypted gene data to the cloud and selectively share with others. Most existing solutions for the privacy-preserving substring search problem are based on searchable encryption. However, they mainly focus on single-source gene data, not suitable for handling multi-source gene data because of some practical weaknesses. In this paper, we propose a cryptographic scheme that supports privacy-preserving substring search on multi-source encrypted gene data. The cloud can authorize queriers with access control and perform substring searches over the multi-source encrypted gene data for them. Despite the outsourced gene data is encrypted with different keys, but the authorized querier can issue a substring search only uses its own key. We adopt the composite order bilinear map as the primary underlying cryptographic primitive of our scheme. We mainly focus on protecting the privacy of the outsourced gene data and the substring queries, and we provide a security analysis under the honest-but-curious model. We also perform experiments on different datasets and analyze the experimental results in terms of computation cost and communication cost. The analyses show that our scheme is secure and efficient for substring search on multi-source encrypted gene data.
- 12 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 50472-50484
Open AccessPrivacy-Preserving Substring Search on Multi-Source Encrypted Gene Data
Substring searching on gene sequence data is widely used for analyzing the association between a list of gene mutations and a specific disease. As substring search usually has a high computational cost, deploying it in the cloud has become a popular solution. Moreover, the cloud allows easier data sharing among medical organizations. Since the gene data contains private information, medical organizations usually outsource encrypted gene data to the cloud and selectively share with others. Most existing solutions for the privacy-preserving substring search problem are based on searchable encryption. However, they mainly focus on single-source gene data, not suitable for handling multi-source gene data because of some practical weaknesses. In this paper, we propose a cryptographic scheme that supports privacy-preserving substring search on multi-source encrypted gene data. The cloud can authorize queriers with access control and perform substring searches over the multi-source encrypted gene data for them. Despite the outsourced gene data is encrypted with different keys, but the authorized querier can issue a substring search only uses its own key. We adopt the composite order bilinear map as the primary underlying cryptographic primitive of our scheme. We mainly focus on protecting the privacy of the outsourced gene data and the substring queries, and we provide a security analysis under the honest-but-curious model. We also perform experiments on different datasets and analyze the experimental results in terms of computation cost and communication cost. The analyses show that our scheme is secure and efficient for substring search on multi-source encrypted gene data.
- 29 May 2019
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 32 (16) , e5362
Graph encryption for all‐path queries
Summary: Since cloud computing and cloud storage have become a common practice in our daily life, people are paying more attention on protecting the privacy of their sensitive data. In this paper, we consider the problem of graph encryption in such a way that one can perform all‐path queries over an encrypted graph in a privacy‐preserving manner. A solution for such problem has many potential applications in network virtualization since graph data structures are commonly used to represent the topology of substrate and virtual networks. We propose a searchable symmetric encryption scheme for graph data that support all‐path queries. The scheme allows a client to encrypt a sensitive graph and outsource it to an untrusted server for storage. After that, the client can perform arbitrary all‐path queries between a source and a destination. For each query, the server computes and returns all the paths that satisfied the query. We prove that our scheme is secure against adaptive chosen‐query attacks in the semi‐honest setting.
- 29 May 2019
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 32 (16) , e5362
Graph encryption for all‐path queries
Summary: Since cloud computing and cloud storage have become a common practice in our daily life, people are paying more attention on protecting the privacy of their sensitive data. In this paper, we consider the problem of graph encryption in such a way that one can perform all‐path queries over an encrypted graph in a privacy‐preserving manner. A solution for such problem has many potential applications in network virtualization since graph data structures are commonly used to represent the topology of substrate and virtual networks. We propose a searchable symmetric encryption scheme for graph data that support all‐path queries. The scheme allows a client to encrypt a sensitive graph and outsource it to an untrusted server for storage. After that, the client can perform arbitrary all‐path queries between a source and a destination. For each query, the server computes and returns all the paths that satisfied the query. We prove that our scheme is secure against adaptive chosen‐query attacks in the semi‐honest setting.
- 1 December 2018
- Published by Zhejiang University Press in Frontiers of Information Technology & Electronic Engineering
- Vol. 19 (12) , 1558-1568
Faster fog-aided private set intersectionwith integrity preserving
Private set intersection (PSI) allows two parties to compute the intersection of their private sets while revealing nothing except the intersection. With t
- 1 December 2018
- Published by Zhejiang University Press in Frontiers of Information Technology & Electronic Engineering
- Vol. 19 (12) , 1558-1568
Faster fog-aided private set intersectionwith integrity preserving
Private set intersection (PSI) allows two parties to compute the intersection of their private sets while revealing nothing except the intersection. With t
- Open Access
- 22 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 5, 26990-27001
Identity-Based Public Multi-Replica Provable Data Possession
Cloud storage has been gaining tremendous popularity, which provides facilitative data storage and sharing services for distributed clients. To maximize the availability and reliability, some customers may store multiple replicas of critical data on cloud servers. However, cloud servers may collude to make it look like they are storing multiple copies of data, whereas in fact they only store a single copy. Currently, several multi-replica provable data possession schemes have been proposed to provide verifications to ensure that all the outsourced copies are actually stored and maintained intact. For these schemes with third-party verifications, correctly choosing public keys of data owners relies on Public Key Infrastructure (PKI), which is complicated and resource consuming. In this paper, we propose a novel identity-based public multi-replica provable data possession scheme, namely IDPMR-PDP, to provide third-party verification of outsourced data with multiple replicas without PKI. We also introduce a formal security model of identity-based public multi-replica PDP schemes and prove that IDPMR-PDP is secure against malicious cloud servers and privacy-preserving against curious verifiers under this model. Meanwhile, our analyses and simulation results demonstrate that IDPMR-PDP realizes efficient integrity verification.
- 22 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 5, 26990-27001
Open AccessIdentity-Based Public Multi-Replica Provable Data Possession
Cloud storage has been gaining tremendous popularity, which provides facilitative data storage and sharing services for distributed clients. To maximize the availability and reliability, some customers may store multiple replicas of critical data on cloud servers. However, cloud servers may collude to make it look like they are storing multiple copies of data, whereas in fact they only store a single copy. Currently, several multi-replica provable data possession schemes have been proposed to provide verifications to ensure that all the outsourced copies are actually stored and maintained intact. For these schemes with third-party verifications, correctly choosing public keys of data owners relies on Public Key Infrastructure (PKI), which is complicated and resource consuming. In this paper, we propose a novel identity-based public multi-replica provable data possession scheme, namely IDPMR-PDP, to provide third-party verification of outsourced data with multiple replicas without PKI. We also introduce a formal security model of identity-based public multi-replica PDP schemes and prove that IDPMR-PDP is secure against malicious cloud servers and privacy-preserving against curious verifiers under this model. Meanwhile, our analyses and simulation results demonstrate that IDPMR-PDP realizes efficient integrity verification.
- 24 February 2016
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 28 (11) , 3238-3253
Bilinear‐map accumulator‐based verifiable intersection operations on encrypted data in cloud
Summary: The intersection operation on multisets has many applications in different scenarios, such as data mining and pattern matching. This motivates us to study the problem that when users outsource their private encrypted sets and delegate the set‐intersection operation on the corresponding plaintexts to the cloud, the cloud can manage to conduct the operation and make the result verifiable without the decryption capability. We formally introduced a model of Verifiable Intersection Operations on Encrypted Data in Cloud and presented the definitions of the correctness and security properties. We also proposed a concrete scheme basing on the bilinear‐map accumulator and re‐encryption. The scheme was proved secure under some cryptographic assumptions. And the experimental results of the algorithm implementation show the scheme is partly practical for real scenarios. Copyright © 2016 John Wiley & Sons, Ltd.
- 24 February 2016
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 28 (11) , 3238-3253
Bilinear‐map accumulator‐based verifiable intersection operations on encrypted data in cloud
Summary: The intersection operation on multisets has many applications in different scenarios, such as data mining and pattern matching. This motivates us to study the problem that when users outsource their private encrypted sets and delegate the set‐intersection operation on the corresponding plaintexts to the cloud, the cloud can manage to conduct the operation and make the result verifiable without the decryption capability. We formally introduced a model of Verifiable Intersection Operations on Encrypted Data in Cloud and presented the definitions of the correctness and security properties. We also proposed a concrete scheme basing on the bilinear‐map accumulator and re‐encryption. The scheme was proved secure under some cryptographic assumptions. And the experimental results of the algorithm implementation show the scheme is partly practical for real scenarios. Copyright © 2016 John Wiley & Sons, Ltd.