1 January 2026 in IEICE Transactions on Information and Systems
In recent years, security measures for IoT devices have become more important. Fuzzing of IoT devices is an effective way to find unknown vulnerabilities. In IoT device fuzzing, a large number of test cases are generated based on a set of initial seeds and they are sent to a target device to monitor its behavior, in which a device crash means that a vulnerability has been discovered. However, generating a set of initial seeds is difficult because technical knowledge in security and adaptation to various IoT devices are quite required. In this paper, we propose a method to generate initial seeds for IoT device fuzzing effectively utilizing a large language model (LLM). The proposed method efficiently generates initial seeds for fuzzing the target IoT device by inputting only the type of IoT device, communication logs, and the name of the vulnerability to be inspected into an LLM, with no specific technical knowledge in security. Experimental results of applying the proposed method to two types of IoT devices show that the proposed method detected the first crash in 0.40 seconds and 0.47 seconds from the start of fuzzing, respectively, and after 24 hours of fuzzing, it detected all the crashes due to null pointer exception and buffer overflow that could not be detected by fuzzing with the initial seeds generated manually.
22 November 2023 in arXiv
Differentially private GNNs (Graph Neural Networks) have been recently studied to provide high accuracy in various tasks on graph data while strongly protecting user privacy. In particular, a recent study proposes an algorithm to protect each user's feature vector in an attributed graph with LDP (Local Differential Privacy), a strong privacy notion without a trusted third party. However, this algorithm does not protect edges (friendships) in a social graph, hence cannot protect user privacy in unattributed graphs. How to provide strong privacy with high accuracy in unattributed graphs remains open. In this paper, we propose a novel LDP algorithm called the DPRR (Degree-Preserving Randomized Response) to provide LDP for edges in GNNs. Our DPRR preserves each user's degree hence a graph structure while providing edge LDP. Technically, our DPRR uses Warner's RR (Randomized Response) and strategic edge sampling, where each user's sampling probability is automatically tuned using the Laplacian mechanism to preserve the degree information under edge LDP. We also propose a privacy budget allocation method to make the noise in both Warner's RR and the Laplacian mechanism small. We focus on graph classification as a task of GNNs and evaluate the DPRR using three social graph datasets. Our experimental results show that the DPRR significantly outperforms three baselines and provides accuracy close to a non-private algorithm in all datasets with a reasonable privacy budget, e.g., epsilon=1.