Binary lifting, which is to translate a binary executable to a high-level intermediate representation, is a primary step in binary analysis. Despite its importance, there are only few existing approaches to testing the correctness of binary lifters. Furthermore, the existing approaches suffer from low test coverage, because they largely depend on random test case generation. In this paper, we present the design and implementation of the first systematic approach to testing binary lifters. We have evaluated the proposed system on 3 state-of-the-art binary lifters, and found 24 previously unknown semantic bugs. Our result demonstrates that writing a precise binary lifter is extremely difficult even for those heavily tested projects.

Industrial wireless sensor networks (IWSNs) are advancing to a form of active networks called industrial wireless active sensor networks (IWASNs) with reprogrammable sensor nodes, and thus require a method to check the integrity of software in sensor nodes. Regarding energy efficiency, however, previous methods did not take into account the scalability of IWASNs and thus performed inefficiently. In this paper, we propose FlexiCast, which presents a novel energy-efficient method to check the integrity of software objects. Sensor nodes can efficiently detect a modification in software objects sent by a base station or stored in neighboring nodes through authenticated fingerprints and network-wide attestation. Our analysis shows that FlexiCast can reduce energy consumption by 71% for both updating software objects and checking modifications regarding more critical attacks.

A practical pairwise key distribution scheme is necessary for wireless sensor networks since sensor nodes are susceptible to physical capture and constrained in their resources. In this paper, we investigate a simple and practical scheme that achieves higher connectivities and perfect resilience with less resources, even in case of deployment errors.

There are currently heterogeneous wireless access networks. A large variety of applications utilizing these networks will demand features such as real-time, high-availability and even instantaneous high-bandwidth in some cases. Therefore, it is imperative for network service providers to make the best possible use of the combined resources of available heterogeneous networks for connection support. Thus, with regard to vertical handoff performance, there is a critical need for developing algorithms for connection management and optimal resource allocation for seamless mobility. In this paper, we develop a vertical handoff decision algorithm that enables a wireless access network to not only balance the overall load among all attachment points but also to maximize the collective battery lifetime of mobile nodes (MNs). Simulation results are also presented to demonstrate the efficacy of the proposed algorithms.