EDBT 2026 Demo / reviewers in the wild / expert
Shulin Ke
dblp:334/5953
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2024
0000-0003-3924-3096ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1 · 1 since 2021Software engineering, systems software and programming languages · 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 |
Malware analysis · 36% Systems and software security · 36% Blockchain and cryptocurrency security · 28% | |
| Theoretical computer science
1 paper |
Algorithmic game theory and mechanism design · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 100% |
Topics — the 3 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Malware analysis › malware detection
malicious package detection |
0.8 | 1 | 2024 | SpiderScan: Practical Detection of Malicious NPM Packages Based on Graph-Based Behavior Modeling and Matching · ASE 2024 |
Systems and software security
supply chain security |
0.8 | 1 | 2024 | SpiderScan: Practical Detection of Malicious NPM Packages Based on Graph-Based Behavior Modeling and Matching · ASE 2024 |
Algorithmic game theory and mechanism design
equilibrium analysis |
0.6 | 1 | 2022 | A Storage Sustainability Mechanism With Heterogeneous Miners in Blockchain · IEEE J. Sel. Areas Commun. 2022 |
Methods — techniques the papers use, named apart from their topics
prototype implementation · 1.7game theory · 1.7equilibrium analysis · 1.7graph-based behavior modeling · 0.8behavior matching · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | SpiderScan: Practical Detection of Malicious NPM Packages Based on Graph-Based Behavior Modeling and MatchingabstractOpen source software (OSS) supply chains have been attractive targets for attacks. One of the significant, popular attacks is realized by malicious packages on package registries. NPM, as the largest package registry, has been recently flooded with malicious packages. In response to this severe security risk, many detection tools have been proposed. However, these tools do not model malicious behavior in a holistic way; only consider a predefined set of sensitive APIs; and require huge manual confirmation effort due to high false positives and binary detection results. Thus, their practical usefulness is hindered. Ruisi Wang, Zhuotong Zhou, Susheng Wu, Shulin Ke, Bihuan Chen 0001, Xin Peng 0001 |
ASE | 6 |
| 2022 | A Storage Sustainability Mechanism With Heterogeneous Miners in BlockchainabstractIn current blockchain systems, the transaction fee is often not enough to cover the storage cost, jeopardizing blockchain sustainability in the long run. Such a storage sustainability issue is partially due to miners’ heterogeneous storage costs and users’ low-intensity fee competition. Motivated by these two observations, we propose a Fee and Transaction Expiration Time (FTET) mechanism to alleviate this issue. Specifically, we model the blockchain operation as a three-stage game. In Stage I, the system designer proposes the storage sustainability mechanism. In Stage II, each user decides whether to propose transactions and the corresponding transaction fees. In Stage III, each miner decides which transactions to include in the block. Although the analysis of the heterogeneous miner interaction is technically challenging, we fully solve it in closed-form motivated by how miners select transactions in practice. The equilibrium analysis reveals that high-storage-cost miners admit transactions with fees above a time-increasing threshold. Under the optimal FTET mechanism, the blockchain system can achieve the storage sustainability without any social welfare loss, comparing with the maximum achievable social welfare without the storage sustainability constraint. Moreover, the optimal FTET mechanism achieves a higher social welfare than the fee mechanism in current practice by selectively rejecting some transactions suffering high delays. Finally, we implement a blockchain prototype to compare the performance of the optimal FTET mechanism with the mining round time adjustment (MRTA) mechanism. The optimal FTET mechanism achieves higher social welfare (94.5% on average) and better storage sustainability. We find that more pending transactions may lead to lower transaction fees. Yunshu Liu, Shulin Ke, Zhixuan Fang, Man Hon Cheung, Wei Cai 0002, Jianwei Huang 0001 |
IEEE J. Sel. Areas Commun. | 2 |