Jindan Zhang
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
Research Subjects
Jindan Zhang has a total of 39 co-authors. Here are the top co-authors by number of shared publications:
- Xu An Wang
Key Laboratory of Network and Information Security, Engineering University of People’s Armed Police, Xi’an 710086, China
5 shared publications - Baocang Wang
The State Key Laboratory of Integrated Service Networks, Xidian University, Xi’an 710071, China
4 shared publications - Brij Bhooshan Gupta
Asia University, Taichung, Taiwan
3 shared publications - Nadia Nedjah
State University of Rio de Janeiro
3 shared publications - Peng Li
School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing, China
3 shared publications - Arun Kumar Sangaiah
National Yunlin University of Science and Technology
2 shared publications
Latest Publications
- 9 September 2026
- Published by Elsevier in Internet of Things
- Vol. 40
TT+: A traitor tracing scheme against malicious encryptors for secure sharing of healthcare electronic health records and cloud TV
- 9 September 2026
- Published by Elsevier in Internet of Things
- Vol. 40
TT+: A traitor tracing scheme against malicious encryptors for secure sharing of healthcare electronic health records and cloud TV
- 20 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 71 (2) , 5153-5164
An Incentive Mechanism Considering Privacy Metric for Personalized Application
Edge-based federated learning (EFL) is a solution for personalized applications. It addresses the limitations of cloud-based consumer service systems, such as data privacy and network latency. To further enhance the EFL system’s ability to protect data privacy, differential privacy (DP) is introduced. It is crucial to motivate high-quality collaboration among participants for optimal performance of the DP-EFL system. Researchers primarily focus on efficient learning algorithms, optimized resource scheduling, and user-oriented incentive mechanisms. Existing research exhibits notable limitations in modeling and analyzing the heterogeneity of resource costs (e.g., communication costs), particularly failing to comprehensively account for the additional costs imposed by participants’ privacy protection mechanisms. To address this gap, we propose a novel market transaction model based on Stackelberg game theory. This framework integrates incentive-driven reward allocation mechanisms to rigorously investigate the collaborative behaviors and strategic interactions between edge nodes (ENs) and the cloud server (CS). We incorporate privacy costs into the multidimensional costs of participants with privacy metric, and based on this, derived collaboration strategies between ENs and CS, thus solving the Stackelberg game problem by theoretical analysis. Furthermore, numerical experiments validated the rationality of our proposed model, the impact of strategies on the performance of collaborators, and the advantages over other incentive mechanisms.
- 20 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 71 (2) , 5153-5164
An Incentive Mechanism Considering Privacy Metric for Personalized Application
Edge-based federated learning (EFL) is a solution for personalized applications. It addresses the limitations of cloud-based consumer service systems, such as data privacy and network latency. To further enhance the EFL system’s ability to protect data privacy, differential privacy (DP) is introduced. It is crucial to motivate high-quality collaboration among participants for optimal performance of the DP-EFL system. Researchers primarily focus on efficient learning algorithms, optimized resource scheduling, and user-oriented incentive mechanisms. Existing research exhibits notable limitations in modeling and analyzing the heterogeneity of resource costs (e.g., communication costs), particularly failing to comprehensively account for the additional costs imposed by participants’ privacy protection mechanisms. To address this gap, we propose a novel market transaction model based on Stackelberg game theory. This framework integrates incentive-driven reward allocation mechanisms to rigorously investigate the collaborative behaviors and strategic interactions between edge nodes (ENs) and the cloud server (CS). We incorporate privacy costs into the multidimensional costs of participants with privacy metric, and based on this, derived collaboration strategies between ENs and CS, thus solving the Stackelberg game problem by theoretical analysis. Furthermore, numerical experiments validated the rationality of our proposed model, the impact of strategies on the performance of collaborators, and the advantages over other incentive mechanisms.
- Open Access
- 1 January 2025
- Published by IGI Global Scientific Publishing in International Journal of Data Warehousing and Mining
- Vol. 21 (1) , 1-19
Organizational Impact of Spatiotemporal Graph Convolution Networks for Mobile Communication Traffic Forecasting
Communication traffic prediction is of great guiding significance for communication planning management and improvement of communication service quality. However, due to the complex spatiotemporal correlation and uncertainty caused by the spatial topology and dynamic time characteristics of mobile communication networks, traffic prediction is facing enormous challenges. We propose a mobile traffic prediction method using dynamic spatiotemporal synchronous graph convolutional network (DSSGCN). DSSGCN has designed multiple components, which can effectively capture the heterogeneity in the local space-time map. More specifically, the network not only models the dynamic characteristics of nodes in the spatiotemporal graph of network traffic, but also captures the dynamic spatiotemporal characteristics of the edges of mobile service data with different time stamps. The outputs of these two components are fused by collaborative convolution to obtain the prediction results. Experiments on two ground truth mobile traffic datasets show that our DSSGCN model has good prediction performance.
- 1 January 2025
- Published by IGI Global Scientific Publishing in International Journal of Data Warehousing and Mining
- Vol. 21 (1) , 1-19
Open AccessOrganizational Impact of Spatiotemporal Graph Convolution Networks for Mobile Communication Traffic Forecasting
Communication traffic prediction is of great guiding significance for communication planning management and improvement of communication service quality. However, due to the complex spatiotemporal correlation and uncertainty caused by the spatial topology and dynamic time characteristics of mobile communication networks, traffic prediction is facing enormous challenges. We propose a mobile traffic prediction method using dynamic spatiotemporal synchronous graph convolutional network (DSSGCN). DSSGCN has designed multiple components, which can effectively capture the heterogeneity in the local space-time map. More specifically, the network not only models the dynamic characteristics of nodes in the spatiotemporal graph of network traffic, but also captures the dynamic spatiotemporal characteristics of the edges of mobile service data with different time stamps. The outputs of these two components are fused by collaborative convolution to obtain the prediction results. Experiments on two ground truth mobile traffic datasets show that our DSSGCN model has good prediction performance.
- 24 November 2023
- Published by Elsevier in Pacific-Basin Finance Journal
- Vol. 83, 102214
High-Speed Rail Launch: A Natural Experiment on Geographic Location and Cash Dividends
- 24 November 2023
- Published by Elsevier in Pacific-Basin Finance Journal
- Vol. 83, 102214
High-Speed Rail Launch: A Natural Experiment on Geographic Location and Cash Dividends
- 1 January 2023
- Published by Inderscience Publishers in International Journal of Grid and Utility Computing
- Vol. 14 (5) , 469-479
Improved identity-based proxy-oriented outsourcing with public auditing for secure cloud storage
- 1 January 2023
- Published by Inderscience Publishers in International Journal of Grid and Utility Computing
- Vol. 14 (5) , 469-479
Improved identity-based proxy-oriented outsourcing with public auditing for secure cloud storage
- Open Access
- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in Mathematical Biosciences and Engineering
- Vol. 20 (5) , 7905-7921
Improved cloud storage auditing scheme with deduplication
Cloud storage has become a crucial service for many users who deal with big data. The auditing scheme for cloud storage is a mechanism that checks the integrity of outsourced data. Cloud storage deduplication is a technique that helps cloud service providers save on storage costs by storing only one copy of a file when multiple users outsource the same file to cloud servers. However, combining storage auditing and deduplication techniques can be challenging. To address this challenge, in 2019 Hou et al. proposed a cloud storage auditing scheme with deduplication that supports different security levels of data popularity. This proposal is interesting and has practical applications. However, in this paper, we show that their proposal has a flaw: the cloud or other adversaries can easily forge the data block's authenticators, which means the cloud can delete all the outsourced encrypted data blocks but still provide correct storage proof for the third-party auditor. Based on Hou et al.'s scheme, we propose an improved cloud storage auditing scheme with deduplication and analyze its security. The results show that the proposed scheme is more secure.
- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in Mathematical Biosciences and Engineering
- Vol. 20 (5) , 7905-7921
Open AccessImproved cloud storage auditing scheme with deduplication
Cloud storage has become a crucial service for many users who deal with big data. The auditing scheme for cloud storage is a mechanism that checks the integrity of outsourced data. Cloud storage deduplication is a technique that helps cloud service providers save on storage costs by storing only one copy of a file when multiple users outsource the same file to cloud servers. However, combining storage auditing and deduplication techniques can be challenging. To address this challenge, in 2019 Hou et al. proposed a cloud storage auditing scheme with deduplication that supports different security levels of data popularity. This proposal is interesting and has practical applications. However, in this paper, we show that their proposal has a flaw: the cloud or other adversaries can easily forge the data block's authenticators, which means the cloud can delete all the outsourced encrypted data blocks but still provide correct storage proof for the third-party auditor. Based on Hou et al.'s scheme, we propose an improved cloud storage auditing scheme with deduplication and analyze its security. The results show that the proposed scheme is more secure.
- Open Access
- 17 November 2022
- Published by Springer Nature in Cluster Computing
- Vol. 26 (5) , 3017-3035
Privacy protection framework for face recognition in edge-based Internet of Things
Edge computing (EC) gets the Internet of Things (IoT)-based face recognition systems out of trouble caused by limited storage and computing resources of local or mobile terminals. However, data privacy leak remains a concerning problem. Previous studies only focused on some stages of face data processing, while this study focuses on the privacy protection of face data throughout its entire life cycle. Therefore, we propose a general privacy protection framework for edge-based face recognition (EFR) systems. To protect the privacy of face images and training models transmitted between edges and the remote cloud, we design a local differential privacy (LDP) algorithm based on the proportion difference of feature information. In addition, we also introduced identity authentication and hash technology to ensure the legitimacy of the terminal device and the integrity of the face image in the data acquisition phase. Theoretical analysis proves the rationality and feasibility of the scheme. Compared with the non-privacy protection situation and the equal privacy budget allocation method, our method achieves the best balance between availability and privacy protection in the numerical experiment.
- 17 November 2022
- Published by Springer Nature in Cluster Computing
- Vol. 26 (5) , 3017-3035
Open AccessPrivacy protection framework for face recognition in edge-based Internet of Things
Edge computing (EC) gets the Internet of Things (IoT)-based face recognition systems out of trouble caused by limited storage and computing resources of local or mobile terminals. However, data privacy leak remains a concerning problem. Previous studies only focused on some stages of face data processing, while this study focuses on the privacy protection of face data throughout its entire life cycle. Therefore, we propose a general privacy protection framework for edge-based face recognition (EFR) systems. To protect the privacy of face images and training models transmitted between edges and the remote cloud, we design a local differential privacy (LDP) algorithm based on the proportion difference of feature information. In addition, we also introduced identity authentication and hash technology to ensure the legitimacy of the terminal device and the integrity of the face image in the data acquisition phase. Theoretical analysis proves the rationality and feasibility of the scheme. Compared with the non-privacy protection situation and the equal privacy budget allocation method, our method achieves the best balance between availability and privacy protection in the numerical experiment.
- Open Access
- 4 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 23 (10) , 19760-19771
Vehicle and Pedestrian Detection Algorithm Based on Lightweight YOLOv3-Promote and Semi-Precision Acceleration
Aiming at the shortcomings of the current YOLOv3 model, such as large size, slow response speed, and difficulty in deploying to real devices, this paper reconstructs the target detection model YOLOv3, and proposes a new lightweight target detection network YOLOv3-promote: Firstly, the G-Module combined with the Depth-Wise convolution is used to construct the backbone network of the entire model, and the attention mechanism is introduced and added to perform weighting operations on each channel to get more key features and remove redundant features, thereby strengthening the identification ability of feature network model’s to distinguish target objects among background; Secondly, in order to delete some less important channels to achieve the effect of compressing the model size and improving the calculation speed, the size of the scaling factor gamma in the batch normalization layer is used; Finally, based on NVIDIA’s TensorRT framework model conversion and half-precision acceleration were carried out, and the accelerated model was successfully deployed on the embedded platform Jetson Nano. The performed KITTI experimental results show that the inference speed of our proposed method is about 5 times that of the original model, the parameter volume is reduced to one tenth, the mAP is increased from 86.1% of the original model to 93.1%, and the FPS reaches 25.5fps, realizing the requirements of real-time detection with high precision.
- 4 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 23 (10) , 19760-19771
Open AccessVehicle and Pedestrian Detection Algorithm Based on Lightweight YOLOv3-Promote and Semi-Precision Acceleration
Aiming at the shortcomings of the current YOLOv3 model, such as large size, slow response speed, and difficulty in deploying to real devices, this paper reconstructs the target detection model YOLOv3, and proposes a new lightweight target detection network YOLOv3-promote: Firstly, the G-Module combined with the Depth-Wise convolution is used to construct the backbone network of the entire model, and the attention mechanism is introduced and added to perform weighting operations on each channel to get more key features and remove redundant features, thereby strengthening the identification ability of feature network model’s to distinguish target objects among background; Secondly, in order to delete some less important channels to achieve the effect of compressing the model size and improving the calculation speed, the size of the scaling factor gamma in the batch normalization layer is used; Finally, based on NVIDIA’s TensorRT framework model conversion and half-precision acceleration were carried out, and the accelerated model was successfully deployed on the embedded platform Jetson Nano. The performed KITTI experimental results show that the inference speed of our proposed method is about 5 times that of the original model, the parameter volume is reduced to one tenth, the mAP is increased from 86.1% of the original model to 93.1%, and the FPS reaches 25.5fps, realizing the requirements of real-time detection with high precision.
- 16 May 2021
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 33 (19) , e6366
Customer‐oriented sales modeling strategy in a big data environment
In order to provide personally oriented solutions in sales strategies for different retailers in the fierce market competition,data mining is being increasingly used in retail industry. We use customer‐oriented data mining technology to extract valuable information from a great amount of historical commercial data, so that we can provide different sales promotions for merchants to extend the business. "Small profits and quick returns" is a popular sales strategy to increase sales volume by many shopping malls. By using statistical modeling, we establish a mathematical model to analysis the relationships among the discount rate,the turnover and the profit margin according to the historical sales data of a shopping mall in recent two years. Base on this,the paper conducts the empirical research on small profits and quick returns and make sales recommendations on promotions. Our analysis indicates that the effect of discount rate on turnover is greater than the effect of profit rate on turnover in the retail industry. It is also necessary to consider the different nature of goods. The final computing results are also influenced by different types of goods. Furthermore, we consider the classification of goods into three types: the sell‐well goods, the common goods, and the unsalable goods and analyze them in the similar framework. The paper shows that there are different characteristics for the different types.
- 16 May 2021
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 33 (19) , e6366
Customer‐oriented sales modeling strategy in a big data environment
In order to provide personally oriented solutions in sales strategies for different retailers in the fierce market competition,data mining is being increasingly used in retail industry. We use customer‐oriented data mining technology to extract valuable information from a great amount of historical commercial data, so that we can provide different sales promotions for merchants to extend the business. "Small profits and quick returns" is a popular sales strategy to increase sales volume by many shopping malls. By using statistical modeling, we establish a mathematical model to analysis the relationships among the discount rate,the turnover and the profit margin according to the historical sales data of a shopping mall in recent two years. Base on this,the paper conducts the empirical research on small profits and quick returns and make sales recommendations on promotions. Our analysis indicates that the effect of discount rate on turnover is greater than the effect of profit rate on turnover in the retail industry. It is also necessary to consider the different nature of goods. The final computing results are also influenced by different types of goods. Furthermore, we consider the classification of goods into three types: the sell‐well goods, the common goods, and the unsalable goods and analyze them in the similar framework. The paper shows that there are different characteristics for the different types.
- 1 January 2021
- Published by Inderscience Publishers in International Journal of High Performance Systems Architecture
- Vol. 10 (1) , 20
New digital signature algorithm based on ECC and its application in bitcoin and IoT
- 1 January 2021
- Published by Inderscience Publishers in International Journal of High Performance Systems Architecture
- Vol. 10 (1) , 20
New digital signature algorithm based on ECC and its application in bitcoin and IoT