Mingyue Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Mingyue Wang has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Yu Guo
Beijing Normal University
13 shared publications - Xiaohua Jia
City University of Hong Kong
11 shared publications - Cong Wang
City University of Hong Kong, Hong Kong, China
6 shared publications - Chen Zhang
The Hang Seng University of Hong Kong
3 shared publications - Hejiao Huang
Shenzhen Key Laboratory of Internet Information Collaboration, School of Computer Science and Technology, Harbin Institute of Technology, Shenzhen, Shenzhen, China
3 shared publications - Yinbin Miao
Xidian University
3 shared publications
Latest Publications
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 4961-4972
SpecGuard: Source-Aware Heterogeneous Agent Placement for Defending LLM-Based Multi-Agent Systems against Adversarial Communication
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 4961-4972
Open AccessSpecGuard: Source-Aware Heterogeneous Agent Placement for Defending LLM-Based Multi-Agent Systems against Adversarial Communication
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (6) , 13042-13058
PMoMu: Forward and Backward Private Multi-Owner and Multi-User Encrypted Database
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (6) , 13042-13058
PMoMu: Forward and Backward Private Multi-Owner and Multi-User Encrypted Database
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21, 6653-6667
MHcast: Metadata-Hiding Multicast With Resilience Against Malicious Clients and Servers
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21, 6653-6667
MHcast: Metadata-Hiding Multicast With Resilience Against Malicious Clients and Servers
- 27 October 2024
- Published by Springer Nature
- p. 3-19
OblivChain: Enabling Oblivious Queries for Blockchain Light Clients with Malicious Security
- 27 October 2024
- Published by Springer Nature
- p. 3-19
OblivChain: Enabling Oblivious Queries for Blockchain Light Clients with Malicious Security
- 9 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 17 (5) , 2945-2958
Toward Efficient and Reliable Private Set Computation in Decentralized Storage
Decentralized storage is recognized as a promising blockchain application for building trustworthy data-sharing services. Recently, privacy-preserving decentralized storage has attracted tremendous attention from the research community, due to the inherent transparent access properties of blockchain. That is, multi-users can search over encrypted data from multi-owners via untrusted storage servers. Private Set Intersection (PSI) is regarded as an ideal cryptographic scheme for this scenario because it allows multiple parties to collaboratively execute private set computations without revealing additional information. However, existing solutions do not consider the necessary verification and fault tolerance of PSI results, which is the indispensable security requirements in decentralized storage. To fill the gap, in this work, we introduce the first reliable PSI scheme for decentralized storage that provides results verifiability and fault tolerance for private set operations. Our design leverages authenticated indexing structures and Shamir's secret sharing algorithm for constructing our reliable PSI scheme with fault tolerance. To address the potential malicious behaviors of dishonest users or servers, we also propose a blockchain-assisted arbitration protocol that enables public arbitration in a privacy-preserving manner. We rigorously provide security analysis and complete the prototype implementation on Fabric. Extensive results demonstrate its practicability and feasibility for existing decentralized storage.
- 9 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 17 (5) , 2945-2958
Toward Efficient and Reliable Private Set Computation in Decentralized Storage
Decentralized storage is recognized as a promising blockchain application for building trustworthy data-sharing services. Recently, privacy-preserving decentralized storage has attracted tremendous attention from the research community, due to the inherent transparent access properties of blockchain. That is, multi-users can search over encrypted data from multi-owners via untrusted storage servers. Private Set Intersection (PSI) is regarded as an ideal cryptographic scheme for this scenario because it allows multiple parties to collaboratively execute private set computations without revealing additional information. However, existing solutions do not consider the necessary verification and fault tolerance of PSI results, which is the indispensable security requirements in decentralized storage. To fill the gap, in this work, we introduce the first reliable PSI scheme for decentralized storage that provides results verifiability and fault tolerance for private set operations. Our design leverages authenticated indexing structures and Shamir's secret sharing algorithm for constructing our reliable PSI scheme with fault tolerance. To address the potential malicious behaviors of dishonest users or servers, we also propose a blockchain-assisted arbitration protocol that enables public arbitration in a privacy-preserving manner. We rigorously provide security analysis and complete the prototype implementation on Fabric. Extensive results demonstrate its practicability and feasibility for existing decentralized storage.
- 5 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 73 (3) , 928-941
Optimal Compression for Encrypted Key-Value Store in Cloud Systems
Key-value store is adopted by many applications due to its high performance in processing big data workloads. With the increasing concern for privacy, some privacy-preserving key-value storage systems have been proposed. A remarkable solution is to group key-value pairs into packs and then compress and encrypt each pack separately. The selection of pack size is important for key-value storage systems because it affects both the storage cost in the cloud and the bandwidth cost for data retrieval. However, existing data packing strategies do not consider the trade-off between them. In this paper, we study the optimal compression problem for encrypted key-value stores, aiming to minimize the overall cost of data outsourcing. To solve this problem, we devise an optimal pack size computation scheme, which considers both storage and bandwidth costs. Then, we propose a privacy-preserving key-value storage system. It balances the impact caused by encryption and compression without compromising system performance. Meanwhile, it supports dynamic updates and rich types of queries. Finally, we formally analyze the security of our design. Performance evaluations demonstrate that our proposed pack size computation scheme can minimize the overall cost of data outsourcing, and the designed key-value storage system is feasible in practice.
- 5 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 73 (3) , 928-941
Optimal Compression for Encrypted Key-Value Store in Cloud Systems
Key-value store is adopted by many applications due to its high performance in processing big data workloads. With the increasing concern for privacy, some privacy-preserving key-value storage systems have been proposed. A remarkable solution is to group key-value pairs into packs and then compress and encrypt each pack separately. The selection of pack size is important for key-value storage systems because it affects both the storage cost in the cloud and the bandwidth cost for data retrieval. However, existing data packing strategies do not consider the trade-off between them. In this paper, we study the optimal compression problem for encrypted key-value stores, aiming to minimize the overall cost of data outsourcing. To solve this problem, we devise an optimal pack size computation scheme, which considers both storage and bandwidth costs. Then, we propose a privacy-preserving key-value storage system. It balances the impact caused by encryption and compression without compromising system performance. Meanwhile, it supports dynamic updates and rich types of queries. Finally, we formally analyze the security of our design. Performance evaluations demonstrate that our proposed pack size computation scheme can minimize the overall cost of data outsourcing, and the designed key-value storage system is feasible in practice.
- 11 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (11) , 6210-6224
FedEDB: Building a Federated and Encrypted Data Store via Consortium Blockchains
Decentralized storage platforms based on consortium blockchains have emerged in the spotlight of research and industry communities because they are flexible, transparent, and eliminated trust in contrast to the traditional centralized data-sharing model. However, due to wide attacking surfaces in a blockchain network, this decentralized data-sharing paradigm is subject to malicious data breaches. Untrusted blockchain nodes can directly obtain sensitive information from the query processing and their local storage. Several studies have been made for solving this dilemma, but they only focus on single-user settings and cannot be directly applied to multi-owners blockchain-based data sharing scenarios. In this paper, we introduce FedEDB, a federated and encrypted data store by using consortium blockchains. Unlike existing solutions that focus on single-user settings, our proposed schemes can efficiently support privacy-preserving and reliable multi-owner queries in the decentralized setting. We start from the practical key aggregation technique to construct the multi-owner search schemes and further refine the underling building blocks to enhance the security. Besides, we integrate the smart contract with our tailored zero-knowledge proof to enforce secure and reliable result verification protocol with fairness. We implement a prototype and thorough security analysis and comprehensive evaluation results confirm the practicability of our design.
- 11 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (11) , 6210-6224
FedEDB: Building a Federated and Encrypted Data Store via Consortium Blockchains
Decentralized storage platforms based on consortium blockchains have emerged in the spotlight of research and industry communities because they are flexible, transparent, and eliminated trust in contrast to the traditional centralized data-sharing model. However, due to wide attacking surfaces in a blockchain network, this decentralized data-sharing paradigm is subject to malicious data breaches. Untrusted blockchain nodes can directly obtain sensitive information from the query processing and their local storage. Several studies have been made for solving this dilemma, but they only focus on single-user settings and cannot be directly applied to multi-owners blockchain-based data sharing scenarios. In this paper, we introduce FedEDB, a federated and encrypted data store by using consortium blockchains. Unlike existing solutions that focus on single-user settings, our proposed schemes can efficiently support privacy-preserving and reliable multi-owner queries in the decentralized setting. We start from the practical key aggregation technique to construct the multi-owner search schemes and further refine the underling building blocks to enhance the security. Besides, we integrate the smart contract with our tailored zero-knowledge proof to enforce secure and reliable result verification protocol with fairness. We implement a prototype and thorough security analysis and comprehensive evaluation results confirm the practicability of our design.
- 15 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 19 (15566013) , 1213-1226
Cross-User Leakage Mitigation for Authorized Multi-User Encrypted Data Sharing
Cloud computing has been a research focus in both academic and industrial communities for decades. Along with this trend, Searchable Encryption (SE) technology emerged and developed as data privacy concerns increased. Many schemes are proposed to solve the privacy-preserving data-sharing problem in multi-user scenarios. Most existing solutions are based on the assumption that all users are trusted. However, there will be cross-user leakage when there are malicious or compromised ones. This is because of the inherent linkability of authorization information and the search result when multiple users request data from the same database. To this end, we propose a cross-user leakage mitigation scheme for authorized encrypted data sharing in a two-server model. We utilize a blinding factor to delink authorizations based on Symmetric Multi-Key Searchable Encryption (SMKSE). To break the linkability of query results, we combine the zero-sum garbled Bloom filter with the oblivious transfer technique, where each of the two servers can only know partial information. We devise a group-based Bloom filter structure in indices to improve efficiency. We perform formal security analysis and also demonstrate the efficiency through comparative experiments.
- 15 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 19 (15566013) , 1213-1226
Cross-User Leakage Mitigation for Authorized Multi-User Encrypted Data Sharing
Cloud computing has been a research focus in both academic and industrial communities for decades. Along with this trend, Searchable Encryption (SE) technology emerged and developed as data privacy concerns increased. Many schemes are proposed to solve the privacy-preserving data-sharing problem in multi-user scenarios. Most existing solutions are based on the assumption that all users are trusted. However, there will be cross-user leakage when there are malicious or compromised ones. This is because of the inherent linkability of authorization information and the search result when multiple users request data from the same database. To this end, we propose a cross-user leakage mitigation scheme for authorized encrypted data sharing in a two-server model. We utilize a blinding factor to delink authorizations based on Symmetric Multi-Key Searchable Encryption (SMKSE). To break the linkability of query results, we combine the zero-sum garbled Bloom filter with the oblivious transfer technique, where each of the two servers can only know partial information. We devise a group-based Bloom filter structure in indices to improve efficiency. We perform formal security analysis and also demonstrate the efficiency through comparative experiments.
- Open Access
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 3371-3380
Towards Dynamic and Reliable Private Key Management for Hierarchical Access Structure in Decentralized Storage
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 3371-3380
Open AccessTowards Dynamic and Reliable Private Key Management for Hierarchical Access Structure in Decentralized Storage
- 28 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 19 (15566013) , 221-234
Encrypted and Compressed Key-Value Store With Pattern-Analysis Security in Cloud Systems
With the increasing concern about data privacy and data explosion, some encrypted and compressed key-value (KV) stores have been proposed. A remarkable way to combine encryption and compression is to pack KV pairs into packs, and then compress and encrypt each pack separately. Recent research has shown that even if the data is encrypted, adversaries can still use the leaked information about data length and access frequency to launch pattern-analysis attacks. For this problem, some schemes have been proposed to protect the length and frequency distribution of packs. However, existing solutions protect such information at the cost of high storage and bandwidth overhead. In this paper, we propose an encrypted and compressed KV store with pattern-analysis security, which can resist pattern-analysis attacks with minimal overhead. We first devise a secure KV pair packing scheme, which guarantees pack length security with bounded storage overhead. Then we propose a $K$ -indistinguishable pack frequency smoothing scheme. It can protect the distribution of pack frequency with minimal bandwidth overhead. We formally analyze the security of our design and implement our proposed secure KV storage system on Redis and RocksDB. Performance evaluation results demonstrate that our design minimizes the overhead of achieving pattern-analysis security.
- 28 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 19 (15566013) , 221-234
Encrypted and Compressed Key-Value Store With Pattern-Analysis Security in Cloud Systems
With the increasing concern about data privacy and data explosion, some encrypted and compressed key-value (KV) stores have been proposed. A remarkable way to combine encryption and compression is to pack KV pairs into packs, and then compress and encrypt each pack separately. Recent research has shown that even if the data is encrypted, adversaries can still use the leaked information about data length and access frequency to launch pattern-analysis attacks. For this problem, some schemes have been proposed to protect the length and frequency distribution of packs. However, existing solutions protect such information at the cost of high storage and bandwidth overhead. In this paper, we propose an encrypted and compressed KV store with pattern-analysis security, which can resist pattern-analysis attacks with minimal overhead. We first devise a secure KV pair packing scheme, which guarantees pack length security with bounded storage overhead. Then we propose a $K$ -indistinguishable pack frequency smoothing scheme. It can protect the distribution of pack frequency with minimal bandwidth overhead. We formally analyze the security of our design and implement our proposed secure KV storage system on Redis and RocksDB. Performance evaluation results demonstrate that our design minimizes the overhead of achieving pattern-analysis security.