Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Junze Lu

dblp:396/3826 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
4since 2021 · last 2026
0000-0003-3865-1864ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 2 first-author · 2 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 67% Privacy and data protection · 33%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › functional encryption
attribute-based encryption
1.012026
Fog-Assisted Composite Attribute-Based Encryption for Secure Personal Health Data Sharing · IEEE Trans. Netw. 2026
Cryptographic primitives and cryptanalysis › functional encryption › attribute-based encryption
ciphertext-policy attribute-based encryption
1.012026
Fog-Assisted Composite Attribute-Based Encryption for Secure Personal Health Data Sharing · IEEE Trans. Netw. 2026

Methods — techniques the papers use, named apart from their topics

subset sum problem · 1.0dual fog-node architecture · 1.0composite attributes · 1.0
YearPublicationVenuePosition
2026 Fog-Assisted Composite Attribute-Based Encryption for Secure Personal Health Data Sharing
abstract
The exponential growth of wearable medical devices (WMDs) and the increasing demand for real-time health data sharing necessitate secure and fine-grained access control mechanisms. However, existing ciphertext-policy attribute-based encryption (CP-ABE) schemes suffer from computational and storage overheads that grow linearly with policy complexity. To address this challenge, we propose fog-assisted composite attribute-based encryption (FA-CABE), a novel scheme that integrates composite attributes with fog computing to enhance efficiency. FA-CABE leverages the subset sum problem (SSP) to map conjunctive policy clauses to composite attributes, substantially reducing both encryption and decryption overhead. A dualfog-node architecture offloads cryptographic computations from WMDs, enabling lightweight local processing. Rigorous security analysis under the Decisional Bilinear Diffie-Hellman (DBDH) assumption demonstrates that FA-CABE achieves replayable chosen ciphertext attack (RCCA) security. Experimental results show that FA-CABE achieves encryption speeds that are 22.13×–145.02× faster and decryption speeds that are 6.71×–161.83× faster than existing schemes, while requiring only a constant number of operations for decryption. Additionally, experimental validation on the Raspberry Pi 4B shows that the energy consumption is as low as 0.72 W per core, with data processing speed reaching 23.38 MB/s.
Junze Lu, Chunqiang Hu, Ruinian Li, Yuwen Chen 0001, Jiguo Yu
IEEE Trans. Netw.1
2025 A Revocable Fast and Lightweight Parallel Encryption Scheme for IIoT
abstract
As the Industrial Internet of Things (IIoT) expands, the number of stakeholders increases. Many entities require significant amounts of data from industrial devices. These data streams improve information sharing and optimize the industrial chain. However, IIoT’s enormous data volumes pose challenges to traditional encryption methods, which are unable to meet efficiency and energy consumption requirements. Thus, a new, efficient encryption algorithm is essential for managing data flows among IIoT subscribers. In this paper, we propose a fast, low-energy, high-security encryption scheme to manage multi-entity data streams. First, we introduce a novel encryption scheme based on the Subset Sum Problem (SSP), which improves energy efficiency and speed. Second, to meet subscription requirements, we employ attribute-based encryption (ABE) for key forwarding. Finally, we handle subscription revocations with device key updates. The device owner utilizes their secret value to generate an identity proof with a key update request.
Junze Lu, Chunqiang Hu, Jiajun Chen 0003, Hui Xia 0001, Xingwang Li 0001, Jiguo Yu
IEEE Internet Things J.1
2024 Group Signature with Time-Bound Keys for Secure E-health Record Sharing
abstract
With the advent of various mobile IoT devices, a large amount of e-health record (EHR) data has been generated. This data has great potential to improve medical research. However, there are many challenges regarding the sharing of medical data. Firstly, users are more inclined to interact anonymously. Secondly, verifying the validity of certificates in the case of anonymous interactions is challenging. In addition, it is necessary to uncover the identities of the actual interacting parties in the event of malicious behavior. Therefore, we address the above challenges and propose group signatures with time constraints to support anonymous and traceable EHR data sharing. First, we propose a group signature scheme that supports traceability. Second, to address the issue of validating anonymous certificates, we propose group signatures with time constraints that enable dynamic updates to validity. Through this, we can dynamically revoke group members. Lastly, security proofs and efficiency analyses demonstrate that our scheme is both secure and efficient.
Junze Lu, Chunqiang Hu, Conghao Ruan, Bin Cai 0004, Tao Xiang 0001
BIBM1
2024 VOABE: An Efficient Verifiable Outsourced Attribute-Based Encryption for Healthcare Systems
Junze Lu, Chunqiang Hu, Tao Xiang 0001, Wei Li 0059, Jiguo Yu
COCOON (2)1