Searcharxiv⌕ Search

arXiv subjects

Jiliang Zhang

Publications and source records attributed to Jiliang Zhang.

51 records · Page 3Linked to original sources

Backdoor Attacks and Countermeasures on Deep Learning: A Comprehensive Review

This work provides the community with a timely comprehensive review of backdoor attacks and countermeasures on deep learning. According to the attacker's capability and affected stage of the machine learning pipeline, the attack surfaces are recognized to be wide and then formalized into six categorizations: code poisoning, outsourcing, pretrained, data collection, collaborative learning and post-deployment. Accordingly, attacks under each categorization are combed. The countermeasures are categorized into four general classes: blind backdoor removal, offline backdoor inspection, online backdoor inspection, and post backdoor removal. Accordingly, we review countermeasures, and compare and analyze their advantages and disadvantages. We have also reviewed the flip side of backdoor attacks, which are explored for i) protecting intellectual property of deep learning models, ii) acting as a honeypot to catch adversarial example attacks, and iii) verifying data deletion requested by the data contributor.Overall, the research on defense is far behind the attack, and there is no single defense that can prevent all types of backdoor attacks. In some cases, an attacker can intelligently bypass existing defenses with an adaptive attack. Drawing the insights from the systematic review, we also present key areas for future research on the backdoor, such as empirical security evaluations from physical trigger attacks, and in particular, more efficient and practical countermeasures are solicited.

cs.CR↗

Wireless Performance Evaluation of Building Layouts: Closed-Form Computation of Figures of Merit

This paper presents a part of our ground-breaking work on evaluation of buildings in terms of wireless friendliness in the building-design stage. The main goal is to devise construction practices that provide for a good performance of wireless networks deployed in buildings. In this paper, the interference gain (IG) and power gain (PG) are defined as two figures of merit (FoM) of the wireless performance of buildings. The FoMs bridge the gap between building design and wireless communications industries. An approach to derive exact closed-form equations for these FoMs is proposed for the first time. The derived analytic expressions facilitate straightforward and more computationally efficient numerical evaluation of the proposed FoMs as compared to Monte Carlo simulations for well-known indoor propagation models. It is shown that the derived closed-form expression can be readily employed to evaluate the impact of building properties, such as the sizes and the aspect ratios (ARs) of rooms, on the wireless performance. The proposed approach sheds light to architects on evaluation and design of wireless-friendly building layouts.

eess.SP↗

SIAT: A Systematic Inter-Component Communication Analysis Technology for Detecting Threats on Android

In this paper, we present the design and implementation of a Systematic Inter-Component Communication Analysis Technology (SIAT) consisting of two key modules: \emph{Monitor} and \emph{Analyzer}. As an extension to the Android operating system at framework layer, the \emph{Monitor} makes the first attempt to revise the taint tag approach named TaintDroid both at method-level and file-level, to migrate it to the app-pair ICC paths identification through systemwide tracing and analysis of taint in intent both at the data flow and control flow. By taking over the taint logs offered by the \emph{Monitor}, the \emph{Analyzer} can build the accurate and integrated ICC models adopted to identify the specific threat models with the detection algorithms and predefined rules. Meanwhile, we employ the models' deflation technology to improve the efficiency of the \emph{Analyzer}. We implement the SIAT with Android Open Source Project and evaluate its performance through extensive experiments on well-known datasets and real-world apps. The experimental results show that, compared to state-of-the-art approaches, the SIAT can achieve about 25\%$\sim$200\% accuracy improvements with 1.0 precision and 0.98 recall at the cost of negligible runtime overhead. Moreover, the SIAT can identify two undisclosed cases of bypassing that prior technologies cannot detect and quite a few malicious ICC threats in real-world apps with lots of downloads on the Google Play market.

cs.CR↗

Understanding high ordering temperature in Gd$_6$FeBi$_2$ magnet: critical behavior, electronic structure and crystal-field analysis

