Demo Data from EDBT 2026 / reviewers in the wild / expert
Fan Yang 0034
dblp:29/3081-34
· DBLP profile ↗
7ranked-venue papers
1as first author
2since 2021 · last 2024
0000-0002-1697-7903ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 4Systems, architecture and hardware · 1 · 1 first-authorSecurity and privacy · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 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 |
Optical networks · 50% Routing and switching · 50% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Authentication and access control › device authentication
iot authentication |
0.8 | 1 | 2024 | Deeper Insight Into Why Authentication Schemes in IoT Environments Fail to Achieve the Desired Security · IEEE Trans. Inf. Forensics Secur. 2024 |
Cryptographic primitives and cryptanalysis
provable security |
0.2 | 1 | 2024 | Deeper Insight Into Why Authentication Schemes in IoT Environments Fail to Achieve the Desired Security · IEEE Trans. Inf. Forensics Secur. 2024 |
Routing and switching › switching networks
multistage interconnection network |
0.0 | 1 | 2001 | Equivalent permutation capabilities between time-division optical omega networks and non-optical extra-stage omega networks · IEEE/ACM Trans. Netw. 2001 |
Optical networks
optical interconnect |
0.0 | 1 | 2001 | Equivalent permutation capabilities between time-division optical omega networks and non-optical extra-stage omega networks · IEEE/ACM Trans. Netw. 2001 |
Methods — techniques the papers use, named apart from their topics
security attribute analysis · 0.8attack classification · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | A provably secure and practical end-to-end authentication scheme for tactile Industrial Internet of Things
Yimin Guo 0001, Yajun Guo, Ping Xiong 0001, Fan Yang 0034, Chengde Zhang |
Pervasive Mob. Comput. | 4 |
| 2024 | Deeper Insight Into Why Authentication Schemes in IoT Environments Fail to Achieve the Desired SecurityabstractDesigning an efficient and secure authentication scheme is an significant means to ensure the security of IoT systems. Hundreds of authentication schemes tailored for IoT environments have been proposed in recent years, and regrettably, many of them were soon found to have succumbed to security vulnerabilities. In an effort to investigate the underlying reason for this, Wang et al. (at TIFS’23) recently analyzed the vulnerability of authentication schemes from the perspective of provable security. However, we observe that some authentication schemes with sound security proofs and heuristic security analysis are also not resistant to certain attacks, and even those that have been improved several times are still not immune. To explore the deep-seated reasons for security vulnerabilities in IoT authentication schemes, we divide security attacks into explicit and implicit attacks and find that many authentication schemes exhibit security under explicit attacks but are rendered vulnerable under implicit attacks. Further, we propose the relationship between the design goals of security attributes of authentication schemes and implicit attacks, analyze the vulnerability of three typical authentication schemes under implicit attacks, and find that only the security attributes capable of resisting the strongest implicit attacks are secure. Finally, we offer some specific suggestions on how to achieve the security attribute goals. Yimin Guo 0001, Yajun Guo, Ping Xiong 0001, Fan Yang 0034, Chengde Zhang |
IEEE Trans. Inf. Forensics Secur. | 4 |
| 2012 | A self-adaptive K selection mechanism for re-authentication load balancing in large-scale systems
Fan Yang 0034, Naixue Xiong, Jong Hyuk Park 0001 |
J. Supercomput. | 1 |
| 2011 | Security analysis and improvements of IEEE standard 802.16 in next generation wireless metropolitan access networkabstractAbstract Next generation communications (NGC) represents advanced communication environments featuring objects that are focused on users. It is crucial to protect information and digital forensics for NGC. In this paper, we aim to address network security for NGC, including IEEE standard 802.16 that are associated with NGC utilization. The IEEE standard 802.16 is a wireless air interface technology in Wireless Metropolitan Access Network (WMAN). Now in the new era of wireless networking, it is the solution for ‘last mile’ problem. Point‐to‐MultiPoint (PMP) network architecture network mode and mesh network mode are two optional networking modes proposed in this standard. However, the security problems in its original protocol may be becoming the most serious obstacle in its marketable producing process. In this paper, explanation and analysis of the security mechanism are based on PMP and mesh networking modes, respectively. This paper focuses on authentication & authorization, which is the most important part but not explicitly defined in original security design of IEEE standard 802.16. Two improved schemes focused on authentication & authorization based on the two modes are proposed to strengthen 802.16 WMAN security, respectively. The relevant analysis and simulation results prove that our schemes are effective. Copyright © 2009 John Wiley & Sons, Ltd. Naixue Xiong, Fan Yang 0034, Hongyan Li 0003, Jong Hyuk Park 0001, Yuan-Shun Dai, Yi Pan 0001 |
Wirel. Commun. Mob. Comput. | 2 |
| 2010 | A Fast Formation Flocking Scheme for a Group of Interactive Distributed Mobile Nodes in Autonomous Networks
Naixue Xiong, Yan Zhang 0002, Laurence T. Yang, Sang-Soo Yeo, Lei Shu 0001, Fan Yang 0034 |
Mob. Networks Appl. | 6 |
| 2001 | Equivalent permutation capabilities between time-division optical omega networks and non-optical extra-stage omega networksabstractBecause signals carried by two waveguides entering a common switch element would generate crosstalk, a regular N/spl times/N multistage interconnection network (MIN) cannot be directly used as an optical switch between N inputs and N outputs in an optical network. A simple solution is to use a 2N/spl times/2N cube-type MIN to provide the N/spl times/N connections, which needs a much larger hardware cost. A previous research proposed another solution, called the time-domain approach, that divides the N optical inputs into several groups such that crosstalk-free connections can be provided by an N/spl times/N regular MIN in several time slots, one for each group. Researchers studied this approach on Omega networks and defined the class set /spl theta/ to be the set of N-permutations realizable in two time slots on an Omega network. They proved that the size of /spl theta/ is larger than the size of class /spl Omega/, where /spl Omega/ consists of all N-permutations admissible to a regular N/spl times/N (nonoptical) Omega network. This paper first presents an optimal O(NlogN) time algorithm for identifying whether a given permutation belongs to class /spl theta/ or not. Using this algorithm, this paper then proves an interesting result that the class /spl theta/ is identical to the class /spl Omega/+1 which represents the set of N-permutations admissible to a nonoptical N/spl times/N one-extra stage Omega network. Fan Yang 0034, Yi Pan 0001 |
IEEE/ACM Trans. Netw. | 2 |
| 1999 | Equivalent permutation capabilities between time division optical omega network and non-optical extra stage omega networkabstractSince optical networks must support crosstalk-free (CF) connections, regular N/spl times/N multistage interconnection networks (MINs) cannot be directly used to provide connections between N inputs and N outputs. A solution is to use a 2N/spl times/2N Cube-Type MIN to provide the N/spl times/N connections. C. Qiao (1993) proposed a time domain approach that divides the N optical inputs into several groups such that CF connections can be provided by an N/spl times/N regular MIN in several time slots, one for each group. The set of N-permutations realizable in two slots is defined as class /spl theta/. Qiao proved that the size of /spl theta/ is larger than the size of class /spl Omega/, where /spl Omega/ consists of all N-permutations passible through a regular N/spl times/N Omega network. The paper first presents an optimal O(NlgN) time algorithm for identifying whether a given permutation belongs to class /spl theta/ or not. From this algorithm, the paper proves an interesting fact that the class /spl theta/ is identical to the class /spl Omega/+1 which represents the set of N-permutations admissible by a non-optical N/spl times/N one-extra stage Omega network. Fan Yang 0034, Yi Pan 0001 |
IPCCC | 2 |