Jun Shen
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
Jun Shen has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Xiaofeng Chen
State Key Laboratory of Integrated Service Networks (ISN), Xidian University, Xi'an, China
4 shared publications - Willy Susilo
Institute of Cybersecurity and Cryptology, School of Computing and Information Technology, University of Wollongong, Wollongong, NSW 2522, Australia
3 shared publications - Dengzhi Liu
School of Computer Engineering, Jiangsu Ocean University, Lianyungang, China
2 shared publications - Jian Shen
Zhejiang Sci-Tech University
2 shared publications - Jianghong Wei
State Key Laboratory of Mathematical Engineering and Advanced Computing
2 shared publications - Aniello Castiglione
University of Salerno
1 shared publication
Latest Publications
- 19 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (4) , 7659-7672
CL-ERDA: Certificateless Recoverable Data Auditing With Corruption Localization in Edge Computing
Edge computing paradigm deploys infrastructures on users' edge side, enabling data to be stored in edge storage systems. Thus edge computing finds a balance between remote cloud storage with high latency and local storage with limited resources. However, the frequent update of edge data increases the probability of data corrupting. To ensure availability and integrity of edge data without affecting future use, this paper proposes a certificateLess edge recoverable data auditing (CL-ERDA) approach with corruption localization. First, the certificateless network coding signature in CL-ERDA is utilized to generate the homomorphic authenticator, addressing public key certificate management issues while avoiding insecure key escrow problems. Then, CL-ERDA designs a two-phase auditing method, where only file-level aggregation proofs are respond in first phase of external check and the second phase of self-check is launched only when damaged data is detected, reducing communication overhead of the auditing. Moreover, CL-ERDA combines hierarchical check method with batch localization method to achieve locating efficiently all the corrupted data at one time rather than locating only one corrupted data at once. Finally, security analysis shows that the proposed scheme resists various attacks and supports the unforgeability of authenticators. Experimental results demonstrate that CL-ERDA is efficient in auditing and corruption localization.
- 19 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (4) , 7659-7672
CL-ERDA: Certificateless Recoverable Data Auditing With Corruption Localization in Edge Computing
Edge computing paradigm deploys infrastructures on users' edge side, enabling data to be stored in edge storage systems. Thus edge computing finds a balance between remote cloud storage with high latency and local storage with limited resources. However, the frequent update of edge data increases the probability of data corrupting. To ensure availability and integrity of edge data without affecting future use, this paper proposes a certificateLess edge recoverable data auditing (CL-ERDA) approach with corruption localization. First, the certificateless network coding signature in CL-ERDA is utilized to generate the homomorphic authenticator, addressing public key certificate management issues while avoiding insecure key escrow problems. Then, CL-ERDA designs a two-phase auditing method, where only file-level aggregation proofs are respond in first phase of external check and the second phase of self-check is launched only when damaged data is detected, reducing communication overhead of the auditing. Moreover, CL-ERDA combines hierarchical check method with batch localization method to achieve locating efficiently all the corrupted data at one time rather than locating only one corrupted data at once. Finally, security analysis shows that the proposed scheme resists various attacks and supports the unforgeability of authenticators. Experimental results demonstrate that CL-ERDA is efficient in auditing and corruption localization.
- 12 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. PP (00189545) , 1-17
DRL-Based Robust Adaptive Traffic Signal Control with Low V2I Penetration Rate under Mixed Environment
Deep Reinforcement Learning (DRL) has become a widely adopted approach for adaptive traffic signal control, owing to its flexibility and effectiveness. However, DRL faces dimensionality and convergence challenges in large-scale multi-agent settings. Additionally, simplified representations of traffic conditions limit adaptability under mixed environments with pedestrians and weather factors. Moreover, in Vehicular Ad-Hoc Networks (VANETs) scenarios, low Vehicle-to-Infrastructure (V2I) penetration exacerbates the complexity of traffic observation and coordination. In this paper, we propose a DRL-based robust adaptive traffic signal control with a low V2I penetration rate under mixed environment (DRATSC). Specifically, DRATSC builds upon the Multi-Agent Deep Deterministic Policy Gradient (MADDPG) framework, modeling intersections as autonomous agents and leveraging V2I to obtain real-time data. An attention mechanism is employed to dynamically focus on neighboring intersections, optimizing traffic signal coordination. The method overcomes low V2I penetration through scenario reconstruction and models mixed traffic environments by incorporating weather impacts, pedestrian interactions, and diverse action spaces. Extensive experiments conducted in the Simulation of Urban Mobility (SUMO) platform show that the proposed method improves overall performance by 40% over conventional approaches and outperforms IPDALight across most scenarios.
- 12 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. PP (00189545) , 1-17
DRL-Based Robust Adaptive Traffic Signal Control with Low V2I Penetration Rate under Mixed Environment
Deep Reinforcement Learning (DRL) has become a widely adopted approach for adaptive traffic signal control, owing to its flexibility and effectiveness. However, DRL faces dimensionality and convergence challenges in large-scale multi-agent settings. Additionally, simplified representations of traffic conditions limit adaptability under mixed environments with pedestrians and weather factors. Moreover, in Vehicular Ad-Hoc Networks (VANETs) scenarios, low Vehicle-to-Infrastructure (V2I) penetration exacerbates the complexity of traffic observation and coordination. In this paper, we propose a DRL-based robust adaptive traffic signal control with a low V2I penetration rate under mixed environment (DRATSC). Specifically, DRATSC builds upon the Multi-Agent Deep Deterministic Policy Gradient (MADDPG) framework, modeling intersections as autonomous agents and leveraging V2I to obtain real-time data. An attention mechanism is employed to dynamically focus on neighboring intersections, optimizing traffic signal coordination. The method overcomes low V2I penetration through scenario reconstruction and models mixed traffic environments by incorporating weather impacts, pedestrian interactions, and diverse action spaces. Extensive experiments conducted in the Simulation of Urban Mobility (SUMO) platform show that the proposed method improves overall performance by 40% over conventional approaches and outperforms IPDALight across most scenarios.
- 16 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 151, 41-49
K-time Redactable Blockchain with Decentralized History Rewriting
Blockchain is a breakthrough computing paradigm with distinctive immutability, which has gained increasing attention in academia and industry. While immutability ensures the reliability and trustability of blockchain networks, it may lead to serious security issues, such as illegal storage of arbitrary contents and conflict of smart contract versions. To mitigate these issues, redactable blockchain is envisioned, which has the ability to rewrite histories. However, most existing approaches are vulnerable to single point of failure caused by over-centralization, as well as the Distributed Denial of Service (DDoS) attack resulted from large-scale redactions within a short period of time. In this paper, we propose a K-time redactable blockchain with decentralized history rewriting. Specifically, we use multiple authorities to control the redaction power, coping with single point of failure. Subsequently, we set limitations on the frequency and number of redactions to prevent malicious users from initiating massive redactions in a short period, which avoids DDoS attacks. In addition, we conducted a thorough analysis and numerous experiments to illustrate the security and efficiency of our proposal.
- 16 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 151, 41-49
K-time Redactable Blockchain with Decentralized History Rewriting
Blockchain is a breakthrough computing paradigm with distinctive immutability, which has gained increasing attention in academia and industry. While immutability ensures the reliability and trustability of blockchain networks, it may lead to serious security issues, such as illegal storage of arbitrary contents and conflict of smart contract versions. To mitigate these issues, redactable blockchain is envisioned, which has the ability to rewrite histories. However, most existing approaches are vulnerable to single point of failure caused by over-centralization, as well as the Distributed Denial of Service (DDoS) attack resulted from large-scale redactions within a short period of time. In this paper, we propose a K-time redactable blockchain with decentralized history rewriting. Specifically, we use multiple authorities to control the redaction power, coping with single point of failure. Subsequently, we set limitations on the frequency and number of redactions to prevent malicious users from initiating massive redactions in a short period, which avoids DDoS attacks. In addition, we conducted a thorough analysis and numerous experiments to illustrate the security and efficiency of our proposal.
- 28 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 23 (5) , 5543-5557
Optimal Verifiable Data Streaming Under Concurrent Queries
The rapid development of both hardware and software has promoted the popularization of various real-time applications like health monitoring and intrusion detection that are widely deployed in outsourcing scenarios, e.g., mobile edge computing and cloud computing. In these applications, end devices continuously generate unbounded sequences of data items at a fast rate, i.e., the so-called streaming data. Nevertheless, storing and processing massive amounts of streaming data poses a challenge for resources-restricted end devices. Although outsourcing data items to edge servers or cloud servers is an attractive solution to the above problem, it also brings a new challenge, i.e., how to guarantee the integrity of outsourced data, since streaming data applications are usually sensitive of both location and the corresponding context, and servers are not completely trusted. To this end, the primitive of verifiable data streaming (VDS) protocol was introduced to maintain outsourced streaming data, while preserving its integrity. However, existing VDS constructions mainly use the structure of Merkle hash tree, and inherently have logarithmic costs. Consequently, they are infeasible for real-time applications that are delay sensitive and generate unpredictable size of streaming data. In this paper, we optimize previous VDS protocols from the aspects of communication overhead and computation cost. Specifically, we adopt a technical route different from Merkle hash tree, i.e, combining the digital signature with the cryptographic accumulator. In our construction, we employ Boneh-Lynn-Shacham (BLS) signature to guarantee the integrity of the context and position of each outsourced data item, and adopt an RSA accumulator to invalidate the old signature after the corresponding data item was updated. This immediately yields an optimal VDS construction that has constant costs even under concurrent queries, which is more desirable for those resource-limited mobile devices. In addition, the aggregability of BLS signature makes our VDS construction capable of data auditing, which enables the user to remotely verify the integrity of outsourced streaming data. We provide a formal security proof of the proposed VDS construction under well-studied complexity assumptions in the random oracle model. As a proof-of-concept, we also implement our proposal, and conduct extensive experiments to demonstrate its practicability.
- 28 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 23 (5) , 5543-5557
Optimal Verifiable Data Streaming Under Concurrent Queries
The rapid development of both hardware and software has promoted the popularization of various real-time applications like health monitoring and intrusion detection that are widely deployed in outsourcing scenarios, e.g., mobile edge computing and cloud computing. In these applications, end devices continuously generate unbounded sequences of data items at a fast rate, i.e., the so-called streaming data. Nevertheless, storing and processing massive amounts of streaming data poses a challenge for resources-restricted end devices. Although outsourcing data items to edge servers or cloud servers is an attractive solution to the above problem, it also brings a new challenge, i.e., how to guarantee the integrity of outsourced data, since streaming data applications are usually sensitive of both location and the corresponding context, and servers are not completely trusted. To this end, the primitive of verifiable data streaming (VDS) protocol was introduced to maintain outsourced streaming data, while preserving its integrity. However, existing VDS constructions mainly use the structure of Merkle hash tree, and inherently have logarithmic costs. Consequently, they are infeasible for real-time applications that are delay sensitive and generate unpredictable size of streaming data. In this paper, we optimize previous VDS protocols from the aspects of communication overhead and computation cost. Specifically, we adopt a technical route different from Merkle hash tree, i.e, combining the digital signature with the cryptographic accumulator. In our construction, we employ Boneh-Lynn-Shacham (BLS) signature to guarantee the integrity of the context and position of each outsourced data item, and adopt an RSA accumulator to invalidate the old signature after the corresponding data item was updated. This immediately yields an optimal VDS construction that has constant costs even under concurrent queries, which is more desirable for those resource-limited mobile devices. In addition, the aggregability of BLS signature makes our VDS construction capable of data auditing, which enables the user to remotely verify the integrity of outsourced streaming data. We provide a formal security proof of the proposed VDS construction under well-studied complexity assumptions in the random oracle model. As a proof-of-concept, we also implement our proposal, and conduct extensive experiments to demonstrate its practicability.
- 28 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 21 (4) , 2057-2067
Public Proofs of Data Replication and Retrievability With User-Friendly Replication
Proofs of Retrievability (PoRs) and Provable Data Possession (PDP) are efficient cryptographic solutions to monitoring the state of storage, enabling integrity verification without the necessity of retrieving data. However, such protocols fail to guarantee data availability, since it is too late for cloud clients to recover the corrupted data when notified. To remedy it, these protocols are extended to verify integrity of both the stored data and their redundant copies in the multi-replica environment. Most of the existing multi-replica PDP protocols not only consume considerable computation and bandwidth resources of clients to generate and upload replicas, but also lead economic losses to service providers due to abused replica discounts. Though the other few considered these problems and proposed some countermeasures, they imposed the linear cost of generating and uploading copy parameters on clients in replication algorithms and fail to realize public verifiability. In this paper, we propose a public proofs of data replication and retrievability protocol with user-friendly replication for the first time. One distinguishable property is the simultaneous achievement of user-friendly replication and public verifiability. Specifically, we design a novel replication algorithm, which imposes nearly no computation and a constant-size communication cost on clients. Subsequently, we employ non-interactive succinct proofs to make the verification public. Furthermore, we present a comprehensive analysis and extensive experiments to demonstrate the security and efficiency of the proposed protocol.
- 28 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 21 (4) , 2057-2067
Public Proofs of Data Replication and Retrievability With User-Friendly Replication
Proofs of Retrievability (PoRs) and Provable Data Possession (PDP) are efficient cryptographic solutions to monitoring the state of storage, enabling integrity verification without the necessity of retrieving data. However, such protocols fail to guarantee data availability, since it is too late for cloud clients to recover the corrupted data when notified. To remedy it, these protocols are extended to verify integrity of both the stored data and their redundant copies in the multi-replica environment. Most of the existing multi-replica PDP protocols not only consume considerable computation and bandwidth resources of clients to generate and upload replicas, but also lead economic losses to service providers due to abused replica discounts. Though the other few considered these problems and proposed some countermeasures, they imposed the linear cost of generating and uploading copy parameters on clients in replication algorithms and fail to realize public verifiability. In this paper, we propose a public proofs of data replication and retrievability protocol with user-friendly replication for the first time. One distinguishable property is the simultaneous achievement of user-friendly replication and public verifiability. Specifically, we design a novel replication algorithm, which imposes nearly no computation and a constant-size communication cost on clients. Subsequently, we employ non-interactive succinct proofs to make the verification public. Furthermore, we present a comprehensive analysis and extensive experiments to demonstrate the security and efficiency of the proposed protocol.
- 21 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 18 (15566013) , 3787-3802
Verifiable and Redactable Blockchains With Fully Editing Operations
Blockchain technology has been highly praised for its immutability, attracting considerable attention in the academic and industrial community. However, since permanent storage in blockchains would result in copyright disputes and harmful information spreads, it is desired to equip blockchains with mutability nowadays for legal and moral duty restrictions. A redactable blockchain is a variation, which enables the editing of block objects without affecting other blocks in the blockchain. Most existing redactable blockchains can only support editing operations such as modification and deletion, rather than insertion. However, insertion is necessary for some scenarios, especially when patching codes are needed for smart contracts and mistaken deletions occur. In addition, we argue that the verifiability of blockchains is also significantly important, especially for the redactable ones, in which one block may have multiple versions. Hence, an efficient mechanism is required to invalidate history versions and incent distributed adoptions of editing operations. In this paper, we propose a verifiable and redactable blockchain with fully editing operations for the first time. One distinguishable property is the simultaneous achievement of fully editability of block objects and verifiability of blockchain state, with acceptable extra cost. Specifically, we construct the redactable blockchain based on a double trapdoor chameleon hash family, enabling computationally efficient and key-exposure resistant block editing. Additionally, we combine trapdoorless universal accumulators and the largest sequence number principle to make the blockchain state verifiable. Furthermore, we present a comprehensive analysis and extensive experiments to demonstrate the security and feasibility of the proposed redactable blockchain.
- 21 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 18 (15566013) , 3787-3802
Verifiable and Redactable Blockchains With Fully Editing Operations
Blockchain technology has been highly praised for its immutability, attracting considerable attention in the academic and industrial community. However, since permanent storage in blockchains would result in copyright disputes and harmful information spreads, it is desired to equip blockchains with mutability nowadays for legal and moral duty restrictions. A redactable blockchain is a variation, which enables the editing of block objects without affecting other blocks in the blockchain. Most existing redactable blockchains can only support editing operations such as modification and deletion, rather than insertion. However, insertion is necessary for some scenarios, especially when patching codes are needed for smart contracts and mistaken deletions occur. In addition, we argue that the verifiability of blockchains is also significantly important, especially for the redactable ones, in which one block may have multiple versions. Hence, an efficient mechanism is required to invalidate history versions and incent distributed adoptions of editing operations. In this paper, we propose a verifiable and redactable blockchain with fully editing operations for the first time. One distinguishable property is the simultaneous achievement of fully editability of block objects and verifiability of blockchain state, with acceptable extra cost. Specifically, we construct the redactable blockchain based on a double trapdoor chameleon hash family, enabling computationally efficient and key-exposure resistant block editing. Additionally, we combine trapdoorless universal accumulators and the largest sequence number principle to make the blockchain state verifiable. Furthermore, we present a comprehensive analysis and extensive experiments to demonstrate the security and feasibility of the proposed redactable blockchain.
- 24 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 11 (3) , 2711-2724
Blockchain-Based Accountable Auditing With Multi-Ownership Transfer
Cloud auditing enables the integrity verification of cloud data without the necessity of data retrieval, which significantly promotes the storage service of cloud computing. Auditing with ownership transfer is a variation where both cloud data and the tags for integrity verification can be transferred. In some scenarios, like joint-stock enterprise acquisition and electronic medical records migration, we argue that auditing and transferring data belonging to multiple owners are significantly important. However, to the best of our knowledge, there exists no such protocol in multi-ownership scenarios in the literature. In this paper, we propose a blockchain-based accountable auditing protocol with multi-ownership transfer for the first time. One distinguishable property is the simultaneous achievement of verifiability, accountability and multi-ownership transferability, merely with very little extra cost. Specifically, we construct a novel tag structure based on homomorphic authenticators and compact multi-signatures, enabling integrity verification and multi-ownership transfer. Subsequently, we record the information concerning data generation and ownership transfer on immutable blockchains to make these procedures accountable. Furthermore, we present a comprehensive analysis and extensive experiments to demonstrate the security and efficiency of the proposed protocol.
- 24 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 11 (3) , 2711-2724
Blockchain-Based Accountable Auditing With Multi-Ownership Transfer
Cloud auditing enables the integrity verification of cloud data without the necessity of data retrieval, which significantly promotes the storage service of cloud computing. Auditing with ownership transfer is a variation where both cloud data and the tags for integrity verification can be transferred. In some scenarios, like joint-stock enterprise acquisition and electronic medical records migration, we argue that auditing and transferring data belonging to multiple owners are significantly important. However, to the best of our knowledge, there exists no such protocol in multi-ownership scenarios in the literature. In this paper, we propose a blockchain-based accountable auditing protocol with multi-ownership transfer for the first time. One distinguishable property is the simultaneous achievement of verifiability, accountability and multi-ownership transferability, merely with very little extra cost. Specifically, we construct a novel tag structure based on homomorphic authenticators and compact multi-signatures, enabling integrity verification and multi-ownership transfer. Subsequently, we record the information concerning data generation and ownership transfer on immutable blockchains to make these procedures accountable. Furthermore, we present a comprehensive analysis and extensive experiments to demonstrate the security and efficiency of the proposed protocol.
- 1 May 2018
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 77 (9) , 11381-11401
Implicit authentication protocol and self-healing key management for WBANs
- 1 May 2018
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 77 (9) , 11381-11401
Implicit authentication protocol and self-healing key management for WBANs
- 22 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computing
- Vol. 8 (2) , 280-290
Secure Verifiable Database Supporting Efficient Dynamic Operations in Cloud Computing
Storage is one of the main services that the cloud provides users. Utilizing the cloud to store large amounts of data can alleviate the cost of storage and the hardware investment on the local side, which is very important for resource-restricted clients. An emerging issue for clients is how to verify the database in the could after outsourcing their data to the cloud. Many verifiable database (VDB) schemes have been proposed by researchers that can solve this issue. However, some of the existing schemes cannot satisfy the practical requirements of database verifiability. In this paper, we propose a secure verifiable database scheme that is based on the polynomial commitment for cloud computing, which can realize the verifiability of database records in the cloud. Moreover, the proposed scheme can support public verifiability in that all clients in the system can verify the database. In addition, we use the BLS signature and the index-hash table to construct dynamic operations for the database. Security analysis shows that our scheme can achieve real-world security requirements. The simulation results show that our scheme is more efficient than similar schemes.
- 22 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computing
- Vol. 8 (2) , 280-290
Secure Verifiable Database Supporting Efficient Dynamic Operations in Cloud Computing
Storage is one of the main services that the cloud provides users. Utilizing the cloud to store large amounts of data can alleviate the cost of storage and the hardware investment on the local side, which is very important for resource-restricted clients. An emerging issue for clients is how to verify the database in the could after outsourcing their data to the cloud. Many verifiable database (VDB) schemes have been proposed by researchers that can solve this issue. However, some of the existing schemes cannot satisfy the practical requirements of database verifiability. In this paper, we propose a secure verifiable database scheme that is based on the polynomial commitment for cloud computing, which can realize the verifiability of database records in the cloud. Moreover, the proposed scheme can support public verifiability in that all clients in the system can verify the database. In addition, we use the BLS signature and the index-hash table to construct dynamic operations for the database. Security analysis shows that our scheme can achieve real-world security requirements. The simulation results show that our scheme is more efficient than similar schemes.