Gd6FeBi2 is reported as the only one room-temperature magnet with a Curie temperature (Tc) of ca. 350 K among more than hundreds of compounds with its structural type, which makes it more attractive in potential applications. To reveal the origin of such high ordering temperature, critical behaviors, electronic structure and crystal-field effects of Gd6FeBi2 are investigated in this work. The short-range Gd-Fe ferrimagnetic interaction is supported by the non-Curie-Weiss paramagnetic behavior, crystal and electronic structure analyses, in agreement with previous DFT calculations. Unlike the strong TM-TM exchange interactions, the Gd-Fe exchange interaction shows limited influence on the critical exponents determined by long-range exchange interactions, which seems a common feature in RE-TM based alloys without TM-TM exchange interactions. However, the strong Gd-Fe hybridization reduces the influence of vibronic couplings on the short-range exchange interaction and thus allows a high Tc. The broadening or splitting mechanism of Gd 4f-electron bands is addressed based on crystal-field analysis and likely another factor for elevated Tc in Gd6FeBi2 and Gd-based compounds with non-magnetic elements. Different magnetic behaviors among isostructural compounds, and the relationship between the band splitting and crystal-field effects is also discussed.

physics.app-ph↗

ATMPA: Attacking Machine Learning-based Malware Visualization Detection Methods via Adversarial Examples

Since the threat of malicious software (malware) has become increasingly serious, automatic malware detection techniques have received increasing attention, where machine learning (ML)-based visualization detection methods become more and more popular. In this paper, we demonstrate that the state-of-the-art ML-based visualization detection methods are vulnerable to Adversarial Example (AE) attacks. We develop a novel Adversarial Texture Malware Perturbation Attack (ATMPA) method based on the gradient descent and L-norm optimization method, where attackers can introduce some tiny perturbations on the transformed dataset such that ML-based malware detection methods will completely fail. The experimental results on the MS BIG malware dataset show that a small interference can reduce the accuracy rate down to 0% for several ML-based detection methods, and the rate of transferability is 74.1% on average.

cs.CR↗

Set-based Obfuscation for Strong PUFs against Machine Learning Attacks

Strong physical unclonable function (PUF) is a promising solution for device authentication in resourceconstrained applications but vulnerable to machine learning attacks. In order to resist such attack, many defenses have been proposed in recent years. However, these defenses incur high hardware overhead, degenerate reliability and are inefficient against advanced machine learning attacks such as approximation attacks. In order to address these issues, we propose a Random Set-based Obfuscation (RSO) for Strong PUFs to resist machine learning attacks. The basic idea is that several stable responses are derived from the PUF itself and pre-stored as the set for obfuscation in the testing phase, and then a true random number generator is used to select any two keys to obfuscate challenges and responses with XOR operations. When the number of challenge-response pairs (CRPs) collected by the attacker exceeds the given threshold, the set will be updated immediately. In this way, machine learning attacks can be prevented with extremely low hardware overhead. Experimental results show that for a 64x64 Arbiter PUF, when the size of set is 32 and even if 1 million CRPs are collected by attackers, the prediction accuracies of Logistic regression, support vector machines, artificial neural network, convolutional neural network and covariance matrix adaptive evolutionary strategy are about 50% which is equivalent to the random guessing.

cs.CR↗

Adversarial Examples: Opportunities and Challenges

Deep neural networks (DNNs) have shown huge superiority over humans in image recognition, speech processing, autonomous vehicles and medical diagnosis. However, recent studies indicate that DNNs are vulnerable to adversarial examples (AEs), which are designed by attackers to fool deep learning models. Different from real examples, AEs can mislead the model to predict incorrect outputs while hardly be distinguished by human eyes, therefore threaten security-critical deep-learning applications. In recent years, the generation and defense of AEs have become a research hotspot in the field of artificial intelligence (AI) security. This article reviews the latest research progress of AEs. First, we introduce the concept, cause, characteristics and evaluation metrics of AEs, then give a survey on the state-of-the-art AE generation methods with the discussion of advantages and disadvantages. After that, we review the existing defenses and discuss their limitations. Finally, future research opportunities and challenges on AEs are prospected.

cs.LG↗

Physical Unclonable Function-based Key Sharing for IoT Security

