Demo Data from EDBT 2026 / reviewers in the wild / expert
Shenmin Gu
dblp:441/4366
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0001-8486-2673ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Security 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 · 77% Cryptographic primitives and cryptanalysis · 23% | |
| 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
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Internet of things and sensor networks
industrial iot |
1.0 | 1 | 2026 | An Efficient ASCON-Based Group Authentication and Key Agreement Scheme With Non-Linkability and Integrity Assurance for IIoTs · IEEE Trans. Dependable Secur. Comput. 2026 |
Authentication and access control › authentication › authentication protocols
group authentication |
1.0 | 1 | 2026 | An Efficient ASCON-Based Group Authentication and Key Agreement Scheme With Non-Linkability and Integrity Assurance for IIoTs · IEEE Trans. Dependable Secur. Comput. 2026 |
Cryptographic primitives and cryptanalysis
authenticated encryption |
0.3 | 1 | 2026 | An Efficient ASCON-Based Group Authentication and Key Agreement Scheme With Non-Linkability and Integrity Assurance for IIoTs · IEEE Trans. Dependable Secur. Comput. 2026 |
Methods — techniques the papers use, named apart from their topics
random oracle model · 2.0algebraic group model · 2.0ASCON · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | An Efficient ASCON-Based Group Authentication and Key Agreement Scheme With Non-Linkability and Integrity Assurance for IIoTsabstractIn recent years, numerous group authentication and key agreement (GAKA) schemes have been proposed for the Industrial Internet of Things (IIoTs). However, the frequent identity updates that are a feature of IIoT environments mean that existing schemes cannot maintain full-lifecycle device anonymity. Meanwhile, static integrity verification approaches cannot effectively cope with the dynamic and heterogeneous nature of industrial networks, making it imperative to design an adaptive data integrity protection mechanism to maintain reliable and resilient communication. Additionally, the simultaneous access of a large number of intelligent industrial devices to gateway nodes creates significant computational and communication challenges, while also increasing the risk of denial-of-service attacks and other concurrent threats. Consequently, current schemes are unable to strike an optimal balance between efficiency and security in large-scale IIoT deployments. In our scheme, we first designed an anonymous token mechanism to achieve sufficient randomness for unlinkability when communicating with the same gateway node across different time periods. Secondly, integrating associated data into the authenticated sponge construction (ASCON) encryption process ensures the legitimacy and integrity of the data during transmission. Third, we conduct rigorous security proofs under the widely accepted Algebraic Group Model (AGM) and Random Oracle Model (ROM), demonstrating that our group authentication mechanism is unforgeable against adaptive chosen-public-key and adaptive chosen-subspace attacks. Finally, the performance evaluation demonstrates that our proposed scheme achieves improvement in computational efficiency, while the communication overhead analysis confirms that the design remains both efficient. Haowen Tan, Shenmin Gu, Jian Shen 0001, Md. Zakirul Alam Bhuiyan, Q. M. Jonathan Wu |
IEEE Trans. Dependable Secur. Comput. | 2 |