Di Liu 0019

dblp:15/1777-19 · DBLP profile ↗
← Back
8ranked-venue papers
1as first author
8since 2021 · last 2025
0000-0002-6431-8515ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 4 · 1 first-author · 4 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 1 · 1 since 2021
YearPublicationVenuePosition
2025 LOGO-Based Intellectual Property Right Protection Scheme for GANs on FPGA
abstract
In recent years, Generative Adversarial Networks (GANs) have become essential tools in artificial intelligence research. Field Programmable Gate Arrays (FPGAs) offer remarkable flexibility, high performance, and energy efficiency for deploying GANs. However, the open and reprogrammable architecture of FPGAs, despite its advantages, introduces risks of unauthorized access and reverse engineering. To address this challenge, this paper presents a novel approach integrating Physical Unclonable Functions (PUFs) and logos to protect the Intellectual Property Rights (IPR) of GANs. Our method establishes a closed-loop conversion process where logos are transformed into PUF responses, generating unique identities fed into the GAN to reproduce the original logo. By embedding PUF response information into latent vectors, the generator produces images with embedded logos. Thanks to the uniqueness of PUF, a robust binding of the logo, FPGA, and GANs' IPR is implemented, allowing verification of the IPR with the assistance of a unique FPGA fingerprint, even when a publicly available logo is used. Experimental results show that embedding the logo does not change the performance of the original GANs, and the logo detection rate exceeds 90%. At the same time, the scheme can effectively resist brute force, fine-tuning and pruning attacks.
Dawei Li 0009, Yangkun Ren, Di Liu 0019, Song Bian 0001, Zhenyu Guan 0002, Willy Susilo, Jianwei Liu 0001, Qianhong Wu
IEEE Trans. Dependable Secur. Comput.3
2025 Enhancing the Security of One-Tap Authentication Services via Dynamic Application Identification
abstract
The One-Tap Authentication (OTAuth) service enables users to quickly log in or sign up for app accounts using their phone number. OTAuth provides a more secure and convenient alternative to password-based and Short Message Service (SMS)-based authentication schemes. Consequently, the OTAuth service has been adopted by numerous Mobile Network Operators (MNOs) worldwide. However, a high severity vulnerability remains unaddressed in the OTAuth service, which allows an attacker to access a victim’s various app accounts, posing a significant risk to user privacy and data security. In this paper, we present LoadShow, which, to the best of our knowledge, is the first security-enhanced OTAuth scheme to address this vulnerability. We propose a novel dynamic application identification technique that aims to address the root cause of this vulnerability, i.e., the inability of MNOs to distinguish between different applications on the same device. Specifically, application identification is based on the hardware load side-channel and captures the unique CPU and GPU load characteristics of applications through the sequence of timing values of fingerprinting functions. We evaluate the effectiveness of LoadShow by accuracy, False Positive Rate (FPR), and True Positive Rate (TPR). We also evaluate its multi-platform compatibility on devices with different architectures and models. LoadShow achieves over 90% accuracy, with a TPR exceeding 90% and an FPR below 1%. The evaluation results demonstrate LoadShow’s capability to effectively differentiate between applications on a device, defend against app impersonation attacks, and reliably identify legitimate applications.
Di Liu 0019, Dawei Li 0009, Ruinan Hu, Jianwei Liu 0001, Song Bian 0001, Xuhua Ding, Yizhong Liu, Zhenyu Guan 0002
IEEE Trans. Inf. Forensics Secur.1
2025 How to Prevent Social Media Platforms From Knowing the Images You Share With Friends
abstract
The surge in image sharing on social media platforms escalates private information extraction for commercial use, increasing user demand for privacy protection. However, the dynamics of group communication within online social networks and the image compression imposed by platforms present significant challenges to secure key exchange and reliable image sharing in existing solutions. In this paper, we propose PrivSocial to prevent social media platforms from extracting private information in images shared within group communications. Specifically, we propose two frameworks, a server-based framework and a subscription-based framework, making PrivSocial applicable to different social media platforms and providing users with optional security levels, enhancing the flexibility and efficiency. To achieve intra-group key agreement and ensure image privacy protection, both frameworks integrate optimized continuous group key agreement and a novel image encryption scheme resisting compression. We implement an Android-based Priv-raster application and deploy a prototype on Twitter. Furthermore, we evaluate the proposed encryption scheme, and experimental results show that it has efficient encryption and decryption performance while being resistant to jigsaw puzzle solver attacks. The multi-user simulation experiments also demonstrate that the processing time of a single user is mere milliseconds, and the scheme can efficiently support tens of thousands of groups.
Dawei Li 0009, Di Liu 0019, Qifan Liu, Song Bian 0001, Zhenyu Guan 0002
IEEE Trans. Mob. Comput.3
2024 CPAKA: Mutual Authentication and Key Agreement Scheme Based on Conditional PUF in Space-Air-Ground Integrated Network
abstract
The space-air-ground integrated network (SAGIN) has a stringent demand on the efficiency of authentication protocols deployed in the devices that have been launched into the air and space. In this paper, we define the concept of the security model of conditional physical unclonable function (CPUF) that guarantees the security of the protocol while allowing the use of PUFs that can be modeled. We then propose a CPUF-based authentication and key agreement (AKA) scheme, named CPAKA, that addresses the challenges of device key leakage and inefficient authentication in resource-asymmetric environments. The CPAKA scheme embeds PUFs in weak nodes and deploys prediction models corresponding to the PUFs in strong nodes, eliminating the need to store challenge-response pairs or perform complex calculations. We formally prove the protocol's security under the decisional uniqueness assumption of CPUF and the universal composability framework, and we analyze its secrecy and authentication properties using the Tamarin prover. We also implement an Arbiter PUF on the ZYNQ-7020 FPGA, verify its accuracy through experiments, and show that CPAKA is secure, efficient, and suitable for SAGIN. Our CPAKA scheme greatly reduces computing and storage costs while improving authentication efficiency compared to traditional schemes.
Dawei Li 0009, Di Liu 0019, Yangkun Ren, Yu Sun 0015, Zhenyu Guan 0002, Qianhong Wu, Jiankun Hu, Jianwei Liu 0001
IEEE Trans. Dependable Secur. Comput.2
2023 FPHammer: A Device Identification Framework based on DRAM Fingerprinting
abstract
The device fingerprinting technique extracts fingerprints based on the hardware characteristics of the device to identify the device. The primary goal of device fingerprinting is to accurately and uniquely identify a device, which requires the generated device fingerprints to have good stability to achieve long-term tracking of the target device. However, the fingerprints generated by some existing fingerprinting technologies are not stable enough or change frequently, making it impossible to track the target device for a long time. In this paper, we present FPHammer, a novel DRAM-based fingerprinting technique. The device fingerprint generated by our technique has high stability and can be used to track the device for a long time. We leverage the Rowhammer technique to repeatedly and quickly access a row in DRAM to get bit flips in its adjacent row. We then construct a physical fingerprint of the device based on the locations of the collected bit flips. The evaluation results of the uniqueness and reliability of the physical fingerprint show that it can be used to distinguish devices with the same hardware and software configuration. The experimental results on device identification demonstrate that the physical fingerprints engendered by our innovative technique are inherently linked to the entirety of the device rather than just the DRAM module. Even if the device modifies software-level parameters such as MAC address and IP address or even reinstalls the operating system, we can accurately identify the target device. This demonstrates that FPHammer can generate stable fingerprints that are not affected by software layer parameters.
Dawei Li 0009, Di Liu 0019, Yangkun Ren, Yu Sun 0015, Zhenyu Guan 0002, Qianhong Wu, Jianwei Liu 0001
TrustCom2
2023 Defending against model extraction attacks with physical unclonable function
Dawei Li 0009, Di Liu 0019, Yangkun Ren, Jieyu Su, Jianwei Liu 0001
Inf. Sci.2
2022 PUF-Based Intellectual Property Protection for CNN Model
Dawei Li 0009, Yangkun Ren, Di Liu 0019, Zhenyu Guan 0002, Qianyun Zhang 0001, Jianwei Liu 0001
KSEM (3)3
2022 Blockchain-based authentication for IIoT devices with PUF
Dawei Li 0009, Di Liu 0019, Yingxian Song, Yangkun Ren, Zhenyu Guan 0002, Yu Sun 0015, Jianwei Liu 0001
J. Syst. Archit.3