In many Industry Internet of Things (IIoT) applications, resources like CPU, memory, and battery power are limited and cannot afford the classic cryptographic security solutions. Silicon Physical Unclonable Function (PUF) is a lightweight security primitive that exploits manufacturing variations during the chip fabrication process for key generation and/or device authentication. However, traditional weak PUFs such as Ring Oscillator (RO) PUF generate chip-unique key for each device, which restricts their application in security protocols where the same key is required to be shared in resource-constrained devices. In order to address this issue, we propose a PUF-based key sharing method for the first time. The basic idea is to implement one-to-one input-output mapping with Lookup Table (LUT)-based interstage crossing structures in each level of inverters of RO PUF. Individual customization on configuration bits of interstage crossing structure and different RO selections with challenges bring high flexibility. Therefore, with the flexible configuration of interstage crossing structures and challenges, CRO PUF can generate the same shared key for resource-constrained devices, which enables a new application for lightweight key sharing protocols.

cs.CR↗

DeepCheck: A Non-intrusive Control-flow Integrity Checking based on Deep Learning

Code reuse attack (CRA) is a powerful attack that reuses existing codes to hijack the program control flow. Control flow integrity (CFI) is one of the most popular mechanisms to prevent against CRAs. However, current CFI techniques are difficult to be deployed in real applications due to suffering several issues such as modifying binaries or compiler, extending instruction set architectures (ISA) and incurring unacceptable runtime overhead. To address these issues, we propose the first deep learning-based CFI technique, named DeepCheck, where the control flow graph (CFG) is split into chains for deep neural network (DNN) training. Then the integrity features of CFG can be learned by DNN to detect abnormal control flows. DeepCheck does not interrupt the application and hence incurs zero runtime overhead. Experimental results on Adobe Flash Player, Nginx, Proftpd and Firefox show that the average detection accuracy of DeepCheck is as high as 98.9%. In addition, 64 ROP exploits created by ROPGadget and Ropper are used to further test the effectiveness, which shows that the detection success rate reaches 100%.

cs.CR↗

Adversarial Audio: A New Information Hiding Method and Backdoor for DNN-based Speech Recognition Models

Audio is an important medium in people's daily life, hidden information can be embedded into audio for covert communication. Current audio information hiding techniques can be roughly classed into time domain-based and transform domain-based techniques. Time domain-based techniques have large hiding capacity but low imperceptibility. Transform domain-based techniques have better imperceptibility, but the hiding capacity is poor. This paper proposes a new audio information hiding technique which shows high hiding capacity and good imperceptibility. The proposed audio information hiding method takes the original audio signal as input and obtains the audio signal embedded with hidden information (called stego audio) through the training of our private automatic speech recognition (ASR) model. Without knowing the internal parameters and structure of the private model, the hidden information can be extracted by the private model but cannot be extracted by public models. We use four other ASR models to extract the hidden information on the stego audios to evaluate the security of the private model. The experimental results show that the proposed audio information hiding technique has a high hiding capacity of 48 cps with good imperceptibility and high security. In addition, our proposed adversarial audio can be used to activate an intrinsic backdoor of DNN-based ASR models, which brings a serious threat to intelligent speakers.

cs.CR↗

Stacking control in graphene-based materials: a promising way for fascinating physical properties

Graphene, defined as a single atomic plane of graphite, is a semimetal with small overlap between the valence and the conduction bands. The stacking of graphene up to several atomic layers can produce diverse physical properties, depending on the stacking way. The bilayer graphene is also a semimetal, adopting the AB-stacked (or Bernal-stacked) structure or the rare AA-stacked structure. The trilayer or a few layer graphene (FLG) can be semimetal or semiconductor, depending on whether it takes Bernal (ABA) stacking or rhombohedral (ABC) stacking. We will give a perspective on the recent two mild approaches to control the stacking via local transition from ABC stacking into ABA stacking. It is believed that with the rapid development of graphene-based materials, these techniques for stacking control can be used for more complex structure to fulfill fascinating properties and devices.

cond-mat.mtrl-sci↗

Design of Face Centered Cubic Co81.8Si9.1B9.1 with High Magnetocrystalline Anisotropy

