Li Li

Li Li

Auto-generated profile, based on publicly available information

Li Li

School of Cyber Science and Engineering, Wuhan University, Wuhan, China

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
18 March 2020 in Journal of Medical Systems
Verified
Journal Article
Closed access
PDF file
ZXZhiyan Xu
Zhiyan Xu
Debiao HeDebiao He
Debiao He
PVP. Vijayakumar
P. Vijayakumar
KCKim-Kwang Raymond Choo
Kim-Kwang Raymond Choo
LLLi Li
Li Li

25 July 2020 in Telecommunication Systems
Verified
Journal Article
Closed access
PDF file
XSXia Sun
Xia Sun
JZJinglin Zou
Jinglin Zou
LLLi Li
Li Li
MLMin Luo
Min Luo

24 March 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
CPCong Peng
Cong Peng
MLMin Luo
Min Luo
LLLi Li
Li Li
KCKim-Kwang Raymond Choo
Kim-Kwang Raymond Choo
Debiao HeDebiao He
Debiao He
Wireless body area networks (WBANs) have become more commonplace, including in healthcare settings. For example, in a healthcare WBAN deployment, body sensor units (BSUs) are used to sense and collect health-related and medical-related information prior to sending relevant information to the server for analysis that can subsequently inform treatment plan. Given the sensitivity of both data-at-rest and data-in-transit, data authentication is fundamental to the success of such systems. However, BSUs are generally resource constrained and, hence, conventional cryptographic algorithms are not practical. Therefore, in this article, we propose an efficient certificateless online/offline signature scheme and design a lightweight data authentication protocol for WBANs. We then evaluate the security and performance of our proposed scheme, where the security analysis demonstrates that the proposed scheme satisfies existential unforgeability under the random oracle model. Findings from the performance evaluation also demonstrate that our scheme incurs very low computational cost during the signing operations. In comparison to several other competing approaches, our proposed scheme achieves a significant reduction in computational cost (up to 89%) for the offline signer and supports batch verification to reduce the verifier's execution time. In addition, we also show that the signature size of our proposed scheme is similar to those of the conventional signature schemes.

13 October 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
XJXiaoying Jia
Xiaoying Jia
MLMin Luo
Min Luo
KCKim-Kwang Raymond Choo
Kim-Kwang Raymond Choo
LLLi Li
Li Li
Debiao HeDebiao He
Debiao He
Ensuring the security and privacy of users and data in a mobile-edge computing (MEC) deployment, without affecting performance, latency and user quality of experience remain challenging. For example, in this article, we revisit an identity-based anonymous authentication scheme designed for MEC deployment. Then, we reveal that the scheme is vulnerable to impersonation, replay, and Denial-of-Service (DoS) attacks, contrary to their claims. It also does not achieve user untraceability, and the registration center must be online during authentication. We also observe that it is unclear from their scheme description, what encryption algorithm should be used in the authentication process. Therefore, we redesign the scheme in order to mitigate the weaknesses pointed out. Our redesigned protocol uses password and biometrics for authentication, which broadens the scope for real-world implementation. We also provide both formal security proof and heuristic security analysis to demonstrate that the proposed scheme achieves the desired security goals. A performance comparison shows that our scheme outperforms four other competing schemes in terms of computation and communication costs.

3 February 2020 in IEEE Access
Verified
Journal Article
Open access
BCBiwen Chen
Biwen Chen
LWLibing Wu
Libing Wu
LLLi Li
Li Li
KCKim-Kwang Raymond Choo
Kim-Kwang Raymond Choo
Debiao HeDebiao He
Debiao He
Data sharing through the cloud is flourishing with the development of cloud computing technology. The new wave of technology will also give rise to new security challenges, particularly the data confidentiality in cloud-based sharing applications. Searchable encryption is considered as one of the most promising solutions for balancing data confidentiality and usability. However, most existing searchable encryption schemes cannot simultaneously satisfy requirements for both high search efficiency and strong security due to lack of some must-have properties, such as parallel search and forward security. To address this problem, we propose a variant searchable encryption with parallelism and forward privacy, namely the parallel and forward private searchable public-key encryption (PFP-SPE). PFP-SPE scheme achieves both the parallelism and forward privacy at the expense of slightly higher storage costs. PFP-SPE has similar search efficiency with that of some searchable symmetric encryption schemes but no key distribution problem. The security analysis and the performance evaluation on a real-world dataset demonstrate that the proposed scheme is suitable for practical application.

1 November 2006 in Wuhan University Journal of Natural Sciences
Verified
Journal Article
Closed access
PDF file
LLLi Li
Li Li
ZHZhang Huanguo
Zhang Huanguo