Zhikang Zeng

dblp:312/4495 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
5since 2021 · last 2025
0000-0003-1494-9148ORCID · corroborated

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

Computer networks · 3 · 1 first-author · 3 since 2021Systems, architecture and hardware · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 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
2 papers
Blockchain and cryptocurrency security · 40% Authentication and access control · 28% Cyber-physical and IoT security · 14%

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

TopicWeightPapersLastEvidence papers
Blockchain and cryptocurrency security
blockchain interoperability
0.912025
$\mathtt{SFPoW}$SFPoW: Constructing Secure and Flexible Proof-of-Work Sidechains for Cross-Chain Interoperability With Wrapped Assets · IEEE Trans. Computers 2025
Blockchain and cryptocurrency security › consensus protocol
proof-of-work
0.912025
$\mathtt{SFPoW}$SFPoW: Constructing Secure and Flexible Proof-of-Work Sidechains for Cross-Chain Interoperability With Wrapped Assets · IEEE Trans. Computers 2025
Authentication and access control
authentication
0.812024
RIC-SDA: A Reputation Incentive Committee-Based Secure Conditional Dual Authentication Scheme for VANETs · IEEE Trans. Mob. Comput. 2024
Authentication and access control › privacy-preserving authentication
conditional privacy-preserving authentication
0.812024
RIC-SDA: A Reputation Incentive Committee-Based Secure Conditional Dual Authentication Scheme for VANETs · IEEE Trans. Mob. Comput. 2024
Cryptographic protocols and secure computation › key management
key-exposure resilience
0.812024
RIC-SDA: A Reputation Incentive Committee-Based Secure Conditional Dual Authentication Scheme for VANETs · IEEE Trans. Mob. Comput. 2024
Cyber-physical and IoT security
vehicular network security
0.812024
RIC-SDA: A Reputation Incentive Committee-Based Secure Conditional Dual Authentication Scheme for VANETs · IEEE Trans. Mob. Comput. 2024
Cryptographic primitives and cryptanalysis
hash functions
0.312025
$\mathtt{SFPoW}$SFPoW: Constructing Secure and Flexible Proof-of-Work Sidechains for Cross-Chain Interoperability With Wrapped Assets · IEEE Trans. Computers 2025
Blockchain and cryptocurrency security › blockchain-based identity management
blockchain-based authentication
0.212024
RIC-SDA: A Reputation Incentive Committee-Based Secure Conditional Dual Authentication Scheme for VANETs · IEEE Trans. Mob. Comput. 2024
Blockchain and cryptocurrency security › incentive mechanism
reputation incentive
0.212024
RIC-SDA: A Reputation Incentive Committee-Based Secure Conditional Dual Authentication Scheme for VANETs · IEEE Trans. Mob. Comput. 2024

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

sidechain protocols · 0.9proof-of-work · 0.9random oracle proof · 0.8batch verification · 0.8
YearPublicationVenuePosition
2025 EFSC: Efficient and Forward-Secure Conditional Privacy-Preserving Scheme for Internet of Vehicles
abstract
The interconnected environment of the Internet of Vehicles (IoV) facilitates the development of various low-carbon and secure location-based services. However, sharing data with semi-trusted service providers poses serious security risks. In particular, it can threaten the confidentiality of past messages after the leakage of the user’s key. In this article, we propose an efficient and forward-secure conditional privacy-preserving scheme for IoV, namely, EFSC. We construct a cryptographic method with forward secrecy in the proposed EFSC scheme, which ensures the confidentiality of past messages even after the user’s secret key has been compromised. This method incorporates key derivation functionality and efficiently addresses the complex certificate management issue with the assistance of smart contracts. Additionally, the designed smart contract facilitates authentication. We analyze and prove that the proposed EFSC scheme satisfies the proposed privacy and security requirements with better security performance. We use Goerli, an Ethernet test network, to deploy customized smart contracts to prove its feasibility. Furthermore, the proposed EFSC scheme exhibits high-index generation and pairing efficiency and realizes less computational and communication overhead. Compared with the existing schemes, its computational overhead in message signing, signature verification, and user revocation can be reduced by up to 95.61%, 36.53%, and 67.01%, respectively. Moreover, the communication overhead for initiating a location service query is only 0.3760 kB. These results show that the proposed EFSC scheme has certain advantages regarding efficiency and security.
Zhikang Zeng, Chunming Tang 0003, Quan Zhou 0009, Zhiquan Liu 0001, Debiao He
IEEE Internet Things J.1
2025 $\mathtt{SFPoW}$SFPoW: Constructing Secure and Flexible Proof-of-Work Sidechains for Cross-Chain Interoperability With Wrapped Assets
Chunming Tang 0003, Taotao Li, Zhikang Zeng, Parhat Abla, Debiao He
IEEE Trans. Computers4
2024 RIC-SDA: A Reputation Incentive Committee-Based Secure Conditional Dual Authentication Scheme for VANETs
abstract
Vehicular ad hoc networks (VANETs) establish wireless connections among all vehicles, enabling seamless mobile communication. However, existing conditional privacy protection VANETs authentication schemes fail to address the issue of potential key-exposure and do not provide accelerated vehicle authentication. In this paper, we propose a reputation incentive committee-based secure conditional dual authentication scheme for VANETs called RIC-SDA. Our proposed scheme incorporates dual authentication of the consensus committee and vehicle-to-vehicle (V2V) communication. It enables the rapid provision of dynamic vehicle epoch-key from consensus committee authentication for V2V authentication through our designed reputation incentive mechanism. To mitigate the potential key-exposure problem, we introduce a novel concept of secure vehicle epoch communication, which means V2V authentication is valid for only one epoch blockchain unit time. The proposed scheme achieves lightweight computation and incurs minimal communication overheads, with the signature size being just 137 bytes. The RIC-SDA scheme supports fast batch verification. We prove that our proposed scheme is unforgeable security under random oracle and demonstrate its feasibility by implementing it in a test network based on Ethereum Sepolia. The results demonstrate that our RIC-SDA solution outperforms the existing state-of-the-art authentication VANET schemes regarding efficiency and communication costs.
Ningbin Yang, Chunming Tang 0003, Tianqi Zong, Zhikang Zeng, Zehui Xiong, Debiao He
IEEE Trans. Mob. Comput.4
2024 Bmsmlet: boosting multi-scale information on multi-level aggregated features for salient object detection
Tong Jia 0001, Yunhe Wu, Zhikang Zeng
Vis. Comput.4
2023 Privacy Protection Scheme for the Internet of Vehicles Based on Collaborative Services
abstract
With the development of new-generation mobile communication technology, the Internet of Vehicles is playing an increasingly important role in people’s lives. However, the sensitive information contained in its “data fingerprinting” raises many privacy and security concerns. To better protect the location privacy of users on the Internet of Vehicles, this article proposes a collaborative service-based privacy protection scheme for the Internet of Vehicles. In this scheme, each requesting user first initiates a location service query by generating a pairing index of the location points set. Then a customized pairing result threshold is used to determine the collaborating users that can participate in the service response. And in the process, the location privacy of users is secured by location point generalization and encryption. In addition, redundant location service recommendations are eliminated by the proposed repeatability tests. Security analysis and experiments show that this scheme has good performance and anti-privacy leakages, forgery attacks, collusion attacks, etc.
Quan Zhou 0009, Zhikang Zeng, Kemeng Wang, Menglong Chen, Yulong Zheng
IEEE Internet Things J.2