Huayi Duan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Huayi Duan has a total of 55 co-authors. Here are the top co-authors by number of shared publications:
- Cong Wang
City University of Hong Kong, Hong Kong, China
17 shared publications - Yifeng Zheng
The Hong Kong Polytechnic University
7 shared publications Cong Wang
City University of Hong Kong and City University of Hong Kong Shenzhen Research Institute, Hong Kong, Hong Kong
6 shared publications- Qian Wang
Wuhan University, Wuhan, China
6 shared publications - Xingliang Yuan
The University of Melbourne, Melbourne, Australia
6 shared publications - Lei Xu
Nanjing University of Science and Technology
4 shared publications
Latest Publications
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 2298-2312
PolyVoice: Exploiting Cluster-Level Vulnerabilities for One-to-Many Impersonation in Speaker Verification Systems
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 2298-2312
Open AccessPolyVoice: Exploiting Cluster-Level Vulnerabilities for One-to-Many Impersonation in Speaker Verification Systems
- 26 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20  (15566013) , 4860-4873
Do Not Skip Over the Offline: Verifiable Silent Preprocessing From Small Security Hardware
Multi-party computation (MPC) has garnered growing research and industry attention, with many protocols adhering to the preprocessing model to prioritize online performance via offline-generated, data-independent correlated randomness (or correlation for short). However, existing studies have predominantly focused on the online phase, and the equally critical offline phase remains overlooked. This oversight can lead to significant yet unaddressed challenges in both security and efficiency. To address these challenges, we start from the pseudorandom correlation generator (PCG) notion by Boyle et al. (CRYPTO'19, FOCS'20) and propose a programmable, verifiable, and efficient PCG construction using dedicated, small security hardware. Our technique, termed HPCG, bridges cryptography and hardware worlds for both strong security and high performance. It enables parties to generate virtually unbounded target correlations and verify their well-formedness at a low cost. Compared to existing cryptographic PCGs, HPCG restrainedly relies on minimal hardware trust, while advancing: 1) support for versatile correlations; 2) well-formedness enforcement for any correlation regardless of its form; and 3) reduced offline costs further. In contrast to prior hardware-based MPC solutions, HPCG 1) minimizes the trusted computing base; 2) eliminates single-vendor trust assumptions; and 3) avoids hosting sensitive user inputs directly on security chips. Furthermore, although HPCG operates solely in the offline phase and requires no direct access to user inputs, it enables performant online MPC protocols by efficiently generating some new, highly customized correlations. Our results demonstrate that HPCG outperforms prior preprocessing techniques in performance, security, simplicity, or a combination thereof.
- 26 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20  (15566013) , 4860-4873
Do Not Skip Over the Offline: Verifiable Silent Preprocessing From Small Security Hardware
Multi-party computation (MPC) has garnered growing research and industry attention, with many protocols adhering to the preprocessing model to prioritize online performance via offline-generated, data-independent correlated randomness (or correlation for short). However, existing studies have predominantly focused on the online phase, and the equally critical offline phase remains overlooked. This oversight can lead to significant yet unaddressed challenges in both security and efficiency. To address these challenges, we start from the pseudorandom correlation generator (PCG) notion by Boyle et al. (CRYPTO'19, FOCS'20) and propose a programmable, verifiable, and efficient PCG construction using dedicated, small security hardware. Our technique, termed HPCG, bridges cryptography and hardware worlds for both strong security and high performance. It enables parties to generate virtually unbounded target correlations and verify their well-formedness at a low cost. Compared to existing cryptographic PCGs, HPCG restrainedly relies on minimal hardware trust, while advancing: 1) support for versatile correlations; 2) well-formedness enforcement for any correlation regardless of its form; and 3) reduced offline costs further. In contrast to prior hardware-based MPC solutions, HPCG 1) minimizes the trusted computing base; 2) eliminates single-vendor trust assumptions; and 3) avoids hosting sensitive user inputs directly on security chips. Furthermore, although HPCG operates solely in the offline phase and requires no direct access to user inputs, it enables performant online MPC protocols by efficiently generating some new, highly customized correlations. Our results demonstrate that HPCG outperforms prior preprocessing techniques in performance, security, simplicity, or a combination thereof.
- Open Access
- 4 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 726-747
DNS Congestion Control in Adversarial Settings
We instigate the study of adversarial congestion in the context of the Domain Name System (DNS). By strategically choking inter-server channels, this new type of DoS attack can disrupt a large user group's access to target DNS servers at a low cost. In reminiscence of classic network congestion control, we propose a DNS congestion control (DCC) framework as a fundamental yet practical mitigation measure for such attacks. With an optimized fair-queuing message scheduler, DCC ensures benign clients fair access to inter-server channels regardless of an attacker's behavior; with a set of extensible anomaly detection and signaling mechanisms, it minimizes collateral damage to innocuous clients. We architect DCC in a non-invasive style so that it can readily augment existing DNS servers. Our prototype evaluation demonstrates that DCC effectively mitigates adversarial congestion while incurring minor performance overheads.
- 4 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 726-747
Open AccessDNS Congestion Control in Adversarial Settings
We instigate the study of adversarial congestion in the context of the Domain Name System (DNS). By strategically choking inter-server channels, this new type of DoS attack can disrupt a large user group's access to target DNS servers at a low cost. In reminiscence of classic network congestion control, we propose a DNS congestion control (DCC) framework as a fundamental yet practical mitigation measure for such attacks. With an optimized fair-queuing message scheduler, DCC ensures benign clients fair access to inter-server channels regardless of an attacker's behavior; with a set of extensible anomaly detection and signaling mechanisms, it minimizes collateral damage to innocuous clients. We architect DCC in a non-invasive style so that it can readily augment existing DNS servers. Our prototype evaluation demonstrates that DCC effectively mitigates adversarial congestion while incurring minor performance overheads.
- 1 December 2023
- Published by Springer Nature
- p. 182-199
Demystifying Web3 Centralization: The Case of Off-Chain NFT Hijacking
- 1 December 2023
- Published by Springer Nature
- p. 182-199
Demystifying Web3 Centralization: The Case of Off-Chain NFT Hijacking
- Open Access
- 10 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 932-949
A Formal Framework for End-to-End DNS Resolution
- 10 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 932-949
Open AccessA Formal Framework for End-to-End DNS Resolution
- 17 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 21  (4) , 1918-1934
Toward Full Accounting for Leakage Exploitation and Mitigation in Dynamic Encrypted Databases
Encrypted databases have garnered considerable attention for their ability to safeguard sensitive data outsourced to third parties. However, recent studies have revealed the vulnerability of encrypted databases to leakage-abuse attacks on their search module, prompting the development of countermeasures to address this issue. While most studies have focused on static databases, limited research has been conducted on dynamic encrypted databases. To bridge this gap, this paper focuses on undertaking a comprehensive examination of leakage exploitation in dynamic encrypted databases, with the aim of providing effective mitigations. Our investigation begins with two attacks that can be employed to recover encrypted queries. The first attack, known as an active attack, involves injecting encoded files and utilizing correlated file volume information. The second attack, referred to as a passive attack, identifies unique relational characteristics of queries across database updates, assuming certain background knowledge of the plaintext databases. To mitigate these attacks, a two-layer encrypted database hardening approach is proposed, which obfuscates both search indexes and files in a continuous way. Doing so allows us to eliminate the unique characteristics emerging after data updates constantly. We conduct a series of experiments to confirm the severity of our attacks and the effectiveness of our countermeasures.
- 17 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 21  (4) , 1918-1934
Toward Full Accounting for Leakage Exploitation and Mitigation in Dynamic Encrypted Databases
Encrypted databases have garnered considerable attention for their ability to safeguard sensitive data outsourced to third parties. However, recent studies have revealed the vulnerability of encrypted databases to leakage-abuse attacks on their search module, prompting the development of countermeasures to address this issue. While most studies have focused on static databases, limited research has been conducted on dynamic encrypted databases. To bridge this gap, this paper focuses on undertaking a comprehensive examination of leakage exploitation in dynamic encrypted databases, with the aim of providing effective mitigations. Our investigation begins with two attacks that can be employed to recover encrypted queries. The first attack, known as an active attack, involves injecting encoded files and utilizing correlated file volume information. The second attack, referred to as a passive attack, identifies unique relational characteristics of queries across database updates, assuming certain background knowledge of the plaintext databases. To mitigate these attacks, a two-layer encrypted database hardening approach is proposed, which obfuscates both search indexes and files in a continuous way. Doing so allows us to eliminate the unique characteristics emerging after data updates constantly. We conduct a series of experiments to confirm the severity of our attacks and the effectiveness of our countermeasures.
- 7 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 20  (5) , 4343-4358
${{\sf PEBA}}$: Enhancing User Privacy and Coverage of Safe Browsing Services
To keep web users away from unsafe websites, modern web browsers enable the embedded feature of safe browsing (SB) by default. In this work, through theoretical analysis and empirical evidence, we reveal two major shortcomings in the current SB infrastructure. Firstly, we derive a feasible tracking technique for industry best practice. We show that the current mitigation techniques cannot eliminate the threat of de-anonymization permanently. Secondly, we gauge the effectiveness of blacklists provided by major vendors. Our discovery indicates the urge for blacklist integration in order to boost service quality. In light of this, we propose a new three-party paradigm ${\sf PEBA}$ with an intermediate third party decoupling the direct interaction of users and proprietary blacklist vendors. To satisfy practical usage requirements, we instantiate our design with trusted hardware, detailing how it can be leveraged to fulfill the requirements of privacy enhancement and broader content coverage at the same time. We also tackle numerous implementation challenges that emerged from this proxy-based and hardware-enabled solution. Extensive evaluation confirms that ${\sf PEBA}$ can balance well among desirable goals of security, usability, performance, and elasticity, making it suitable for deployment in practice.
- 7 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 20  (5) , 4343-4358
${{\sf PEBA}}$: Enhancing User Privacy and Coverage of Safe Browsing Services
To keep web users away from unsafe websites, modern web browsers enable the embedded feature of safe browsing (SB) by default. In this work, through theoretical analysis and empirical evidence, we reveal two major shortcomings in the current SB infrastructure. Firstly, we derive a feasible tracking technique for industry best practice. We show that the current mitigation techniques cannot eliminate the threat of de-anonymization permanently. Secondly, we gauge the effectiveness of blacklists provided by major vendors. Our discovery indicates the urge for blacklist integration in order to boost service quality. In light of this, we propose a new three-party paradigm ${\sf PEBA}$ with an intermediate third party decoupling the direct interaction of users and proprietary blacklist vendors. To satisfy practical usage requirements, we instantiate our design with trusted hardware, detailing how it can be leveraged to fulfill the requirements of privacy enhancement and broader content coverage at the same time. We also tackle numerous implementation challenges that emerged from this proxy-based and hardware-enabled solution. Extensive evaluation confirms that ${\sf PEBA}$ can balance well among desirable goals of security, usability, performance, and elasticity, making it suitable for deployment in practice.
- 26 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 20  (4) , 3079-3092
Optimizing Secure Decision Tree Inference Outsourcing
Outsourcing decision tree inference services to the cloud is highly beneficial, yet raises critical privacy concerns on the proprietary decision tree of the model provider and the private input data of the client. In this paper, we design, implement, and evaluate a new system that allows highly efficient outsourcing of decision tree inference. Our system significantly improves upon prior art in the overall online end-to-end secure inference service latency at the cloud as well as the local-side performance of the model provider. We first present a new scheme which securely shifts most of the processing of the model provider to the cloud, resulting in a substantial reduction on the model provider's performance complexities. We further devise a scheme which substantially optimizes the performance for secure decision tree inference at the cloud, particularly the communication round complexities. The synergy of these techniques allows our new system to achieve up to$8 \times$ better overall online end-to-end secure inference latency at the cloud side over realistic WAN environment, as well as bring the model provider up to$19 \times$ savings in communication and$18 \times$ savings in computation.- 26 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 20  (4) , 3079-3092
Optimizing Secure Decision Tree Inference Outsourcing
Outsourcing decision tree inference services to the cloud is highly beneficial, yet raises critical privacy concerns on the proprietary decision tree of the model provider and the private input data of the client. In this paper, we design, implement, and evaluate a new system that allows highly efficient outsourcing of decision tree inference. Our system significantly improves upon prior art in the overall online end-to-end secure inference service latency at the cloud as well as the local-side performance of the model provider. We first present a new scheme which securely shifts most of the processing of the model provider to the cloud, resulting in a substantial reduction on the model provider's performance complexities. We further devise a scheme which substantially optimizes the performance for secure decision tree inference at the cloud, particularly the communication round complexities. The synergy of these techniques allows our new system to achieve up to$8 \times$ better overall online end-to-end secure inference latency at the cloud side over realistic WAN environment, as well as bring the model provider up to$19 \times$ savings in communication and$18 \times$ savings in computation.- 13 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 20  (1) , 708-723
Towards Practical Auditing of Dynamic Data in Decentralized Storage
Decentralized storage (DS) projects such as Filecoin are gaining traction. Their openness mandates effective auditing mechanisms to assure users that their data remains intact. A blockchain is typically employed here as an unbiased public auditor. While the case for static data is relatively easy to handle, on-chain auditing of dynamic data with practical performance guarantees is still an open problem. Dynamic Proof-of-Storage (PoS) schemes developed for conventional cloud storage are not applicable to DS, since they require large storage proofs and/or large auditor states that are unmanageable by resource-constrained blockchains. To fill the gap, we propose a family of dynamic on-chain auditing protocols that can produce concretely small auditor states while retaining the compact proofs promised by static PoS schemes. Our design revolves around a set of succinct data structures and optimization techniques for index information management. With proper instantiation and realistic parameters, our protocols can achieve 0.25MB on-chain state and 1.2KB storage proof for the auditing of 1TB data, outperforming previous dynamic PoS schemes that are adaptable for DS by orders of magnitude. As another practical contribution, we introduce a data abstraction layer that allows one to deploy the auditing protocols on arbitrary storage systems hosting dynamic data.
- 13 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 20  (1) , 708-723
Towards Practical Auditing of Dynamic Data in Decentralized Storage
Decentralized storage (DS) projects such as Filecoin are gaining traction. Their openness mandates effective auditing mechanisms to assure users that their data remains intact. A blockchain is typically employed here as an unbiased public auditor. While the case for static data is relatively easy to handle, on-chain auditing of dynamic data with practical performance guarantees is still an open problem. Dynamic Proof-of-Storage (PoS) schemes developed for conventional cloud storage are not applicable to DS, since they require large storage proofs and/or large auditor states that are unmanageable by resource-constrained blockchains. To fill the gap, we propose a family of dynamic on-chain auditing protocols that can produce concretely small auditor states while retaining the compact proofs promised by static PoS schemes. Our design revolves around a set of succinct data structures and optimization techniques for index information management. With proper instantiation and realistic parameters, our protocols can achieve 0.25MB on-chain state and 1.2KB storage proof for the auditing of 1TB data, outperforming previous dynamic PoS schemes that are adaptable for DS by orders of magnitude. As another practical contribution, we introduce a data abstraction layer that allows one to deploy the auditing protocols on arbitrary storage systems hosting dynamic data.
- 16 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 16  (15566013) , 5310-5325
Interpreting and Mitigating Leakage-Abuse Attacks in Searchable Symmetric Encryption
Searchable symmetric encryption (SSE) enables users to make confidential queries over always encrypted data while confining information disclosure to pre-defined leakage profiles. Despite the well-understood performance and potentially broad applications of SSE, recent leakage-abuse attacks (LAAs) are questioning its real-world security implications. They show that a passive adversary with certain prior information of a database can recover queries by exploiting the legitimately admitted leakage. While several countermeasures have been proposed, they are insufficient for either security, i.e., handling only specific leakage like query volume, or efficiency, i.e., incurring large storage and bandwidth overhead. We aim to fill this gap by advancing the understanding of LAAs from a fundamental algebraic perspective. Our investigation starts by revealing that the index matrices of a plaintext database and its encrypted image can be linked by linear transformation. The invariant characteristics preserved under the transformation encompass and surpass the information exploited by previous LAAs. They allow one to unambiguously link encrypted queries with corresponding keywords, even with only partial knowledge of the database. Accordingly, we devise a new powerful attack and conduct a series of experiments to show its effectiveness. In response, we propose a new security notion to thwart LAAs in general, inspired by the principle of local differential privacy (LDP). Under the notion, we further develop a practical countermeasure with tunable privacy and efficiency guarantee. Experiment results on representative real-world datasets show that our countermeasure can reduce the query recovery rate of LAAs, including our own.
- 16 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 16  (15566013) , 5310-5325
Interpreting and Mitigating Leakage-Abuse Attacks in Searchable Symmetric Encryption
Searchable symmetric encryption (SSE) enables users to make confidential queries over always encrypted data while confining information disclosure to pre-defined leakage profiles. Despite the well-understood performance and potentially broad applications of SSE, recent leakage-abuse attacks (LAAs) are questioning its real-world security implications. They show that a passive adversary with certain prior information of a database can recover queries by exploiting the legitimately admitted leakage. While several countermeasures have been proposed, they are insufficient for either security, i.e., handling only specific leakage like query volume, or efficiency, i.e., incurring large storage and bandwidth overhead. We aim to fill this gap by advancing the understanding of LAAs from a fundamental algebraic perspective. Our investigation starts by revealing that the index matrices of a plaintext database and its encrypted image can be linked by linear transformation. The invariant characteristics preserved under the transformation encompass and surpass the information exploited by previous LAAs. They allow one to unambiguously link encrypted queries with corresponding keywords, even with only partial knowledge of the database. Accordingly, we devise a new powerful attack and conduct a series of experiments to show its effectiveness. In response, we propose a new security notion to thwart LAAs in general, inspired by the principle of local differential privacy (LDP). Under the notion, we further develop a practical countermeasure with tunable privacy and efficiency guarantee. Experiment results on representative real-world datasets show that our countermeasure can reduce the query recovery rate of LAAs, including our own.