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

Shanyao Ren

dblp:325/0651 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
6since 2021 · last 2026
0000-0002-2444-1594ORCID · corroborated

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

Computer networks · 4 · 3 first-author · 4 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Security and privacy · 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
1 paper
Authentication and access control · 50% Cryptographic protocols and secure computation · 50%
Computer networks
1 paper
Internet of things and sensor networks · 100%

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

TopicWeightPapersLastEvidence papers
Authentication and access control › user authentication
authentication and key agreement
1.012026
An Efficient and Secure Authentication and Key Agreement Protocol for Multi-Device Scenarios in Fog Computing · IEEE Trans. Mob. Comput. 2026
Cryptographic protocols and secure computation
key exchange
1.012026
An Efficient and Secure Authentication and Key Agreement Protocol for Multi-Device Scenarios in Fog Computing · IEEE Trans. Mob. Comput. 2026
Internet of things and sensor networks › iot security
iot device authentication
0.312026
An Efficient and Secure Authentication and Key Agreement Protocol for Multi-Device Scenarios in Fog Computing · IEEE Trans. Mob. Comput. 2026

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

secret sharing · 2.0real-or-random model · 2.0elliptic curve cryptography · 2.0
YearPublicationVenuePosition
2026 A Secure and Efficient Handover Authentication and Key Agreement Protocol in Fog Computing
Yiran Han, Jianwei Liu 0001, Hua Guo 0001, Zongxiao Li, Shanyao Ren
SACMAT7
2026 SLAPE: Secure Lightweight Authentication for Privacy-Enhanced Federated Learning in Industrial Internet of Things
abstract
Federated learning (FL) has emerged as a promising technique in the Industrial Internet of Things (IIoT) by enabling distributed devices to collaboratively train models without sharing raw data. In FL, ensuring data privacy and secure authentication becomes essential due to the sensitivity of industrial data and the potential for adversarial attacks. This paper highlights a security flaw in a recently proposed FL authentication protocol designed for IIoT environments. Specifically, the scheme is analyzed to be susceptible to public-key replacement attacks. We propose a secure, lightweight authentication scheme for privacy-enhanced federated learning (SLAPE) to address vulnerabilities in participant registration, group key distribution, local data training, and aggregation processes. SLAPE leverages the Elliptic Curve Cryptography with the Chinese Remainder Theorem to support malicious group member traceability, revocation of compromised identities, and efficient batch verification of multiple messages. It effectively resists Type-I attacks that previous schemes could not, while also incorporating forward and backward security essential for IIoT applications. We rigorously demonstrate SLAPE’s resilience against prevalent threats through both formal and informal analyses. Our evaluation results indicate that SLAPE demonstrably enhances the security and privacy of existing schemes, with improvements in computational efficiency for both proof generation and verification, while keeping communication overhead relatively low.
Shanyao Ren, Jianwei Liu 0001, Chip-Hong Chang, Hanzhou Wang, Dongyu Li
IEEE Internet Things J.1
2026 SMARC: A State-Repairing Multi-Agent Resilient Consensus Scheme
abstract
In this paper, we analyze a recent algorithm for resilient consensus control in distributed multi-agent systems. While effective in theory, its reliance on security in communication and strong connectivity assumptions limits its practicality in dynamic electronic and cyber-physical systems, such as embedded device networks and uncrewed platforms. To address these limitations, we propose a State-repairing Multi-agent Resilient Consensus (SMARC) scheme to eliminate the need for normal agents to collect trustworthy state values from a fixed bounded threshold of neighbors to achieve reliable consensus. The core innovation of SMARC is a decentralized state-repair mechanism, which enables agents to obtain additional information from their reachable sets to repair unavailable or corrupted state values of malicious or faulty agents, and autonomously adjust their convergence speed. Additionally, without negatively impacting the consensus performance, SMARC employs a noise-masked surface state to protect the initial states of agents from eavesdropping. This approach avoids extra storage and reduces computations without adhering to strict security prerequisites, making it more suitable for resource-constrained electronic systems compared to existing methods. Theoretical convergence and security proofs demonstrate that SMARC can successfully resist passive attacks while ensuring accurate convergence on multi-dimensional data. Most importantly, from small- to large-scale networks, SMARC achieves a three- to four-fold increase in convergence speed compared to the most competitive recent state-of-the-art resilient consensus algorithm in both passive and active attacks. A prototype electronic of a MAS was also built using six Raspberry Pi devices to validate its performance and robustness in practical environments.
Shanyao Ren, Chip-Hong Chang, Jianwei Liu 0001, Dongyu Li
IEEE Trans. Circuits Syst. I Regul. Pap.1
2026 An Efficient and Secure Authentication and Key Agreement Protocol for Multi-Device Scenarios in Fog Computing
abstract
The fog computing paradigm enables mobile users to seamlessly interact with crowds of nearby IoT devices for low-latency services. However, existing authentication and key agreement (AKA) protocols suffer from critical limitations in this mobile context. While existing AKA schemes are optimized for mobile edge environments, they incur substantial overhead in multi-device scenarios: they require repeated authentication for each device and generate distinct session keys per user-device pair, leading to high key management complexity at scale. Furthermore, traditional one-to-many protocols are unsuitable for distributed fog environments due to their reliance on trusted central nodes (e.g., gateways or servers) and incompatible communication models. To address these issues, this paper proposes an efficient and secure authentication protocol for fog computing that integrates elliptic curve cryptography with secret sharing. Our solution enables a user to authenticate an entire group of devices managed by a semi-trusted fog node (honest-but-curious) through a single protocol execution, effectively eliminating the authentication bottleneck caused by scaling devices. Formal security proof under the Real-Or-Random (ROR) model is provided, along with informal analysis, demonstrating the protocol ensures forward secrecy, user anonymity, and resistance to a comprehensive set of attacks, including ephemeral secret leakage, key compromise impersonation, and replay attacks. Performance analysis confirms the scheme maintains low communication and computational overhead while achieving comprehensive security.
Yiran Han, Jianwei Liu 0001, Hua Guo 0001, Zongxiao Li, Shanyao Ren
IEEE Trans. Mob. Comput.6
2024 HWMP-based secure communication of multi-agent systems
Shanyao Ren, Jianwei Liu 0001, Shuzhi Sam Ge, Dongyu Li
Ad Hoc Networks1
2024 Provable Secure Anonymous Device Authentication Protocol in IoT Environment
abstract
The inherent massive heterogeneous devices and open channels in the Internet of Things (IoT) present significant challenges for identity authentication between devices and cloud servers. For this issue, reliable protocols ensure the legality of participants and act as a crucial method to provide security for authentication. In previous research, schemes devised by researchers exhibit certain security vulnerabilities, making it challenging to withstand comprehensive network attacks, e.g., stolen device attacks, replay attacks, impersonation, etc. Additionally, some protocols have complex interaction processes, which incur significant computational redundancy and resource loss. Motivated by this, this article proposes an anonymous and certificateless lightweight authentication protocol (ACLAP) for device-to-server and device-to-device based on elliptic curve cryptography. It improves the communication quality between devices and cloud servers and solves the security risks in authentication. In the scheme, we utilize device users’ passwords and biometric features as verification credentials without storing any trusted proofs on the cloud server. We address the issue of resource consumption caused by numerous devices in the IoT environment. From formal security analysis and comparisons with other works, our protocol has preferable security performance and effectively saves communication resources for authentication. Simulation results demonstrate the feasibility and practical significance of the scheme.
Shanyao Ren, Yizhong Liu, Beiyuan Yu, Jianwei Liu 0001, Dongyu Li
IEEE Internet Things J.1