Search

Binary code similarity detection plays a crucial role in various applications within binary security, including vulnerability detection, malicious software analysis, etc. However, existing methods suffer from limited differentiation in binary embedding representations across different compilation environments, lacking dynamic high-level semantics. Moreover, current approaches often neglect multi-level semantic feature extraction, thereby failing to acquire precise semantic information about the binary code. To address these limitations, this paper introduces a novel detection solution called BinBcla. This method employs an enhanced pre-training model to generate instruction embeddings with dynamic semantics for binary functions. Subsequently, multi-feature fusion technique is utilized to extract local semantic information and long-distance global features from the code, respectively, employing self-attention to comprehend the structure information of the code. Finally, an improved cosine similarity method is employed to learn relationships among all elements of the distance vectors, thereby enhancing the model's robustness to new sample functions. Experiments are conducted across different architectures, compilers, and optimization levels. The results indicate that BinBcla achieves higher accuracy, precision and F1 score compared to existing methods. [ABSTRACT FROM AUTHOR]

The study of linear codes over local rings, particularly non-chain rings, imposes difficulties that differ from those encountered in codes over chain rings, and this stems from the fact that local non-chain rings are not principal ideal rings. In this paper, we present and successfully establish a new approach for linear codes of any finite length over local rings that are not necessarily chains. The main focus of this study is to produce generating characters, MacWilliams identities and generator matrices for codes over singleton local Frobenius rings of order 32. To do so, we first start by characterizing all singleton local rings of order 32 up to isomorphism. These rings happen to have strong connections to linear binary codes and Z 4 codes, which play a significant role in coding theory. [ABSTRACT FROM AUTHOR]

Many different aspects of software system development and verification rely on precise function identification in binary code. Recognition of the source Assembly functions in embedded systems is one of the fundamental challenges in binary program analysis. While numerous approaches assume that the functions are given a priori, correct identification of the functions in binaries remains a great issue. This contribution addresses the problem of uncertainty in binary code in identification of functions, which were optimized during compilation. This paper investigates the difference between debug and optimized functions via modeling of these functions. To do so, we introduce an extensible model-centred hands-on approach for examining similarities between binary functions. The main idea is to model each function using a set of predetermined, experimentally discovered features, and then find a suitable weight vector that could give impact factor to each such a feature. After finding the weight vector, the introduced models of such desired functions can be identified in binary software packages. It means that we reduce the similarity identification problem of the models to a classical version of optimization problems with one optimization criterion. Using our implementation, we found that the proposed approach works smoothly for functions, which contain at least ten Assembly instructions. Our tool guarantees success at a very high level. [ABSTRACT FROM AUTHOR]

Many families of binary nonlinear codes (e.g., Kerdock, Goethals, Delsarte–Goethals, Preparata) can be very simply constructed from linear codes over the Z 4 ring (ring of integers modulo 4), by applying the Gray map to the quaternary symbols. Generalized Kerdock codes represent an extension of classical Kerdock codes to the Z 2 S ring. In this paper, we develop two novel soft-input decoders, designed to exploit the unique structure of these codes. We introduce a novel soft-input ML decoding algorithm and a soft-input soft-output MAP decoding algorithm of generalized Kerdock codes, with a complexity of O (N S log 2 N) , where N is the length of the Z 2 S code, that is, the number of Z 2 S symbols in a codeword. Simulations show that our novel decoders outperform the classical lifting decoder in terms of error rate by some 5 dB. [ABSTRACT FROM AUTHOR]

