Chen Shan

Chen Shan

Auto-generated profile, based on publicly available information

Chen Shan

Blockchain Platform Division, Ant Group, Hangzhou, China

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 October 2023
Verified
Conference Paper
Open access
SLShengyun Liu
Shengyun Liu
WXWenbo Xu
Wenbo Xu
CSChen Shan
Chen Shan
XYXiaofeng Yan
Xiaofeng Yan
TXTianjing Xu
Tianjing Xu
HZHui Zhang
Hui Zhang

6 December 2011 in Procedia Engineering
Verified
Journal Article
Open access
PDF file
MJMa Jun-Chun
Ma Jun-Chun
YWYongjun Wang
Yongjun Wang
SJSun Ji-Yin
Sun Ji-Yin
CSChen Shan
Chen Shan
In order to improve network's security, a minimum cost of network hardening model (MCNHM) based on attack graphs is presented. Firstly, the bidirectional-based search strategy is used to search the network vulnerabilities’ relationship, which improves the generation efficiency of attack graphs, and reduces the system resource consumption; Secondly, this model gives the formal definition of minimum-cost of network hardening; Finally, it combines attack graphs and genetic algorithm, and transforms the problem of minimum cost of network hardening to a non-restraint optimization problem with penalty by establishing the corresponding mathematical model, which guarantees the network security with the least cost. This model is an important component of the National High-Tech Research and Development Plan of China, under Grant No.2009AA01Z432, a great of experimental results show that this model can find the minimum cost of target network, so it can help network security managers carry on safety protection in pertinence, and has important practical significance.

3 December 2021 in Security and Communication Networks
Verified
Journal Article
Open access
PDF file
CSChen Shan
Chen Shan
LFLei Fan
Lei Fan
We present Lodestone, a chain-based Byzantine fault-tolerant (BFT) state machine replication (SMR) protocol under partial synchrony. Lodestone enables replicas to achieve consensus with two phases of voting and enjoys (1) optimistic responsiveness and (2) linear communication complexity on average. Similar to the state-of-the-art chain-based BFT protocols, Lodestone can be optimized with a pipelining idea elegantly. We implement pipelined Lodestone and deploy experiments to evaluate its performance. The evaluation results demonstrate that Lodestone has a lower latency than HotStuff under various workloads.