Despite the composition close to glassy forming alloys, face centered cubic (FCC) Co81.8Si9.1B9.1, designed based on Co9B atomic cluster (polyhedral), are synthesized as singlephase ribbons successfully. These ribbons, with grain sizes of ca. 92 nm, show supreme ductility and strong orientation along (111), which couples with shape anisotropy leading to high magnetocrystalline anisotropy comparable to Co rich Co-Pt nanoscale thin films, with a coercivity of 430 Oe and squareness of 0.82 at room temperature. The stability and magnetic behaviors of the phase are discussed based on experimental electronic structure. This work not only develops low cost Co-based materials for hard magnetic applications, but also extends the atomic cluster model developed for amorphous alloys into the design of new crystalline materials.

cond-mat.mtrl-sci↗

Machine Learning Attack and Defense on Voltage Over-scaling-based Lightweight Authentication

It is a challenging task to deploy lightweight security protocols in resource-constrained IoT applications. A hardware-oriented lightweight authentication protocol based on device signature generated during voltage over-scaling (VOS) was recently proposed to address this issue. VOS-based authentication employs the computation unit such as adders to generate the process variation dependent error which is combined with secret keys to create a two-factor authentication protocol. In this paper, machine learning (ML)-based modeling attacks to break such authentication is presented. We also propose a dynamic obfuscation mechanism based on keys (DOMK) for the VOS-based authentication to resist ML attacks. Experimental results show that ANN, RNN and CMA-ES can clone the challenge-response behavior of VOS-based authentication with up to 99.65% predication accuracy, while the predication accuracy is less than 51.2% after deploying our proposed ML resilient technique.

cs.CR↗

HCIC: Hardware-assisted Control-flow Integrity Checking

Recently, code reuse attacks (CRAs), such as return-oriented programming (ROP) and jump-oriented programming (JOP), have emerged as a new class of ingenious security threatens. Attackers can utilize CRAs to hijack the control flow of programs to perform malicious actions without injecting any codes. Many defenses, classed into software-based and hardware-based, have been proposed. However, software-based methods are difficult to be deployed in practical systems due to high performance overhead. Hardware-based methods can reduce performance overhead but may require extending instruction set architectures (ISAs) and modifying compiler or suffer the vulnerability of key leakage. To tackle these issues, this paper proposes a new hardware-based control flow checking method to resist CRAs with negligible performance overhead without extending ISAs, modifying compiler and leaking the encryption/decryption key. The key technique involves two control flow checking mechanisms. The first one is the encrypted Hamming distances (EHDs) matching between the physical unclonable function (PUF) response and the return addresses, which prevents attackers from returning between gadgets so long as the PUF response is secret, thus resisting ROP attacks. The second one is the liner encryption/decryption operation (XOR) between PUF response and the instructions at target addresses of call and jmp instructions to defeat JOP attacks. Advanced return-based full-function reuse attacks will be prevented with the dynamic key-updating method. Experimental evaluations on benchmarks demonstrate that the proposed method introduces negligible 0.95% run-time overhead and 0.78% binary size overhead on average.

cs.CR↗

Polarization Shift Keying (PolarSK): System Scheme and Performance Analysis

Single-Radio-Frequency (RF) Multiple-Input-Multiple-Output (MIMO) systems such as the spatial modulation (SM) system and the space shift keying (SSK) system have been proposed to pursue a high spectral efficiency while keeping a low cost and complexity transceiver design. Currently, polarization domain resource has been introduced to the single-RF MIMO system to reduce the size of the transmit antenna array and provide 1 bit per channel use (bpcu) multiplexing gain. Nevertheless, the polarization domain resource still has the potential to provide a higher multiplexing gain in the polarized single-RF MIMO system. In this paper, we propose a generalized polarization shift keying (PolarSK) modulation scheme for a SIMO system that uses the polarization states in the dual-polarized transmit antenna as an information-bearing unit to increase the overall spectral efficiency. At the receive end, the maximum likelihood (ML) detector is employed to demodulate the received signal. A closed form union upper bound on the average bit error probability (ABEP) of PolarSK system with the optimum maximum likelihood (ML) receiver is deduced under fading channels. To reduce the computational complexity of the receiver, a linear successive interference cancellation (SIC) detection algorithm and a sphere-decoding (SD) detection algorithm are proposed. On the basis of analytic results and simulations, performances of the proposed PolarSK systems in terms of computational complexity and ABEP are analyzed. Numerical results show that the proposed PolarSK scheme performs better than state of the art dual-polarized/uni-polarized SM schemes.

cs.IT↗