Hailong Yao

Hailong Yao

Auto-generated profile, based on publicly available information

Hailong Yao

College of Mathematics and Statistics, Northwest Normal University, Lanzhou, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
26 November 2021 in Soft Computing
Verified
Journal Article
Closed access
PDF file
HYHailong Yao
Hailong Yao
QYQiao Yan
Qiao Yan
XFXingbing Fu
Xingbing Fu
ZZZhibin Zhang
Zhibin Zhang
CLCaihui Lan
Caihui Lan

6 August 2019 in IEEE Access
Verified
Journal Article
Open access
HYHailong Yao
Hailong Yao
CWCaifen Wang
Caifen Wang
XFXingbing Fu
Xingbing Fu
CLChao Liu
Chao Liu
BWBin Wu
Bin Wu
FLFagen Li
Fagen Li
Lwamo et al. recently proposed a robust and efficient remote single and multi-server biometric authentication scheme using smart card and RSA. The scheme is vulnerable to the smart card lost attacks; therefore, the scheme cannot resist offline guessing attacks and user impersonation attacks, and cannot provide forward security and user anonymity. To address these issues, we propose a new privacy-preserving ring learning with errors (RLWE)-based remote biometric authentication scheme (RRBAS) for single and multi-server environments. RRBAS is the first lattice-based remote biometric authentication scheme for multi-server environments. Security analysis show that RRBAS can satisfy the authenticated key exchange (AKE) security in the random oracle model, resist known security attacks, and provide post-quantum security. The experimental evaluation and comparative analysis show that RRBAS's computational efficiency is better than that of Lwamo et al., while the communication efficiency is slightly lower than traditional schemes because of the large-size ciphertext of the lattice-based cryptosystem, but it is fully capable of session key agreement in single and multi-server environments.

19 June 2020 in IEEE Access
Verified
Journal Article
Open access
CWCaifen Wang
Caifen Wang
BWBin Wu
Bin Wu
HYHailong Yao
Hailong Yao
The identity-based homomorphic signature (IBHS) enables an untrusted server to run some computation over the outsourced data and derive a short signature, vouching for the correctness of the output of the computation, while greatly simplifying key management. To our knowledge, constructions of IBHS have been few and far between. However, the existing IBHS schemes, which either handle only linear functions or has a large public key parameter and satisfies only the artificial notion of selective security. In this work, we construct the first leveled adaptively secure identity-based fully homomorphic signature (IBFHS) schemes without additional public parameters, which can be used to sign many different datasets. Thereby positively answering the open question of constructing a leveled IBFHS scheme with short public parameters, proposed by Wang et al. , (ISC, 2015, Springer). We achieve the stronger security and better parameters by using the trapdoor vanishing and vector encoding technique. In our scheme, the size of every evaluated signature depends only logarithmically on the size of the input dataset, and the complexity of verifying a signature for a computation can be amortized when verifying the same computation on many different datasets. Furthermore, we prove that our construction is strongly-unforgeable against adaptively chosen identity and message attacks under the small integer solution ( $\mathsf {SIS}$ ) assumption in standard lattices.

18 April 2025 in Engineering Structures
Verified
Journal Article
Closed access
TDTongyang Dao
Tongyang Dao
FYFan Yang
Fan Yang
WYWen Yi
Wen Yi
KLKefan Li
Kefan Li
HYHailong Yao
Hailong Yao
JWJiaojuan Wang
Jiaojuan Wang

15 March 2024 in Computer Standards & Interfaces
Verified
Journal Article
Closed access
CLCaihui Lan
Caihui Lan
HLHaifeng Li
Haifeng Li
CWCaifen Wang
Caifen Wang
XYXiaodong Yang
Xiaodong Yang
HYHailong Yao
Hailong Yao

26 April 2021 in Research Square
Verified
Preprint
Open access
PDF file
HYHailong Yao
Hailong Yao
QYQiao Yan
Qiao Yan
XFXingbing Fu
Xingbing Fu
ZZZhibin Zhang
Zhibin Zhang
CLCaihui Lan
Caihui Lan
The E-healthcare system has a complex architecture, diverse business types, and sensitive data security. To meet the secure communication and access control requirements in the user-medical server, user-patient, patient-medical server and other scenarios in the E-healthcare system, secure and efficient authenticated key agreement and access authorization scheme need to be studied. However, the existing multi-server solutions do not consider the authentication requirements of the Wireless Body Area Network(WBAN), and are not suitable for user-patient, patient-medical server scenarios; most of the existing WBAN authentication scheme are single-server type, which are difficult to meet the requirements of multi-server applications; the study of user-patient real-time scenarios has not received due attention. This work first reveals the structural flaws and security vulnerabilities of the existing typical schemes, and then proposes an authentication and access control architecture suitable for multiple scenarios of the E-healthcare system with separate management and business, and designs a novel ECC-based multi-factor remote authentication and access control scheme for E-healthcare using physically uncloneable function (PUF) and hash. Security analysis and efficiency analysis show that the new scheme has achieved improved functionality and higher security while maintaining low computational and communication overhead.