Wenbao Jiang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Wenbao Jiang has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Haibao Zhang
Beijing Information Science and Technology University
5 shared publications - Jin Ding
Department of Information Security, Beijing Infomation Science and Technology University, Beijing 102206, China
3 shared publications - Jinquan Li
Beijing Information Science and Technology University
2 shared publications - Haibao Zhang
College of Computer Science, Beijing Information Science and Technology University, Beijing, P. R. China
1 shared publication - Huiming Du
Beijing Infomation Science and Technology University, China
1 shared publication - Jin Ding
College of Computer Science and Technology, Beijing Information Science & Technology University, Beijing 102206, P. R. China
1 shared publication
Latest Publications
- Open Access
- 10 October 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (20) , 10017
A Linkable Anonymous and Verifiable Sealed-Bid Auction Scheme for Consortium Blockchain
Sealed-bid auctions require bidders to submit concealed bids within a prescribed bidding period, after which the bids are opened and compared to determine the highest bidder. However, existing auction systems still face challenges in protecting bidder privacy and bid data, verifying auction results, and reducing dependence on centralized auctioneers. This paper proposes LAV-Auction, a linkable anonymous and verifiable sealed-bid auction scheme for consortium blockchain. A registration authority publishes a ring of eligible public keys. Each bidder submits a commitment, a bid ciphertext containing the bid value and commitment randomness, and an auction-scoped linkable ring signature. The signature hides which registered key was used, while its key image enables the contract to reject repeated bids from the same credential in the same auction. After the contract fixes the accepted record order, the auction committee decrypts the bid ciphertexts. A verifier recomputes the digest of the frozen ledger records. It then verifies a Groth16 proof showing that the announced winner corresponds to a valid frozen bid with the highest value. LAV-Auction provides bidder anonymity, bid confidentiality before committee decryption, duplicate bid prevention, and verifiable winner correctness over the frozen valid bid set. Experiments on a Hyperledger Fabric implementation demonstrate practical computation, communication, and scalability trade-offs. The results show that LAV-Auction achieves millisecond-level result verification through succinct Groth16 proofs while maintaining compact result certification payloads under increasing bidder scales.
- 10 October 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (20) , 10017
Open AccessA Linkable Anonymous and Verifiable Sealed-Bid Auction Scheme for Consortium Blockchain
Sealed-bid auctions require bidders to submit concealed bids within a prescribed bidding period, after which the bids are opened and compared to determine the highest bidder. However, existing auction systems still face challenges in protecting bidder privacy and bid data, verifying auction results, and reducing dependence on centralized auctioneers. This paper proposes LAV-Auction, a linkable anonymous and verifiable sealed-bid auction scheme for consortium blockchain. A registration authority publishes a ring of eligible public keys. Each bidder submits a commitment, a bid ciphertext containing the bid value and commitment randomness, and an auction-scoped linkable ring signature. The signature hides which registered key was used, while its key image enables the contract to reject repeated bids from the same credential in the same auction. After the contract fixes the accepted record order, the auction committee decrypts the bid ciphertexts. A verifier recomputes the digest of the frozen ledger records. It then verifies a Groth16 proof showing that the announced winner corresponds to a valid frozen bid with the highest value. LAV-Auction provides bidder anonymity, bid confidentiality before committee decryption, duplicate bid prevention, and verifiable winner correctness over the frozen valid bid set. Experiments on a Hyperledger Fabric implementation demonstrate practical computation, communication, and scalability trade-offs. The results show that LAV-Auction achieves millisecond-level result verification through succinct Groth16 proofs while maintaining compact result certification payloads under increasing bidder scales.
- Open Access
- 30 September 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (19) , 9698
DG-VDT: Dynamic Graph-Guided Reinforcement Learning for Low-Latency Vulnerability Detection and Attack Traceability in Ethereum Smart Contracts
Ethereum hosts more than 50 million deployed contracts, and cumulative losses from contract exploits exceed three billion US dollars, making automated detection and attacker attribution a practical priority. Existing tool-augmented language models and reward-driven reinforcement learning reason over transaction text or a single graph view; they infer maliciousness from superficial topology and degrade when applied to attacks whose traces lack it. This article presents DG-VDT, a reinforcement-learning framework in which tool-centric rewards are replaced by graph-structured feedback derived directly from Ethereum Virtual Machine execution traces. Each trace is decomposed into three complementary graphs (fund flow, contract creation, and contract call), and a dual-stage reward first credits embedding similarity to a canonical attack signature, then enforces exact subgraph-isomorphism matching, with a smooth curriculum governing the transition. The framework is scoped to three structurally distinct vulnerability classes: reentrancy, short-address attack, and timestamp dependence. Zero-shot evaluation on two author-independent public corpora yields 87.7% macro- on SolidiFI-Bench and 84.0% (95% confidence interval 83.4–84.7) on SmartBugs Wild, exceeding fine-tuned GPT-4o by 6.8 and 6.3 points at 180 ms per trace on a single consumer graphics card. Ablation attributes 13.9 macro- points to the multi-graph representation. Extension beyond the three evaluated classes remains future work.- 30 September 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (19) , 9698
Open AccessDG-VDT: Dynamic Graph-Guided Reinforcement Learning for Low-Latency Vulnerability Detection and Attack Traceability in Ethereum Smart Contracts
Ethereum hosts more than 50 million deployed contracts, and cumulative losses from contract exploits exceed three billion US dollars, making automated detection and attacker attribution a practical priority. Existing tool-augmented language models and reward-driven reinforcement learning reason over transaction text or a single graph view; they infer maliciousness from superficial topology and degrade when applied to attacks whose traces lack it. This article presents DG-VDT, a reinforcement-learning framework in which tool-centric rewards are replaced by graph-structured feedback derived directly from Ethereum Virtual Machine execution traces. Each trace is decomposed into three complementary graphs (fund flow, contract creation, and contract call), and a dual-stage reward first credits embedding similarity to a canonical attack signature, then enforces exact subgraph-isomorphism matching, with a smooth curriculum governing the transition. The framework is scoped to three structurally distinct vulnerability classes: reentrancy, short-address attack, and timestamp dependence. Zero-shot evaluation on two author-independent public corpora yields 87.7% macro- on SolidiFI-Bench and 84.0% (95% confidence interval 83.4–84.7) on SmartBugs Wild, exceeding fine-tuned GPT-4o by 6.8 and 6.3 points at 180 ms per trace on a single consumer graphics card. Ablation attributes 13.9 macro- points to the multi-graph representation. Extension beyond the three evaluated classes remains future work. - Open Access
- 29 September 2026
- Published by MDPI AG in Preprints.org
Memory-Driven Trust: A Unified Foundation for Self-Verifiability in Digital Infrastructure
The Internet's critical infrastructure relies on centralized trust authorities, and their repeated failures expose a structural fragility: these systems lack self-verifiability — the property that any party relying on a claim can independently verify that event or state claim without depending on any third-party authority. Here we propose the Memory-Driven Trust Paradigm, which endows digital infrastructure with self-verifiability through verifiable memory, shifting the fundamental question of trust from "whom to trust" to "what to verify." We define verifiable memory as cryptographically committed, independently verifiable traces of discrete events and states, and formalize it as an "Accumulate–Anchor–Verify" triadic structure: a unified framework neutral to the underlying commitment mechanism, revealing that previously fragmented self-verifiable schemes — blockchains, certificate-transparency logs, and verifiable storage — share the same deep logic. We characterize necessary and sufficient conditions for verifiable memory and give a constructive proof: an epoch hash chain with geometric staged scheduling reduces the worst-case membership witness from Θ(√n) to Θ(n¹ᐟ³) even under unbounded append; we further establish a mechanism-dependence boundary across verification dimensions, closure of constructions under composition, and a verification-baseline reset via anchoring. We instantiate the framework as four kinds of memory — blockchains for transaction memory, message chains for transmission memory, key chains for protection memory, and verifiable AI memory for inter-agent trust — of which the blockchain and its supporting systems have been validated in real-network deployment, and the message chain and key chain have undergone prototype evaluation and comparative experiments. This work establishes self-verifiability as a foundational property of digital infrastructure and provides a verifiable trust foundation for the AI-mediated digital era.
- 29 September 2026
- Published by MDPI AG in Preprints.org
Open AccessMemory-Driven Trust: A Unified Foundation for Self-Verifiability in Digital Infrastructure
The Internet's critical infrastructure relies on centralized trust authorities, and their repeated failures expose a structural fragility: these systems lack self-verifiability — the property that any party relying on a claim can independently verify that event or state claim without depending on any third-party authority. Here we propose the Memory-Driven Trust Paradigm, which endows digital infrastructure with self-verifiability through verifiable memory, shifting the fundamental question of trust from "whom to trust" to "what to verify." We define verifiable memory as cryptographically committed, independently verifiable traces of discrete events and states, and formalize it as an "Accumulate–Anchor–Verify" triadic structure: a unified framework neutral to the underlying commitment mechanism, revealing that previously fragmented self-verifiable schemes — blockchains, certificate-transparency logs, and verifiable storage — share the same deep logic. We characterize necessary and sufficient conditions for verifiable memory and give a constructive proof: an epoch hash chain with geometric staged scheduling reduces the worst-case membership witness from Θ(√n) to Θ(n¹ᐟ³) even under unbounded append; we further establish a mechanism-dependence boundary across verification dimensions, closure of constructions under composition, and a verification-baseline reset via anchoring. We instantiate the framework as four kinds of memory — blockchains for transaction memory, message chains for transmission memory, key chains for protection memory, and verifiable AI memory for inter-agent trust — of which the blockchain and its supporting systems have been validated in real-network deployment, and the message chain and key chain have undergone prototype evaluation and comparative experiments. This work establishes self-verifiability as a foundational property of digital infrastructure and provides a verifiable trust foundation for the AI-mediated digital era.
- 30 August 2025
- Published by Springer Nature
- p. 170-186
Hash Chain Based Secure Communication for Internet of Things: Architecture and Schemes
- 30 August 2025
- Published by Springer Nature
- p. 170-186
Hash Chain Based Secure Communication for Internet of Things: Architecture and Schemes
- 24 June 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of High Speed Electronics and Systems
- Vol. 35 (05)
Blockchain Abnormal Transaction Identification Method Based on Multi–Dimensional Feature Fusion and Edge Computing
With the widespread adoption of blockchain technology, various types of cybercrimes have emerged on the Ethereum network, including phishing scams, money laundering, and Ponzi schemes. These illegal activities not only threaten the security of the Ethereum ecosystem but also result in significant economic losses. Therefore, establishing efficient methods for anomalous transaction detection is crucial for blockchain security. However, existing approaches are limited by the use of single-type features and locally optimal feature selection, which restricts the comprehensiveness and performance of the models, making it difficult to effectively handle the diversity and heterogeneity of the data. To address this problem, this paper proposes a blockchain abnormal transaction identification method that combines multi-dimensional feature fusion, edge computing and future networks, which integrates three different types of features: statistical features, network structure features, and motif features. This method provides a comprehensive and multi-angle characterization of node features, fully exploiting the latent information in the data and enhancing the model’s performance and generalization ability. Experimental results demonstrate that the proposed method achieves excellent performance on the dataset, significantly improving the accuracy of anomalous transaction detection and showing its potential for enhancing blockchain transaction security, thereby providing new technical support for blockchain security. In addition, combining with edge computing and future network technologies, this method can also better cope with the complex environment in large-scale blockchain networks and provide new technical support for blockchain security.
- 24 June 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of High Speed Electronics and Systems
- Vol. 35 (05)
Blockchain Abnormal Transaction Identification Method Based on Multi–Dimensional Feature Fusion and Edge Computing
With the widespread adoption of blockchain technology, various types of cybercrimes have emerged on the Ethereum network, including phishing scams, money laundering, and Ponzi schemes. These illegal activities not only threaten the security of the Ethereum ecosystem but also result in significant economic losses. Therefore, establishing efficient methods for anomalous transaction detection is crucial for blockchain security. However, existing approaches are limited by the use of single-type features and locally optimal feature selection, which restricts the comprehensiveness and performance of the models, making it difficult to effectively handle the diversity and heterogeneity of the data. To address this problem, this paper proposes a blockchain abnormal transaction identification method that combines multi-dimensional feature fusion, edge computing and future networks, which integrates three different types of features: statistical features, network structure features, and motif features. This method provides a comprehensive and multi-angle characterization of node features, fully exploiting the latent information in the data and enhancing the model’s performance and generalization ability. Experimental results demonstrate that the proposed method achieves excellent performance on the dataset, significantly improving the accuracy of anomalous transaction detection and showing its potential for enhancing blockchain transaction security, thereby providing new technical support for blockchain security. In addition, combining with edge computing and future network technologies, this method can also better cope with the complex environment in large-scale blockchain networks and provide new technical support for blockchain security.
- Open Access
- 28 March 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (7) , 3723
Supervised Blockchain Anonymous Transaction Model Based on Certificateless Signcryption
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.
- 28 March 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (7) , 3723
Open AccessSupervised Blockchain Anonymous Transaction Model Based on Certificateless Signcryption
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.
- 5 March 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of High Speed Electronics and Systems
- Vol. 35 (03)
Blockchain Transaction Verification Scheme Based on Vector Commitments
Blockchain, with its features of decentralization, immutability and security, has emerged as a revolutionary technology. However, the rapid growth of distributed ledgers leads to escalating storage costs, high transaction verification overhead and low throughput, limiting its scalability in broader applications. To address these challenges, this study proposes a novel blockchain transaction verification scheme, BBVC, specifically designed for smart contracts. BBVC leverages a vector commitment algorithm to generate transaction commitments and introduces a two-layer aggregation technique to compress node state data, facilitating efficient transaction validity proof aggregation and verification. A versioning mechanism is further incorporated to optimize proof update efficiency to sub-linear levels, while a new contract transaction verification logic accelerates transaction processing without compromising security. Experimental results demonstrate that the BBVC scheme maintains a constant proof size of 48 bytes and achieves millisecond-level proof generation and verification for large-scale transactions. Compared to Hyperproofs, BBVC enhances transaction aggregation efficiency by 250 times and verification efficiency by 22.5–27.5 times, significantly advancing blockchain scalability and performance.
- 5 March 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of High Speed Electronics and Systems
- Vol. 35 (03)
Blockchain Transaction Verification Scheme Based on Vector Commitments
Blockchain, with its features of decentralization, immutability and security, has emerged as a revolutionary technology. However, the rapid growth of distributed ledgers leads to escalating storage costs, high transaction verification overhead and low throughput, limiting its scalability in broader applications. To address these challenges, this study proposes a novel blockchain transaction verification scheme, BBVC, specifically designed for smart contracts. BBVC leverages a vector commitment algorithm to generate transaction commitments and introduces a two-layer aggregation technique to compress node state data, facilitating efficient transaction validity proof aggregation and verification. A versioning mechanism is further incorporated to optimize proof update efficiency to sub-linear levels, while a new contract transaction verification logic accelerates transaction processing without compromising security. Experimental results demonstrate that the BBVC scheme maintains a constant proof size of 48 bytes and achieves millisecond-level proof generation and verification for large-scale transactions. Compared to Hyperproofs, BBVC enhances transaction aggregation efficiency by 250 times and verification efficiency by 22.5–27.5 times, significantly advancing blockchain scalability and performance.
- Open Access
- 27 February 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (5) , 2565
An Ordered Universal Accumulator Based on a Hash Chain
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.
- 27 February 2025
- Published by MDPI AG in Applied Sciences
- Vol. 15 (5) , 2565
Open AccessAn Ordered Universal Accumulator Based on a Hash Chain
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.
- Open Access
- 28 January 2025
- Published by MDPI AG in Preprints.org
A Chain Key Model Based on Message Hash Chain
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 January 2025
- Published by MDPI AG in Preprints.org
Open AccessA Chain Key Model Based on Message Hash Chain
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.
- Open Access
- 27 December 2024
- Published by MDPI AG in Applied Sciences
- Vol. 15 (1) , 130
A Blockchain Network Admission Control Mechanism Using Anonymous Identity-Based Cryptography
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 December 2024
- Published by MDPI AG in Applied Sciences
- Vol. 15 (1) , 130
Open AccessA Blockchain Network Admission Control Mechanism Using Anonymous Identity-Based Cryptography
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.