Directed grey-box fuzzing (DGF) is an advanced technique in security testing, specifically designed to guide fuzzing tools toward predefined target sites within a software program. To improve its scalability on multiple targets, recent DGFs prioritize seeds that close to targets based on a more precise distance metric, and dynamically discard well-explored targets, thus steering toward all targets simultaneously. However, not all targets hold equal importance, particularly when facing large-scale target sets. Therefore, current works that blindly tracking all targets diverts computing resources from critical targets, thereby reducing the overall efficiency of triggering targets. In this paper, we present Prospector, a novel DGF approach that can handle large-scale target sets scenarios. Prospector employs an iterative process to focus on a select group of ”focused targets”. To dynamically maintain these targets, Prospector present a more fine-grained strategy that considers the vulnerable patterns and test adequacy of targets. Subsequently, Prospector further sharpens its fuzzing approach toward ”focused targets” by refining strategies in explore-exploit scheduling, seed selection, and byte scheduling. We evaluate Prospector on 24 programs by setting all sanitizer labels as targets. The experimental results show that Prospector exposed bugs faster than AFL++, WindRanger, ParmeSan, and FishFuzz by 125, 141, 84, and 100 cases, respectively. Among 38 unique bugs in the program group with the largest target sets, Prospector reproduces 18 (47.37%) existing bugs faster than other fuzzers. Prospector also discovered 6 new bugs in 4 real-world programs with 5 CVE IDs assigned.
A proof of concept (PoC) is essential for pinpointing a bug within software. However, relying on it alone for the timely and complete repair of bugs is insufficient due to underestimating the bug impacts. The bug impact reflects that a bug may be triggered at multiple positions following from the root cause, resulting in different bug types (e.g., use-after-free, heap-buffer-overflow). Current techniques discover bug impacts using fuzzing with a specific coverage-guided strategy: assigning more energy to seeds that cover the buggy code regions. This method can utilize a single PoC to generate multiple PoCs that contain different bug impacts in a short time. Unfortunately, we observe existing techniques are still unreliable, primarily due to their failure in balancing the time between in-depth and breadth exploration: (i) in-depth exploration for bug impacts behind crash regions and (ii) breadth exploration for bug impacts alongside unreached regions. Current techniques only focus on one exploration or conduct two explorations in separate stages leading to low accuracy and efficiency. Considering the aforementioned problem, we propose Sleuth, an approach for automatically investigating bug impacts following a known single PoC to enhance bug fixing. We design Sleuth on two novel concepts: (i) a dual-mode exploration mechanism built on a fuzzer designed for efficient in-depth and breadth exploration. (ii) a dynamic switchable strategy connecting with the dual-mode exploration that facilitates the reliability of bug impact investigation. We evaluate Sleuth using 50 known CVEs, and the result of experiment shows that Sleuth can efficiently discover new bug impacts in 86% CVEs and find 1.5x more bug impacts than state-of-art tools. Furthermore, Sleuth successfully identifies 13 incomplete fixes using the generated new PoCs.
Binary code similarity detection (BCSD) is a critical task for identifying vulnerable components in compiled binaries. However, current methods fail to reliably handle the significant compilation variations across platforms, compilers, and optimization levels. To overcome these challenges, we propose structural-semantic embedding with position-aware attention and adaptive contrast (SPAC), a novel BCSD framework that learns robust structural-semantic embeddings. SPAC integrates a learnable residual graph neural network for deep structural and semantic learning, a position-aware attention module for capturing spatial relationships, and an adaptive contrast aggregator for enhanced robustness and discriminability. This combined design enables SPAC to effectively model function semantics invariant to compilation differences. Evaluated on three large-scale datasets, SPAC demonstrates superior capabilities. Numerous experiments have shown that our method significantly outperforms the current state-of-the-art solutions. For example, in the XM retrieval experiment with a sample pool of 8000, compared with Trex, GMN, and GGSNN, our method achieved improvements of 155.1%, 92.3%, and 119.3% in recall score, respectively.
In shared-device scenarios, terminal-assisted Web authentication reduces credential exposure by keeping authentication credentials on a user-carried mobile terminal. However, existing methods struggle to minimize mobile interaction while protecting against account misuse by other users of the shared device. This study proposes a session-bound, terminal-assisted Web authentication method that uses Bluetooth Low Energy (BLE) proximity evidence to adaptively tune user interaction. The method decouples identity verification from proximity-based interaction tuning: identity is verified via the mobile credential and digital signature, while proximity evidence based on the received signal strength indicator (RSSI) is used solely to determine whether explicit user confirmation on the mobile terminal can be omitted. It binds the credential, Web origin, session, proximity evidence, and selected action into a single signed transcript, restricting each response to its intended login. To handle sensing noise, an uncertainty-aware fallback policy allows the confirmation-free path only when proximity evidence is sufficient and the service policy permits it; weak or insufficient evidence requires explicit confirmation. We implemented an Android–browser–server prototype on commodity mobile terminals and shared devices without dedicated ranging hardware. In the evaluation, 93% and 82% of RSSI windows at 15 cm and 50 cm, respectively, were classified by the proximity gate as eligible for the confirmation-free path, whereas all windows at 100 cm or farther and in through-wall conditions required explicit confirmation. The measured prototype processing time averaged 1391 ms across 20 trials, excluding browser discovery, device selection, and user interaction. These results demonstrate prototype feasibility under the evaluated conditions.