Lei Fan

Lei Fan

Auto-generated profile, based on publicly available information

Lei Fan

Shanghai Jiao Tong University

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
2 June 2008 in Computers & Security
Verified
Journal Article
Closed access
SZShaojun Zhang
Shaojun Zhang
Jianhua LiJianhua Li
Jianhua Li
XCXiuzhen Chen
Xiuzhen Chen
LFLei Fan
Lei Fan

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

1 December 2011
Verified
Conference Paper
Closed access
YDYi Ding
Yi Ding
LFLei Fan
Lei Fan
Protocols for password-based authenticated key exchange (PAKE) allow two users who share only a short, low-entropy password to agree on a cryptographically strong session key. One must ensure that protocols are immune to off-line dictionary attacks in which an adversary exhaustively enumerates all possible passwords in an attempt to determine the correct one. Recently Katz, et al. [6] gave a new framework for realizing PAKE without random oracles, in the common reference string model. In this paper, we instantiate the framework of [6] under the lattices assumptions. Specifically, we modified the lattice-based approximate projective hashing introduced in [11] and plug it into the framework of [6], and we prove our new PAKE is efficient and secure based on the security of GK's PAKE framework [6] in the standard model.

10 June 2020 in Propellants, Explosives, Pyrotechnics
Verified
Journal Article
Closed access
PDF file
QYQin Ye
Qin Ye
QFQiubo Fu
Qiubo Fu
FLFan Lei
Fan Lei
SYShuang Yang
Shuang Yang

27 November 2023
Verified
Conference Paper
Open access
ZCZixuan Chen
Zixuan Chen
LFLei Fan
Lei Fan
SLShengyun Liu
Shengyun Liu
MVMarko Vukolić
Marko Vukolić
XWXiangzhe Wang
Xiangzhe Wang
JZJingjing Zhang
Jingjing Zhang
Asynchronous Byzantine Fault-Tolerant (BFT) consensus protocols maintain strong consistency across nodes (i.e., ensure safety) and terminate probabilistically (i.e., ensure liveness) despite unbounded network delay. In contrast to protocols under partial synchrony, asynchronous counterparts pay no extra timing assumptions for electing a special role, and thus is more robust to network issues. To formally study this feature, we propose a new classification method for consensus and accordingly categorize relevant work: timing-balanced protocols are those that do not introduce strictly stronger timing-related assumptions for liveness, compared to ones required by safety. We further propose ThemiX, a novel timing-balanced protocol under the hybrid model: either there is no corrupt node, or the number of correct and online nodes constitute a majority. ThemiX tolerates f Byzantine faults with a total of n = 2f + 1 nodes, achieving optimal resilience. If every node is honest or benign, ThemiX is an asynchronous protocol. Otherwise, ThemiX relies on timing assumptions for ensuring safety and probabilistic termination. No leader or any special role is elected. To boost performance, we further integrate two practical mechanisms that respectively allow ThemiX to proceed at the pace of actual network speed and bypass the expensive coin-tossing phase (i.e., randomization). Large-scale experiments on Amazon EC2 platform show that ThemiX achieves up to 86% reduction in latency compared to the consensus component of HoneyBadgerBFT and provides sustainable performance under simulated network faults.

29 March 2022 in SAE International Journal of Advances and Current Practices in Mobility
Verified
Conference Paper
Closed access
SZSu Zhou
Su Zhou
GZGang Zhang
Gang Zhang
ZWZixiang Wang
Zixiang Wang
LFLei Fan
Lei Fan
FPFenglai Pei
Fenglai Pei
High-powered and modularity is the trend for fuel cell systems. Similar to the evolution from single-cylinder to multi-cylinder in conventional internal combustion engines, fuel cell systems shall also follow this developing process. Compared to single-stack fuel cell systems, multi-stack fuel cell systems (MFCS) can enhance the system maximum output power and improve the system performance. To achieve modular design and improve the performance of high-powered MFCS, a MFCS stacks allocation optimization algorithm based on genetic algorithms is proposed in this paper. First, remaining useful life (RUL) and efficiency are choosing as an integrated optimization index, the decision model for MFCS stacks allocation is developed. Then, a heavy-duty commercial vehicle was used as an example to match the vehicle power train parameters. The genetic algorithm is used to solve the global optimal stacks allocation scheme for the vehicle in a specific application scenario. The individual fitness values in the genetic algorithm are solved by the SQP algorithm. The optimized results are analyzed and beneficial conclusions are obtained. Weights of efficiency and RUL and the number of stacks has impacts on the determination of optimal stacks allocation scheme. The overall system efficiency will increase with the efficiency factor weight increase, and the overall RUL will decrease with the efficiency factor weight increase. If the focus is on improving the overall economy of the MFCS, the efficiency/RUL weights shall be taken as 1/0. Finally, the impact of different stacks allocation schemes on the efficiency and RUL of the MFCS is compared.