Gengran Hu

Dr. Gengran Hu

orcid

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
10 August 2021 in Security and Communication Networks
Verified
Journal Article
Open access
PDF file
YXYingjie Xu
Yingjie Xu
GHGengran Hu
Gengran Hu
LYLIN YOU
LIN YOU
CCChengtang Cao
Chengtang Cao
In recent years, a lot of vulnerabilities of smart contracts have been found. Hackers used these vulnerabilities to attack the corresponding contracts developed in the blockchain system such as Ethereum, and it has caused lots of economic losses. Therefore, it is very important to find out the potential problems of the smart contracts and develop more secure smart contracts. As blockchain security events have raised more important issues, more and more smart contract security analysis methods have been developed. Most of these methods are based on traditional static analysis or dynamic analysis methods. There are only a few methods that use emerging technologies, such as machine learning. Some models that use machine learning to detect smart contract vulnerabilities cost much time in extracting features manually. In this paper, we introduce a novel machine learning-based analysis model by introducing the shared child nodes for smart contract vulnerabilities. We build the Abstract-Syntax-Tree (AST) for smart contracts with some vulnerabilities from two data sets including SmartBugs and SolidiFI-benchmark. Then, we build the Abstract-Syntax-Tree (AST) of the labeled smart contract for data sets named Smartbugs-wilds. Next, we get the shared child nodes from both of the ASTs to obtain the structural similarity, and then, we construct a feature vector composed of the values that measure structural similarity automatically to build our machine learning model. Finally, we get a KNN model that can predict eight types of vulnerabilities including Re-entrancy, Arithmetic, Access Control, Denial of Service, Unchecked Low Level Calls, Bad Randomness, Front Running, and Denial of Service. The accuracy, recall, and precision of our KNN model are all higher than 90%. In addition, compared with some other analysis tools including Oyente and SmartCheck, our model has higher accuracy. In addition, we spent less time for training .

26 October 2022 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Open access
XZXinhua Zhang
Xinhua Zhang
LYLIN YOU
LIN YOU
GHGengran Hu
Gengran Hu
In order to analyze real-time power data without revealing users’ privacy, privacy-preserving data aggregation schemes have been extensively researched in smart grid. However, most of the existing schemes either can only allow stationary users, or require a trusted center. In this paper, we propose an efficient and robust multidimensional data aggregation scheme based on blockchain. In our scheme, a leader election algorithm in Raft protocol is used to select a mining node from all smart meters to aggregate data. A dynamically verifiable secret sharing homomorphism scheme is adopted to realize flexible dynamic user management. In addition, our scheme can not only resist internal and external attacks but also support multidimensional data aggregation and fault tolerance. The security analysis shows that our proposed scheme is IND-CPA secure and can meet stronger security features. The experimental results show that compared with other schemes, our scheme can be implemented with lower computation and communication overhead.

25 February 2022 in Entropy
Verified
Journal Article
Open access
PDF file
CDCong Deng
Cong Deng
LYLIN YOU
LIN YOU
XTXianghong Tang
Xianghong Tang
GHGengran Hu
Gengran Hu
SGShuhong Gao
Shuhong Gao
Zero-Knowledge Proof is widely used in blockchains. For example, zk-SNARK is used in Zcash as its core technology to identifying transactions without the exposure of the actual transaction values. Up to now, various range proofs have been proposed, and their efficiency and range-flexibility have also been improved. Bootle et al. used the inner product method and recursion to construct an efficient Zero-Knowledge Proof in 2016. Later, Benediky Bünz et al. proposed an efficient range proof scheme called Bulletproofs, which can convince the verifier that a secret number lies in [0,2κ−1] with κ being a positive integer. By combining the inner-product and Lagrange’s four-square theorem, we propose a range proof scheme called Cuproof. Our Cuproof can make a range proof to show that a secret number v lies in an interval [a,b] with no exposure of the real value v or other extra information leakage about v. It is a good and practical method to protect privacy and information security. In Bulletproofs, the communication cost is 6+2logκ, while in our Cuproof, all the communication cost, the proving time and the verification time are of constant sizes.

25 September 2023 in Computer Networks
Verified
Journal Article
Closed access
WLWeibiao Liang
Weibiao Liang
LYLIN YOU
LIN YOU
GHGengran Hu
Gengran Hu

16 July 2024 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
QZQiang Zhu
Qiang Zhu
LYLIN YOU
LIN YOU
GHGengran Hu
Gengran Hu
SWShengguo Wang
Shengguo Wang
Currently, the biometric-based authentication schemes have been widely deployed in the mobile edge computing environment to ensure the authenticity of the edge nodes’ identities. While some solutions for the mobile edge computing adopting a tripartite architecture employ anonymous authentication to protect the edge nodes’ sensitive biometric data and transaction information, these solutions come with their own set of challenges. Specifically, the service provider is unable to hold the edge nodes accountable for any violation committed during the transactions. Moreover, the edge nodes are unable to revoke their identity information stored in the registration center. To address these issues, in this work, we introduce a secure and efficient biometric-based anonymous authentication scheme for the mobile edge computing. Our approach utilizes noninteractive zero-knowledge (NIZK) arguments and linear encryption to achieve anonymity and traceability of the edge nodes’ identities, while also using accumulators to implement the revocability of the edge nodes’ identities, ensuring that the edge nodes with revoked identities cannot pass the verification of the service provider. Additionally, we design an efficient batch verification protocol to handle anonymous authentication messages for the large-scale edge nodes. The feasibility of the proposed scheme could be proven positively by both of the experimental results and the security analysis. The experimental results show that our approach requires up to 418 ms to create an anonymous identity and 16.2 ms to verify it. The time consumption for batch verification of the anonymous identities of the 1200 edge nodes is only 54.4 ms.

14 July 2024 in Computers & Security
Verified
Journal Article
Open access
CGChunjie Guo
Chunjie Guo
LYLIN YOU
LIN YOU
XLXingyu Li
Xingyu Li
GHGengran Hu
Gengran Hu
SWShengguo Wang
Shengguo Wang
CCChengtang Cao
Chengtang Cao