Liqin Hu

Dr. Liqin Hu

orcid

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
13 April 2012 in Designs, Codes and Cryptography
Verified
Journal Article
Closed access
PDF file
LHLiqin Hu
Liqin Hu
QYQin Yue
Qin Yue

22 October 2016 in Chinese Annals of Mathematics, Series B
Verified
Journal Article
Closed access
PDF file
LHLiqin Hu
Liqin Hu
QYQin Yue
Qin Yue
XZXiaomeng Zhu
Xiaomeng Zhu

15 December 2021 in Security and Communication Networks
Verified
Journal Article
Open access
PDF file
XMXuechun Mao
Xuechun Mao
LYLIN YOU
LIN YOU
CCChengtang Cao
Chengtang Cao
GHGengran Hu
Gengran Hu
LHLiqin Hu
Liqin Hu
Biometric encryption, especially based on fingerprint, plays an important role in privacy protection and identity authentication. In this paper, we construct a privacy-preserving linkable ring signature scheme. In our scheme, we utilize a fuzzy symmetric encryption scheme called symmetric keyring encryption (SKE) to hide the secret key and use non-interactive zero-knowledge (NIZK) protocol to ensure that we do not leak any information about the message. Unlike the blind signature, we use NIZK protocol to cancel the interaction between the signer (the prover) and the verifier. The security proof shows that our scheme is secure under the random oracle model. Finally, we implement it on a personal computer and analyze the performance of the constructed scheme in practical terms. Based on the constructed scheme and demo, we give an anonymous cryptocurrency transaction model as well as mobile demonstration.

15 October 2018 in Quantum Information Processing
Verified
Journal Article
Closed access
PDF file
LHLiqin Hu
Liqin Hu
QYQin Yue
Qin Yue
XHXianmang He
Xianmang He

1 January 2024 in Advances in Mathematics of Communications
Verified
Journal Article
Closed access
PDF file
XQXiaoshan Quan
Xiaoshan Quan
QYQin Yue
Qin Yue
LHLiqin Hu
Liqin Hu
Let $ G $ be a generator matrix of a linear code $ \mathcal C $ and $ [G: I_k] $ be a generator matrix of its extendable linear code $ \mathcal {C}' $, we call $ \mathcal C $ is optimally (almost optimally) extendable if $ d(\mathcal C^\perp) = d({\mathcal C'}^\perp) $($ d(\mathcal C^\perp) $ is very close to $ d({\mathcal C'}^\perp) $, respectively), where $ d(\mathcal C^\perp) $ is the minimal distance of the dual code of $ \mathcal C $. In order to safeguard the susceptible information lay in registers oppose SCA and FIA, it is useful to construct an optimally extendable linear code $ \mathcal C $. In this paper, we construct three classes of (almost) optimally extendable linear codes: (1) irreducible cyclic codes; (2) maximum-distance-separable (MDS) codes and near maximum-distance-separable (NMDS) codes.

1 January 2023 in Computer Modeling in Engineering & Sciences
Verified
Journal Article
Open access
PDF file
QLQiuyun Lyu
Qiuyun Lyu
CMChenhao Ma
Chenhao Ma
YSYanzhao Shen
Yanzhao Shen
SJShaopeng Jiao
Shaopeng Jiao
YSYipeng Sun
Yipeng Sun
LHLiqin Hu
Liqin Hu
Smart contracts running on public blockchains are permissionless and decentralized, attracting both developers and malicious participants. Ethereum, the world’s largest decentralized application platform on which more than 40 million smart contracts are running, is frequently challenged by smart contract vulnerabilities. What’s worse, since the homogeneity of a wide range of smart contracts and the increase in inter-contract dependencies, a vulnerability in a certain smart contract could affect a large number of other contracts in Ethereum. However, little is known about how vulnerable contracts affect other on-chain contracts and which contracts can be affected. Thus, we first present the contract dependency graph (CDG) to perform a vulnerability analysis for Ethereum smart contracts, where CDG characterizes inter-contract dependencies formed by DELEGATECALL-type internal transaction in Ethereum. Then, three generic definitions of security violations against CDG are given for finding respective potential victim contracts affected by different types of vulnerable contracts. Further, we construct the CDG with 195,247 smart contracts active in the latest blocks of the Ethereum and verify the above security violations against CDG by detecting three representative known vulnerabilities. Compared to previous large-scale vulnerability analysis, our analysis scheme marks potential victim contracts that can be affected by different types of vulnerable contracts, and identify their possible risks based on the type of security violation actually occurring. The analysis results show that the proportion of potential victim contracts reaches 14.7%, far more than that of corresponding vulnerable contracts (less than 0.02%) in CDG.