Xun Chen

Xun Chen

Auto-generated profile, based on publicly available information

Xun Chen

Samsung Research America, Mountain View, CA, USA

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 August 2024 in Nature Medicine
Verified
Journal Article
Closed access
PDF file
KZKai Zhang
Kai Zhang
RZRong Zhou
Rong Zhou
EAEashan Adhikarla
Eashan Adhikarla
ZYZhiling Yan
Zhiling Yan
YLYixin Liu
Yixin Liu
Lichao SunLichao Sun
Lichao Sun

2 October 2023
Verified
Conference Paper
Open access
HGHanqing Guo
Hanqing Guo
XCXun Chen
Xun Chen
JGJunfeng Guo
Junfeng Guo
LXLi Xiao
Li Xiao
QYQiben Yan
Qiben Yan
Speaker Verification (SV) is widely deployed in mobile systems to authenticate legitimate users by using their voice traits. In this work, we propose a backdoor attack MasterKey, to compromise the SV models. Different from previous attacks, we focus on a real-world practical setting where the attacker possesses no knowledge of the intended victim. To design MasterKey, we investigate the limitation of existing poisoning attacks against unseen targets. Then, we optimize a universal backdoor that is capable of attacking arbitrary targets. Next, we embed the speaker's characteristics and semantics information into the backdoor, making it imperceptible. Finally, we estimate the channel distortion and integrate it into the backdoor. We validate our attack on 6 popular SV models. Specifically, we poison a total of 53 models and use our trigger to attack 16,430 enrolled speakers, composed of 310 target speakers enrolled in 53 poisoned models. Our attack achieves 100% attack success rate with a 15% poison rate. By decreasing the poison rate to 3%, the attack success rate remains around 50%. We validate our attack in 3 real-world scenarios, and successfully demonstrate the attack through both over-the-air and over-the-telephony-line scenarios.

15 November 2023
Verified
Conference Paper
Open access
YZYunhang Zhang
Yunhang Zhang
CPChengbin Pang
Chengbin Pang
SNStefan Nagy
Stefan Nagy
XCXun Chen
Xun Chen
JXJun Xu
Jun Xu
Greybox fuzzing is a highly popular option for security testing, incentivizing tremendous efforts to improve its performance. Prior research has brought many algorithmic advancements, leading to substantial performance growth. However, less attention has been paid to the system-level designs of greybox fuzzing tools, despite the high impacts of such designs on fuzzing throughput. In this paper, we explore system-level optimizations for greybox fuzzing. Throughout an empirical study, we unveil two system-level optimization opportunities. First, the common fuzzing mode with a fork server visibly slows down the target execution, which can be optimized by coupling persistent mode with efficient state recovery. Second, greybox fuzzing tools rely on the native Operating System (OS) to support interactions issued by the target program, involving complex but fuzzing-irrelevant operations. Simplification of OS interactions represents another optimization opportunity. We develop two techniques, informed by a short profiling phase of the fuzzing tool, to achieve the optimizations above. The first technique enables reliable and efficient persistent mode by learning critical execution states from the profiling and patching the target program to reset them. The second technique introduces user-space abstractions to simulate OS functionality, reducing expensive OS interactions. Evaluated with 20 programs and the MAGMA benchmark, we demonstrate that our optimizations can accelerate AFL and AFL++ for higher code coverage and faster bug finding.

4 December 2024
Verified
Conference Paper
Open access
HGHanqing Guo
Hanqing Guo
GWGuangjing Wang
Guangjing Wang
BCBocheng Chen
Bocheng Chen
YWYuanda Wang
Yuanda Wang
XZXiao Zhang
Xiao Zhang
LXLi Xiao
Li Xiao
In this paper, we propose WavePurifier, an audio purification framework to defend against audio adversarial attacks. Audio adversarial attacks craft adversarial examples or perturbations to attack the automated speech recognition (ASR) models. Although existing defense mechanisms can detect such attacks and raise alarms, they fail to recover or maintain benign commands. Consequently, this leads to the denial of users' benign commands. Different than existing defenses, WavePurifier aims to purify adversarial examples, thereby rectifying the user's benign commands. We find that the forward diffusion process of the diffusion model effectively eliminates perturbations, whereas the reverse diffusion process restores benign speech. Based on this, we develop a hierarchical diffusion model to defend against audio adversarial examples. This model is capable of purifying different spectrogram bands to varying degrees. To validate the performance of WavePurifier, we purify the adversarial examples from 3 different adversarial attacks in 140 distinct settings. In total, we collect 78,864 diffused spectrograms and 21,000 purified audios. Then, we evaluate WavePurifier on 2 different ASR models, 4 commercial speech-to-text APIs, 2 real-world attack scenarios, and compare them against 7 existing defense approaches. Our result shows that WavePurifier is a universal framework, demonstrating adaptability across diverse attacks with the same hyperparameters. Notably, WavePurifier outperforms existing methods with the lowest character error rate (CER), word error rate (WER), and a high purification success rate against different attacks.

19 November 2023
Verified
Conference Paper
Open access
YZYancheng Zhang
Yancheng Zhang
XCXun Chen
Xun Chen
QLQian Lou
Qian Lou
Fully homomorphic encryption (FHE) allows computation over encrypted data without decryption and is considered one of the most essential primitives for privacy-preserving applications. However, there are still no universal FHE schemes that can support efficient and precise evaluation of both arithmetic and logic operations. Many endeavors have been made to enhance the capability of FHE for general computation, such as scheme switching and polynomial approximation. However, the overhead of scheme switching remains prohibitive for real applications with large bit-width inputs. On the other hand, the approximation methods have large errors around the pivotal point, limiting their application in precision-sensitive tasks. Recent studies show that FV-style HE schemes can support efficient and precise logic operations via polynomial interpolation. However, these methods cannot be seamlessly incorporated with arithmetic operations. In this work, we introduce HEBridge to connect the arithmetic and logic operations in the FV-style HE schemes. We first demonstrate that the arithmetic and logic operations operate over different underlying plaintext spaces. To enable continuous arithmetic and logic operations, we propose a reduction function and a lifting function to switch between these plaintext spaces. With HEBridge, we can exploit fast arithmetic and precise logic operations simultaneously in FV-style HE schemes. Experimental results show that the proposed HEBridge is 32.9× faster than direct interpolation methods and 1 to 3 orders of magnitude more efficient than scheme switching on large bit-width inputs.