Meng Jia
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Meng Jia has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Jing Chen
Wuhan University
15 shared publications - Kun He
Wuhan University
15 shared publications - Ruiying Du
Wuhan University
13 shared publications - Min Shi
Key Laboratory of Aerospace Information Security and Trusted Computing, Ministry of Education, School of Cyber Science and Engineering, Wuhan University, Wuhan, China
6 shared publications - Erjun Zhou
Key Laboratory of Aerospace Information Security and Trusted Computing, Ministry of Education, School of Cyber Science and Engineering, Wuhan University, Wuhan, China
3 shared publications - Hao Yang
Key Laboratory of Aerospace Information Security and Trusted Computing, Ministry of Education, School of Cyber Science and Engineering, Wuhan University, Wuhan, China
3 shared publications
Latest Publications
- 9 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 3886-3901
POWER: High-Throughput Blockchain Based on Computing Power Utilization
Proof-of-Work (PoW) based blockchain reaches consensus by solving computational puzzles, with only the winners generating blocks. In other words, most nodes waste their computing power, resulting in a mismatch between transaction throughput and system scale (i.e., the number of nodes). In this paper, we propose POWER, a high transaction throughput blockchain architecture that utilizes node computing power. Specifically, by introducing hook block and transaction block, we design a parallel structure to increase the utilization of the computing power of nodes that package and add transactions to the blockchain. In the parallel structure, the hook block hangs the transaction block and solves the problem of transaction redundancy. We also present a round interval confirmation mechanism to increase the utilization of the computing power of nodes that confirm transactions. We conduct experiments on POWER and the experiment results show that POWER has a 63% higher transaction throughput and a 51% lower transaction confirmation latency compared to other schemes. In particular, the transaction confirmation accuracy of POWER is 5.9 times better than that of OHIE.
- 9 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 3886-3901
POWER: High-Throughput Blockchain Based on Computing Power Utilization
Proof-of-Work (PoW) based blockchain reaches consensus by solving computational puzzles, with only the winners generating blocks. In other words, most nodes waste their computing power, resulting in a mismatch between transaction throughput and system scale (i.e., the number of nodes). In this paper, we propose POWER, a high transaction throughput blockchain architecture that utilizes node computing power. Specifically, by introducing hook block and transaction block, we design a parallel structure to increase the utilization of the computing power of nodes that package and add transactions to the blockchain. In the parallel structure, the hook block hangs the transaction block and solves the problem of transaction redundancy. We also present a round interval confirmation mechanism to increase the utilization of the computing power of nodes that confirm transactions. We conduct experiments on POWER and the experiment results show that POWER has a 63% higher transaction throughput and a 51% lower transaction confirmation latency compared to other schemes. In particular, the transaction confirmation accuracy of POWER is 5.9 times better than that of OHIE.
- 28 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21 (15566013) , 2549-2563
Realhybrid: A Hybrid Blockchain Consensus With Node-Level Switching
Blockchain consensus can be divided into synchronous consensus and asynchronous consensus according to the network status. In a real network environment, the network status of each node is constantly fluctuating. Hybrid consensus schemes adapt to network fluctuations through switching consensus protocol between asynchronous and synchronous. However, existing schemes are system-level switching, resulting in low efficiency. In this paper, we present Realhybrid, a hybrid consensus scheme with node-level switching, which enables every node to select appropriate consensus protocols based on their network status. We design corresponding protocols for each node to achieve efficient consensus under network fluctuations. Moreover, we establish a Realhybrid network model and quantify the relationship between its performance and system parameters. We conduct experiments on Realhybrid and the results show that it has 29% lower transaction waiting volume and 17% lower transaction confirmation latency compared to other hybrid consensus schemes.
- 28 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21 (15566013) , 2549-2563
Realhybrid: A Hybrid Blockchain Consensus With Node-Level Switching
Blockchain consensus can be divided into synchronous consensus and asynchronous consensus according to the network status. In a real network environment, the network status of each node is constantly fluctuating. Hybrid consensus schemes adapt to network fluctuations through switching consensus protocol between asynchronous and synchronous. However, existing schemes are system-level switching, resulting in low efficiency. In this paper, we present Realhybrid, a hybrid consensus scheme with node-level switching, which enables every node to select appropriate consensus protocols based on their network status. We design corresponding protocols for each node to achieve efficient consensus under network fluctuations. Moreover, we establish a Realhybrid network model and quantify the relationship between its performance and system parameters. We conduct experiments on Realhybrid and the results show that it has 29% lower transaction waiting volume and 17% lower transaction confirmation latency compared to other hybrid consensus schemes.
- 15 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (2) , 4208-4220
Fully Private Shortest Path Computation With Single-Round Interaction
In real-world scenarios, computing the shortest path between given source and destination is widely prevalent, such as seeking the optimal route in a road network for navigation. However, in traditional non-private solutions, the user discloses its location information to the server in order to obtain the targeted shortest path, giving rise to a significant privacy leakage problem. Existing private shortest path computation schemes either provide limited privacy guarantees or require multiple interactions between the user and the server. In this paper, we introduce a fully private shortest path computation scheme, named Srchpa. This scheme ensures full privacy for both the location information provided by the user and the routing information held by the server. Furthermore, we propose a locally iterative computation method, achieving single-round interaction between the user and the server to obtain the targeted shortest path. Finally, we present the formal security analyses and comprehensive experiment evaluations. The security analyses demonstrate that our scheme achieves full privacy even if the server is malicious. The experiment evaluation results show that our scheme has lower computation, communication and storage costs on the user side, thus is practical for the lightweight user with limited resources.
- 15 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (2) , 4208-4220
Fully Private Shortest Path Computation With Single-Round Interaction
In real-world scenarios, computing the shortest path between given source and destination is widely prevalent, such as seeking the optimal route in a road network for navigation. However, in traditional non-private solutions, the user discloses its location information to the server in order to obtain the targeted shortest path, giving rise to a significant privacy leakage problem. Existing private shortest path computation schemes either provide limited privacy guarantees or require multiple interactions between the user and the server. In this paper, we introduce a fully private shortest path computation scheme, named Srchpa. This scheme ensures full privacy for both the location information provided by the user and the routing information held by the server. Furthermore, we propose a locally iterative computation method, achieving single-round interaction between the user and the server to obtain the targeted shortest path. Finally, we present the formal security analyses and comprehensive experiment evaluations. The security analyses demonstrate that our scheme achieves full privacy even if the server is malicious. The experiment evaluation results show that our scheme has lower computation, communication and storage costs on the user side, thus is practical for the lightweight user with limited resources.
- 1 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (2) , 3612-3624
Privacy-Preserving and Aggregated Proofs of Assets in Multiple Banks
Proof of reserves/assets is widely used for visa application, loan, and auction in practice, where provers display balance proofs generated by banks to verifiers to prove their balances. In real world, a prover usually deposits money in multiple banks and needs to prove her/his total balances in those banks. Based on existing technologies, a prover can either request those banks to interactively generate an aggregated proofs of assets or prove her/his balances one by one, and they are inefficient and have a low privacy protection effect. In this paper, we present privacy-preserving and aggregated proofs of assets in multiple banks. Specifically, we design a liability auditing and balance proving architecture that supports proofs of liabilities for banks and proofs of assets for provers. Then, we propose a generic construction of aggregated proofs of assets scheme, where provers can aggregate balances in multiple banks without the help of any bank and banks do not need to interact with each other. Moreover, the provers can prove the aggregated balance is more than a threshold without exposing the specific values or the bank information. We conduct experiments on our system and the results demonstrate that it is suitable in practice.
- 1 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (2) , 3612-3624
Privacy-Preserving and Aggregated Proofs of Assets in Multiple Banks
Proof of reserves/assets is widely used for visa application, loan, and auction in practice, where provers display balance proofs generated by banks to verifiers to prove their balances. In real world, a prover usually deposits money in multiple banks and needs to prove her/his total balances in those banks. Based on existing technologies, a prover can either request those banks to interactively generate an aggregated proofs of assets or prove her/his balances one by one, and they are inefficient and have a low privacy protection effect. In this paper, we present privacy-preserving and aggregated proofs of assets in multiple banks. Specifically, we design a liability auditing and balance proving architecture that supports proofs of liabilities for banks and proofs of assets for provers. Then, we propose a generic construction of aggregated proofs of assets scheme, where provers can aggregate balances in multiple banks without the help of any bank and banks do not need to interact with each other. Moreover, the provers can prove the aggregated balance is more than a threshold without exposing the specific values or the bank information. We conduct experiments on our system and the results demonstrate that it is suitable in practice.
- 28 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 8509-8524
Boreas: Fully Anonymous Sealed-Bid Auction
With the rise of e-commerce, sealed-bid auctions are widely used in various online scenarios. In auctions, bidders’ bids and participants’ identities are considered critical private information. However, existing works either only achieve bid privacy or fail to provide complete protection of identity. In this work, we propose the first sealed-bid auction scheme that achieves both bid privacy and identity privacy, called Boreas. We propose three fundamental protocols as the building blocks. In particular, anonymous submission enables sellers to submit items anonymously, oblivious bidding and locker transaction enable the seller and the winner to confirm the auction results and complete the transaction without knowing each other’s identity. Meanwhile, we formally define the security goal of identity privacy and formalize a new security property called: fully anonymous. We prove the security of our scheme in the semi-honest adversary model. We implement Boreas and run experiments comparing its performance against existing schemes. Our experiments show that Boreas improves computation time by 12.6% and reduces communication costs by $10^{3} \times $ in handling a large-scale auction, while offering stronger security guarantee.
- 28 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 8509-8524
Boreas: Fully Anonymous Sealed-Bid Auction
With the rise of e-commerce, sealed-bid auctions are widely used in various online scenarios. In auctions, bidders’ bids and participants’ identities are considered critical private information. However, existing works either only achieve bid privacy or fail to provide complete protection of identity. In this work, we propose the first sealed-bid auction scheme that achieves both bid privacy and identity privacy, called Boreas. We propose three fundamental protocols as the building blocks. In particular, anonymous submission enables sellers to submit items anonymously, oblivious bidding and locker transaction enable the seller and the winner to confirm the auction results and complete the transaction without knowing each other’s identity. Meanwhile, we formally define the security goal of identity privacy and formalize a new security property called: fully anonymous. We prove the security of our scheme in the semi-honest adversary model. We implement Boreas and run experiments comparing its performance against existing schemes. Our experiments show that Boreas improves computation time by 12.6% and reduces communication costs by $10^{3} \times $ in handling a large-scale auction, while offering stronger security guarantee.
- 24 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. PP (15566013) , 1
Multi-authority Anonymous Credentials with Efficient and Decentralized Supervision
Anonymous credential is widely used in online services, where issuers in authorities issue credentials to users and then users can selectively and privately prove their identities and attributes. However, users may misbehave under anonymous settings. Therefore, we need to trace the credential proof to obtain the user’s identity and link credential proofs to achieve supervision. Existing solutions either have the single point of failure problem or require multiple supervisors perform threshold computations on all users’ identities, it is inefficient in practice especially when the number of users increases. In this paper, we present a credential management system in multiple authorities with efficient and decentralized supervision. Specifically, we design a multi-authority credential management architecture, where each issuer in authorities issues credentials to users and supervisors trace and link credential proofs in multiple authorities. Then, we present efficient and decentralized credential proof tracing and linking protocols, where more than threshold supervisors can trace credential proofs to obtain users’ identities and generate users’ linking keys. Verifiers can link each malicious user’s credential proofs efficiently with those linking keys. We conduct experiments on our system in the WAN and LAN settings and compare it with another threshold attribute-based credential scheme. The experimental results demonstrate that our solution is efficient in practice.
- 24 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. PP (15566013) , 1
Multi-authority Anonymous Credentials with Efficient and Decentralized Supervision
Anonymous credential is widely used in online services, where issuers in authorities issue credentials to users and then users can selectively and privately prove their identities and attributes. However, users may misbehave under anonymous settings. Therefore, we need to trace the credential proof to obtain the user’s identity and link credential proofs to achieve supervision. Existing solutions either have the single point of failure problem or require multiple supervisors perform threshold computations on all users’ identities, it is inefficient in practice especially when the number of users increases. In this paper, we present a credential management system in multiple authorities with efficient and decentralized supervision. Specifically, we design a multi-authority credential management architecture, where each issuer in authorities issues credentials to users and supervisors trace and link credential proofs in multiple authorities. Then, we present efficient and decentralized credential proof tracing and linking protocols, where more than threshold supervisors can trace credential proofs to obtain users’ identities and generate users’ linking keys. Verifiers can link each malicious user’s credential proofs efficiently with those linking keys. We conduct experiments on our system in the WAN and LAN settings and compare it with another threshold attribute-based credential scheme. The experimental results demonstrate that our solution is efficient in practice.
- 24 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 8224-8236
Forward and Backward Private Conjunctive Dynamic Searchable Symmetric Encryption With Refined Leakage Function and Low Communication
Dynamic searchable symmetric encryption (DSSE) enables updates and keyword searches on outsourced encrypted data while minimizing the information revealed to the server. However, existing DSSE schemes that support conjunctive keyword searches disclose added documents or fail to filter deleted ones in certain circumstances, thus violating forward and backward privacy. Besides, the size of their search tokens increases with the number of documents, which incurs a heavy communication cost. In this paper, we develop a conjunctive DSSE scheme that has a search token size only related to the conjunction size and fully supports forward and backward privacy. Our scheme is based on a new three-dimensional chain structure called CUBE. We also rethink the leakage function of conjunctive queries and prove that our scheme satisfies the refined security definition. Experimental results demonstrate that compared with the state-of-the-art schemes, our scheme increases the computational cost by at most 9.62% but reduces the communication cost by 99.78% when searching six conjunctive keywords.
- 24 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 8224-8236
Forward and Backward Private Conjunctive Dynamic Searchable Symmetric Encryption With Refined Leakage Function and Low Communication
Dynamic searchable symmetric encryption (DSSE) enables updates and keyword searches on outsourced encrypted data while minimizing the information revealed to the server. However, existing DSSE schemes that support conjunctive keyword searches disclose added documents or fail to filter deleted ones in certain circumstances, thus violating forward and backward privacy. Besides, the size of their search tokens increases with the number of documents, which incurs a heavy communication cost. In this paper, we develop a conjunctive DSSE scheme that has a search token size only related to the conjunction size and fully supports forward and backward privacy. Our scheme is based on a new three-dimensional chain structure called CUBE. We also rethink the leakage function of conjunctive queries and prove that our scheme satisfies the refined security definition. Experimental results demonstrate that compared with the state-of-the-art schemes, our scheme increases the computational cost by at most 9.62% but reduces the communication cost by 99.78% when searching six conjunctive keywords.
- 18 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 6706-6718
Volia: An Efficient and Light Asynchronous BFT Protocol
Byzantine Fault Tolerance (BFT) protocols can be divided into synchronous BFT protocols, partially synchronous BFT protocols, and asynchronous BFT protocols according to communication delay. Asynchronous BFT protocols are widely used because they can tolerate uncertain communication delays in the real world. However, asynchronous BFT protocols need to perform many rounds of broadcasts to reach agreement on a transaction subset, which consumes a lot of communication, computing, and storage resources. In this paper, we present Volia, an asynchronous BFT protocol which resolves above problem.We design new broadcast protocol to reduce the number of broadcast rounds needed for agreement. It reduces the communication overhead. Voting broadcast is used to maintain the order of transaction subsets rather than threshold signature to reduce computation cost. Above mechanisms speeds up the agreement phase, reduces the accumulated transaction subsets waiting for agreement and thus saves storage resources. We conduct experiment on Volia and the results show that Volia exhibits about 2~65× throughput, 2~25% latency, and 30% storage cost compared to other asynchronous BFT protocols.
- 18 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 6706-6718
Volia: An Efficient and Light Asynchronous BFT Protocol
Byzantine Fault Tolerance (BFT) protocols can be divided into synchronous BFT protocols, partially synchronous BFT protocols, and asynchronous BFT protocols according to communication delay. Asynchronous BFT protocols are widely used because they can tolerate uncertain communication delays in the real world. However, asynchronous BFT protocols need to perform many rounds of broadcasts to reach agreement on a transaction subset, which consumes a lot of communication, computing, and storage resources. In this paper, we present Volia, an asynchronous BFT protocol which resolves above problem.We design new broadcast protocol to reduce the number of broadcast rounds needed for agreement. It reduces the communication overhead. Voting broadcast is used to maintain the order of transaction subsets rather than threshold signature to reduce computation cost. Above mechanisms speeds up the agreement phase, reduces the accumulated transaction subsets waiting for agreement and thus saves storage resources. We conduct experiment on Volia and the results show that Volia exhibits about 2~65× throughput, 2~25% latency, and 30% storage cost compared to other asynchronous BFT protocols.
- 12 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (17) , 35307-35319
Fast Payment System in Cryptocurrencies Through Off-Chain Transaction Aggregation
Blockchain technology is widely used in the field of digital currency, however, the typical blockchain systems suffer from high transaction confirmation latency and expensive fees, which make it difficult to meet the needs of daily payment scenarios. Schemes such as state channel and payment center shift the on-chain payment confirmation process off-chain, thereby reducing latency. Yet these solutions require locking in additional funds or introducing a trusted third party, and seldom consider the issue of lowering transaction fees. In this article, we propose a cryptocurrency fast payment scheme that organises off-chain participants through smart contracts to enable fast payments. The transaction parties update their state off-chain to ensure fast confirmation. At settlement, off-chain transactions between customer and multiple merchants or merchant and multiple customers are aggregated into a single on-chain transaction, effectively reducing overall transaction fees. We protect transaction privacy by hiding the transaction amount and balance through range proof. We conduct experiments on Ethereum platform, and the results show that the system latency meets the needs of real-world scenarios.
- 12 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (17) , 35307-35319
Fast Payment System in Cryptocurrencies Through Off-Chain Transaction Aggregation
Blockchain technology is widely used in the field of digital currency, however, the typical blockchain systems suffer from high transaction confirmation latency and expensive fees, which make it difficult to meet the needs of daily payment scenarios. Schemes such as state channel and payment center shift the on-chain payment confirmation process off-chain, thereby reducing latency. Yet these solutions require locking in additional funds or introducing a trusted third party, and seldom consider the issue of lowering transaction fees. In this article, we propose a cryptocurrency fast payment scheme that organises off-chain participants through smart contracts to enable fast payments. The transaction parties update their state off-chain to ensure fast confirmation. At settlement, off-chain transactions between customer and multiple merchants or merchant and multiple customers are aggregated into a single on-chain transaction, effectively reducing overall transaction fees. We protect transaction privacy by hiding the transaction amount and balance through range proof. We conduct experiments on Ethereum platform, and the results show that the system latency meets the needs of real-world scenarios.
- 24 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 33 (5) , 2179-2191
A Formal Analysis of 5G EAP-TLS Protocol
The emergence of private 5G networks has garnered significant attention from enterprises. To ensure the security of communication devices within these networks, the 3GPP group proposed the 5G Extensible Authentication Protocol-Transport Layer Security (EAP-TLS). Despite its critical role, the security of 5G EAP-TLS has not been systematically studied. In this paper, we present the first comprehensive formal model of the 5G EAP-TLS protocol, detailing its flow and incorporating all parties and the certificate distribution mechanism as defined by the 5G specification. Additionally, we extract and interpret the security requirements outlined in the specification. Using the automated symbolic tool Tamarin, we analyze the protocol’s security goals and identify potential vulnerabilities. We propose and verify solutions to these issues, enhancing the protocol’s security. This work provides a foundational understanding and improvements for securing private 5G networks.
- 24 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 33 (5) , 2179-2191
A Formal Analysis of 5G EAP-TLS Protocol
The emergence of private 5G networks has garnered significant attention from enterprises. To ensure the security of communication devices within these networks, the 3GPP group proposed the 5G Extensible Authentication Protocol-Transport Layer Security (EAP-TLS). Despite its critical role, the security of 5G EAP-TLS has not been systematically studied. In this paper, we present the first comprehensive formal model of the 5G EAP-TLS protocol, detailing its flow and incorporating all parties and the certificate distribution mechanism as defined by the 5G specification. Additionally, we extract and interpret the security requirements outlined in the specification. Using the automated symbolic tool Tamarin, we analyze the protocol’s security goals and identify potential vulnerabilities. We propose and verify solutions to these issues, enhancing the protocol’s security. This work provides a foundational understanding and improvements for securing private 5G networks.