How to model the effect of reflection is crucial for single image reflection removal (SIRR) task. Modern SIRR methods usually simplify the reflection formulation with the assumption of linear combination of a transmission layer and a reflection layer. However, the large variations in image content and the real-world picture-taking conditions often result in far more complex reflection. In this paper, we introduce a new screen-blur combination based on two important factors, namely the intensity and the blurriness of reflection, to better characterize the reflection formulation in SIRR. Specifically, we present Screen-blur Reflection Networks (SRNet), which executes the screen-blur formulation in its network design and adapts to the complex reflection on real scenes. Technically, SRNet consists of three components: a blended image generator, a reflection estimator and a reflection removal module. The image generator exploits the screen-blur combination to synthesize the training blended images. The reflection estimator learns the reflection layer and a blur degree that measures the level of blurriness for reflection. The reflection removal module further uses the blended image, blur degree and reflection layer to filter out the transmission layer in a cascaded manner. Superior results on three different SIRR methods are reported when generating the training data on the principle of the screen-blur combination. Moreover, extensive experiments on six datasets quantitatively and qualitatively demonstrate the efficacy of SRNet over the state-of-the-art methods. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel surface reconstruction method for unoriented points by establishing and solving a nonlinear equation system. By treating normals as unknown parameters and imposing the conditions that the implicit field is constant and its gradients parallel to the normals on the input point cloud, we establish a nonlinear equation system involving the oriented normals. To simplify the system, we transform it into a 0-1 integer programming problem solely focusing on orientation by incorporating inconsistent oriented normal information through PCA. We solve the simplified problem using flipping-based iterative algorithms and propose two novel criteria for flipping based on theoretical analysis. Extensive experiments on renowned datasets demonstrate that our flipping-based method with wavelet surface reconstruction achieves state-of-the-art results in orientation and reconstruction. Furthermore, it exhibits linear computational and storage complexity by leveraging the orthogonality and compact support properties of wavelet bases. The source code is available at https://github.com/mayueji/FISR_code. • We propose a novel surface reconstruction method by establishing and solving nonlinear equation systems numerically. • To tackle the nonlinear equation system, we innovatively propose the gradient-based criterion and value-based criterion. • Our method achieves state-of-the-art performance in orientation and reconstruction. Its linear complexity overcomes computational and storage bottlenecks. [ABSTRACT FROM AUTHOR]

Session-based recommendations (SBR) aim to predict the user's next choice of items based on historical data. It is hard to access the interaction information between users and we can only analyze the user's behavioral preferences based on the current session characteristics, which makes the recommendation task in this field quite challenging. Recently, considerable research has grown up around the theme of SBR. Previous works apply attention mechanisms and Graph Neural Networks (GNN) to achieve remarkable results. However, these methods ignore two main points: one is losing sight of the specific position of items in the session; the other is to drive global preference with local preference without considering the offset of the target preference among items in the session. This paper proposes a Global Target Preference Attention Network (GTPAN) Model with position information for the session-based recommendation. We introduce a position-aware embedding module to eliminate the effect of position missing. Considering that each item in the session is potentially rich in latent information of target preference, we use a target preference attention layer to learn the target preference vector of the session. Extensive experiments on three real datasets show that the proposed GTPAN model outperforms state-of-the-art session-based recommendation methods, especially on datasets with long sessions. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) has experienced phenomenal expansion over the past few years and has emerged as one of the most dynamic sectors of the international market. Android has become the driving force behind the rapid development of the IoT, and malware is one of the most severe concerns. Android is an open-source platform with a significant number of users. The identification of Android malware has become more critical in cybersecurity due to the meteoric rise of Android malware over the past few years and the severity of the damage it inflicts on smartphone users. Existing traditional Android malware detection methods based on machine learning have achieved encouraging performance. Still, the solution requires a massive workforce of feature engineering to build dynamic or static features and continuous learning through pre-extracted features to maintain high performance in identifying malware. Therefore, technologies for end-to-end malware detection without human interaction are necessary. In response to the rapid evolution of Android malware, a convolutional neural network that can acquire knowledge without requiring feature extraction is ideally suited. This paper offers a unique classification approach for malware based on a convolutional neural network, with feature extraction selected from the current pre-trained models DenseNet169, Xception, InceptionV3, ResNet50, and VGG16. The proposed methods have an advantage over existing detection methods due to their end-to-end learning process. Our suggested approaches convert Android APK files to binary codes and RGB images for usage as inputs to deep learning models. These models are trained and evaluated using the CICInvesAndMal2019 dataset, which consists of 333 benign and 428 malicious applications. Experiments demonstrate that the proposed approaches achieve a classification accuracy of 95.24%, 95.24%, and 95.83% for DenseNet169, InceptionV3, and VGG16, respectively, on a 761-sample dataset of malware, which is superior to other compared algorithms. Compared to previous methods, our suggested methods are more applicable to Android IoT devices since they do not require manual feature engineering and consume fewer resources. [ABSTRACT FROM AUTHOR]