Wei Huang
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
Wei Huang has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- David Lie
University of Toronto, Toronto, Ontario, Canada
4 shared publications - Shengjie Xu
University of Toronto, Canada
3 shared publications - Aastha Mehta
University of British Columbia, Vancouver, Canada
1 shared publication - Chuan Wu
The University of Hong Kong, Hong Kong, China
1 shared publication David Lie
University of Toronto
1 shared publication- Eric Liu
University of Toronto, Canada
1 shared publication
Latest Publications
- Open Access
- 1 October 2024
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 56 (12) , 1-37
A Survey of Hardware Improvements to Secure Program Execution
Hardware has been constantly augmented for security considerations since the advent of computers. There is also a common perception among computer users that hardware does a relatively better job on security assurance compared with software. Yet, the community has long lacked a comprehensive study to answer questions such as how hardware security support contributes to security, what kind of improvements have been introduced to improve such support and what its advantages/disadvantages are. By generalizing various security goals, we taxonomize hardware security features and their security properties that can aid in securing program execution, considered as three aspects, i.e., state correctness, runtime protection and input/output protection. Based on this taxonomy, the survey systematically examines (1) the roles: how hardware is applied to achieve security; and (2) the problems: how reported attacks have exploited certain defects in hardware. We see that hardware’s unique advantages and problems co-exist and it highly depends on the desired security purpose as to which type to use. Among the survey findings are also that code as part of hardware (aka. firmware) should be treated differently to ensure security by design; and how research proposals have driven the advancement of commodity hardware features.
- 1 October 2024
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 56 (12) , 1-37
Open AccessA Survey of Hardware Improvements to Secure Program Execution
Hardware has been constantly augmented for security considerations since the advent of computers. There is also a common perception among computer users that hardware does a relatively better job on security assurance compared with software. Yet, the community has long lacked a comprehensive study to answer questions such as how hardware security support contributes to security, what kind of improvements have been introduced to improve such support and what its advantages/disadvantages are. By generalizing various security goals, we taxonomize hardware security features and their security properties that can aid in securing program execution, considered as three aspects, i.e., state correctness, runtime protection and input/output protection. Based on this taxonomy, the survey systematically examines (1) the roles: how hardware is applied to achieve security; and (2) the problems: how reported attacks have exploited certain defects in hardware. We see that hardware’s unique advantages and problems co-exist and it highly depends on the desired security purpose as to which type to use. Among the survey findings are also that code as part of hardware (aka. firmware) should be treated differently to ensure security by design; and how research proposals have driven the advancement of commodity hardware features.
- Open Access
- 22 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 37-42
Stream Processing with Adaptive Edge-Enhanced Confidential Computing
Stream processing is becoming increasingly significant in various scenarios, including security-sensitive sectors. It benefits from keeping data in memory, which exposes large volumes of data in use, thereby emphasising the need for protection. The recent development of confidential computing makes such protection technologically feasible. However, these new hardware-based protection methods incur performance overhead. Our evaluation shows that replacing legacy VMs with confidential VMs to run streaming applications incurs up to 8.5% overhead on the throughput of the queries we tested in the NEXMark benchmark suite. Pursuing specialised protection for broader attacks, such as attacks at the edge with more physical exposure, can push this overhead further. In this paper, we propose a resource scheduling strategy for stream processing applications tailored to the privacy needs of specific application functions. We implement this system model using Apache Flink, a widely-used stream processing framework, making it aware of the underlying cluster's protection capability and scheduling the application functions across resources with different protections tailored to the privacy requirements of an application and the available deployment environment.
- 22 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 37-42
Open AccessStream Processing with Adaptive Edge-Enhanced Confidential Computing
Stream processing is becoming increasingly significant in various scenarios, including security-sensitive sectors. It benefits from keeping data in memory, which exposes large volumes of data in use, thereby emphasising the need for protection. The recent development of confidential computing makes such protection technologically feasible. However, these new hardware-based protection methods incur performance overhead. Our evaluation shows that replacing legacy VMs with confidential VMs to run streaming applications incurs up to 8.5% overhead on the throughput of the queries we tested in the NEXMark benchmark suite. Pursuing specialised protection for broader attacks, such as attacks at the edge with more physical exposure, can push this overhead further. In this paper, we propose a resource scheduling strategy for stream processing applications tailored to the privacy needs of specific application functions. We implement this system model using Apache Flink, a widely-used stream processing framework, making it aware of the underlying cluster's protection capability and scheduling the application functions across resources with different protections tailored to the privacy requirements of an application and the available deployment environment.
- Open Access
- 16 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 609-622
MIFP: Selective Fat-Pointer Bounds Compression for Accurate Bounds Checking
Bounds compression for fat pointers can reduce the memory and performance overhead of maintaining pointer bounds and is necessary for efficient hardware implementation. However, compression can introduce inaccuracy to the bounds, making certain out-of-bounds accesses undetectable. Although the security threat can be mitigated by padding the objects, no known mitigations can detect these out-of-bounds accesses deterministically. We present MIFP, a method that automatically mixes both compressed and uncompressed bounds to preserve the performance benefits of bounds compression while ensuring accurate bounds checking. Given a program using a single fat pointer representation (e.g., all compressed bounds), MIFP performs whole-program analysis to expand potentially unsafe and inaccurate fat pointers such that they carry accurate uncompressed bounds. To minimize the number of pointers to expand, MIFP adds instrumentation on a per-allocation-site granularity; objects of the same type but different code allocation locations can have their pointer members transformed differently depending on how the pointers are used. We describe our algorithm and supporting data structures, and show that utilizing multiple fat-pointer representations reduces the runtime and memory overheads of uncompressed bounds by 79% and 93% respectively.
- 16 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 609-622
Open AccessMIFP: Selective Fat-Pointer Bounds Compression for Accurate Bounds Checking
Bounds compression for fat pointers can reduce the memory and performance overhead of maintaining pointer bounds and is necessary for efficient hardware implementation. However, compression can introduce inaccuracy to the bounds, making certain out-of-bounds accesses undetectable. Although the security threat can be mitigated by padding the objects, no known mitigations can detect these out-of-bounds accesses deterministically. We present MIFP, a method that automatically mixes both compressed and uncompressed bounds to preserve the performance benefits of bounds compression while ensuring accurate bounds checking. Given a program using a single fat pointer representation (e.g., all compressed bounds), MIFP performs whole-program analysis to expand potentially unsafe and inaccurate fat pointers such that they carry accurate uncompressed bounds. To minimize the number of pointers to expand, MIFP adds instrumentation on a per-allocation-site granularity; objects of the same type but different code allocation locations can have their pointer members transformed differently depending on how the pointers are used. We describe our algorithm and supporting data structures, and show that utilizing multiple fat-pointer representations reduces the runtime and memory overheads of uncompressed bounds by 79% and 93% respectively.
- 9 July 2021
- Published by Springer Nature
- p. 173-193
Aion Attacks: Manipulating Software Timers in Trusted Execution Environment
- 9 July 2021
- Published by Springer Nature
- p. 173-193
Aion Attacks: Manipulating Software Timers in Trusted Execution Environment
- Open Access
- 1 May 2021
- Published by IOP Publishing in IOP Conference Series: Earth and Environmental Science
- Vol. 781 (3) , 032041
Analysis of Denoising Methods of Underwater Acoustic Pulse Signal Based on Wavelet and Wavelet Packet
Underwater acoustic countermeasures include active sonar countermeasures and passive sonar countermeasures. In order to achieve the best operational efficiency of jamming equipment, the generation of jamming signals must adapt to the development trend of underwater acoustic detection technology-nonlinear time-varying and broadband characteristics. Feature extraction is to map the high-dimensional original data to the low-dimensional transformation space through a certain mapping relationship, which can suppress a large amount of redundant information in the data and highlight the category information of the data. One of the applications of wavelet analysis in signal analysis and processing is to remove noise components from signals. In practical engineering applications, sampled signals are inevitably polluted by various noises and interferences. Through the analysis of noise characteristics, it can be seen that the wavelet denoising method is very effective in removing signal noise. In this paper, aiming at the signals with different spectrum distribution, we use various methods to de-noise in order to find the de-noising methods suitable for underwater acoustic pulse signals with different frequency characteristics, and thus find an effective means to detect signals.
- 1 May 2021
- Published by IOP Publishing in IOP Conference Series: Earth and Environmental Science
- Vol. 781 (3) , 032041
Open AccessAnalysis of Denoising Methods of Underwater Acoustic Pulse Signal Based on Wavelet and Wavelet Packet
Underwater acoustic countermeasures include active sonar countermeasures and passive sonar countermeasures. In order to achieve the best operational efficiency of jamming equipment, the generation of jamming signals must adapt to the development trend of underwater acoustic detection technology-nonlinear time-varying and broadband characteristics. Feature extraction is to map the high-dimensional original data to the low-dimensional transformation space through a certain mapping relationship, which can suppress a large amount of redundant information in the data and highlight the category information of the data. One of the applications of wavelet analysis in signal analysis and processing is to remove noise components from signals. In practical engineering applications, sampled signals are inevitably polluted by various noises and interferences. Through the analysis of noise characteristics, it can be seen that the wavelet denoising method is very effective in removing signal noise. In this paper, aiming at the signals with different spectrum distribution, we use various methods to de-noise in order to find the de-noising methods suitable for underwater acoustic pulse signals with different frequency characteristics, and thus find an effective means to detect signals.
- Open Access
- 17 April 2021
- Published by Association for Computing Machinery (ACM)
- p. 224-240
In-fat pointer: hardware-assisted tagged-pointer spatial memory safety defense with subobject granularity protection
Programming languages like C and C++ are not memory-safe because they provide programmers with low-level pointer manipulation primitives. The incorrect use of these primitives can result in bugs and security vulnerabilities: for example, spatial memory safety errors can be caused by dereferencing pointers outside the legitimate address range belonging to the corresponding object. While a range of schemes to provide protection against these vulnerabilities have been proposed, they all suffer from the lack of one or more of low performance overhead, compatibility with legacy code, or comprehensive protection for all objects and subobjects. We present In-Fat Pointer, the first hardware-assisted defense that can achieve spatial memory safety at subobject granularity while maintaining compatibility with legacy code and low overhead. In-Fat Pointer improves the protection granularity of tagged-pointer schemes using object metadata, which is efficient and binary-compatible for object-bound spatial safety. Unlike previous work that devotes all pointer tag bits to object metadata lookup, In-Fat Pointer uses three complementary object metadata schemes to reduce the number pointer tag bits needed for metadata lookup, allowing it to use the left-over bits, along with in-memory type metadata, to refine the object bounds to subobject granularity. We show that this approach provides practical protection of fine-grained spatial memory safety.
- 17 April 2021
- Published by Association for Computing Machinery (ACM)
- p. 224-240
Open AccessIn-fat pointer: hardware-assisted tagged-pointer spatial memory safety defense with subobject granularity protection
Programming languages like C and C++ are not memory-safe because they provide programmers with low-level pointer manipulation primitives. The incorrect use of these primitives can result in bugs and security vulnerabilities: for example, spatial memory safety errors can be caused by dereferencing pointers outside the legitimate address range belonging to the corresponding object. While a range of schemes to provide protection against these vulnerabilities have been proposed, they all suffer from the lack of one or more of low performance overhead, compatibility with legacy code, or comprehensive protection for all objects and subobjects. We present In-Fat Pointer, the first hardware-assisted defense that can achieve spatial memory safety at subobject granularity while maintaining compatibility with legacy code and low overhead. In-Fat Pointer improves the protection granularity of tagged-pointer schemes using object metadata, which is efficient and binary-compatible for object-bound spatial safety. Unlike previous work that devotes all pointer tag bits to object metadata lookup, In-Fat Pointer uses three complementary object metadata schemes to reduce the number pointer tag bits needed for metadata lookup, allowing it to use the left-over bits, along with in-memory type metadata, to refine the object bounds to subobject granularity. We show that this approach provides practical protection of fine-grained spatial memory safety.
- 1 December 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 263-267
Identify Stack Overflow Exploits with Dynamic Binary Instrumentation
This paper describes DStack, a dynamic binary instrumentation tool for identifying overflows in stack frames in C and C++ programs. This technique is designed for detecting if a particular stack value, namely a return address, was corrupted because of a stack overflow. Thus, DStack is useful for identifying intrusion attempts but also for checking the run-time robustness of applications. We implemented a proof-of-concept tool based on Pin, a popular dynamic binary instrumentation framework. We have evaluated the tool on two real-world CVE vulnerability and the results shown that it can help identify the root causes of stack overflow effectively.
- 1 December 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 263-267
Identify Stack Overflow Exploits with Dynamic Binary Instrumentation
This paper describes DStack, a dynamic binary instrumentation tool for identifying overflows in stack frames in C and C++ programs. This technique is designed for detecting if a particular stack value, namely a return address, was corrupted because of a stack overflow. Thus, DStack is useful for identifying intrusion attempts but also for checking the run-time robustness of applications. We implemented a proof-of-concept tool based on Pin, a popular dynamic binary instrumentation framework. We have evaluated the tool on two real-world CVE vulnerability and the results shown that it can help identify the root causes of stack overflow effectively.
- 10 January 2013
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 7 (4) , 469-484
The performance and locality tradeoff in bittorrent-like file sharing systems
- 10 January 2013
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 7 (4) , 469-484
The performance and locality tradeoff in bittorrent-like file sharing systems
- 1 December 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21601283,p. 4788-4790
The development status and prospects of cloud computing
The emergence of cloud computing was the result of the development of parallel technology, software technology, network technology. Cloud computing ultimate goal was to service users. Cloud computing could provide users with on-demand computing power, storage capacity and application service capability. As a new model of Internet applications, cloud computing could be the dominant mode to get services and information for us. At present there was no accepted definition of cloud computing, the paper described the definition of cloud computing from the user's point of view. And the paper generally introduces the current cloud computing platforms, the development, prospects and challenges of cloud computing.
- 1 December 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21601283,p. 4788-4790
The development status and prospects of cloud computing
The emergence of cloud computing was the result of the development of parallel technology, software technology, network technology. Cloud computing ultimate goal was to service users. Cloud computing could provide users with on-demand computing power, storage capacity and application service capability. As a new model of Internet applications, cloud computing could be the dominant mode to get services and information for us. At present there was no accepted definition of cloud computing, the paper described the definition of cloud computing from the user's point of view. And the paper generally introduces the current cloud computing platforms, the development, prospects and challenges of cloud computing.