Haibao Zhang

Mr. Haibao Zhang


Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
27 December 2024 in Applied Sciences
Verified
Journal Article
Open access
PDF file
HZHaibao Zhang
Haibao Zhang
WJWenbao Jiang
Wenbao Jiang
DJDing Jin
Ding Jin
Permissioned blockchains are increasingly used in areas like supply chain management, financial transactions, and medical data sharing, where ensuring data consistency and security is critical. However, these systems are vulnerable to threats such as DDoS attacks, forged transactions, and certificate authority compromises, primarily due to inadequate network layer admission control. Existing solutions, like static whitelisting, struggle with scalability and adaptability in dynamic environments. This paper proposes a novel admission control mechanism based on identity-based cryptography, utilizing multi-level anonymous identifiers and decentralized private key generation to enhance user authentication and privacy. The mechanism dynamically updates whitelists and selectively filters network traffic, ensuring a balance between security and performance. Experimental results validate its effectiveness in mitigating key threats while maintaining operational efficiency.

27 February 2025 in Applied Sciences
Verified
Journal Article
Open access
PDF file
WJWenbao Jiang
Wenbao Jiang
JLJinquan Li
Jinquan Li
YGYangnan Guo
Yangnan Guo
HZHaibao Zhang
Haibao Zhang
Cryptographic accumulators are now fundamental for secure applications across blockchain, IoT, and big data, powering anonymous credentials, streamlining key management, and enabling efficient data filtering. However, existing accumulator methods, like RSA, bilinear pairing, and Merkle trees, are hampered by storage bloat, computational burdens, and reliance on trusted administrators. To solve these problems, we introduce a hash-chain-based ordered universal accumulator that eliminates these drawbacks. Our scheme uses collision-resistant hash functions to dynamically manage sets while providing strong, verifiable membership and non-membership proofs, all without a trusted administrator. The benefits include self-certification, batch verification, and consistent representation of accumulated sets. Testing shows our scheme cuts storage by roughly 50% compared to Merkle trees and significantly speeds up computation over RSA-based approaches. This lightweight and scalable solution is ideal for constrained environments like IoT and blockchain, unlocking wider decentralized application adoption.

28 January 2025 in Preprints.org
Verified
Preprint
Open access
PDF file
WJWenbao Jiang
Wenbao Jiang
DJDing Jin
Ding Jin
HZHaibao Zhang
Haibao Zhang
HDHuiming Du
Huiming Du
To address the issue of key lifespan in key security, a chain key model based on a message hash chain is proposed. This model breaks away from the traditional scheme of generating random keys using random number generators, using plaintext features as a source of randomness, and generates the next key in conjunction with the current key, achieving key updates on a per-packet basis. The verification of the message hash chain node values ensures the consistency of the keys. The model utilizes messages and hash functions to enhance the randomness and secrecy of the keys. Security analysis shows that the complexity of cracking any key is O(2^n) . Experiments indicate that compared to the IPsec system, this model significantly reduces the lifespan of keys, and the Hamming distance, autocorrelation coefficient, and entropy value of the generated key hash chain conform to random characteristics. By introducing this model to generate the seed keys for the Salsa sequence cipher, the security and randomness of the Salsa sequence cipher are enhanced, increasing its complexity from the original O(2^n) to O(m2^2n), and when the transmitted message is 1400 bytes, the encryption efficiency is improved by more than 35% compared to the use of AES encryption in IPsec.

28 March 2025 in Applied Sciences
Verified
Journal Article
Open access
PDF file
WJWenbao Jiang
Wenbao Jiang
DJDing Jin
Ding Jin
HZHaibao Zhang
Haibao Zhang
In response to the issues of high transaction transparency and regulatory difficulties in blockchain account-model transactions, this paper presents a supervised blockchain anonymous transaction model based on certificateless signcryption aimed at ensuring secure blockchain transactions while minimizing both computational and communication overhead. During the transaction process, this approach utilizes certificateless public key signcryption without bilinear pairs to generate anonymous user identities, achieving strong anonymity of user identities and confidentiality of transaction amounts. It employs the Paillier homomorphic encryption algorithm to update transaction amounts and uses the FO commitment-based zero-knowledge proof scheme to validate transaction legality. Additionally, adopting a publicly verifiable secret threshold sharing scheme for hierarchical regulatory authority reduces the security risk of a single regulator storing the regulatory key. This model not only meets the privacy and timely update requirements of account-based blockchain transactions but also effectively regulates abnormal transactions. Rigorous security analysis and proofs demonstrate that this model possesses excellent anonymity, traceability, forward security, and backward security. When compared to similar schemes, the computational cost is reduced by at least 33.18%, effectively fulfilling the requirements for security.