Message passing neural networks such as graph convolutional networks (GCN) can jointly consider various types of features for social bot detection. However, the expressive power of GCN is upper-bounded by the 1st-order Weisfeiler–Leman isomorphism test, which limits the detection performance for the social bots. In this paper, we propose a subgraph encoding based GCN model, SEGCN, with stronger expressive power for social bot detection. Each node representation of this model is computed as the encoding of a surrounding induced subgraph rather than encoding of immediate neighbors only. Extensive experimental results on two publicly available datasets, Twibot-20 and Twibot-22, showed that the proposed model improves the accuracy of the state-of-the-art social bot detection models by around 2.4%, 3.1%, respectively.

The excellent cover estimation is very important to the payload location of JPEG image steganography. But it is still hard to exactly estimate the quantized DCT coefficients in cover JPEG image. Therefore, this paper proposes a JPEG image steganography payload location method based on optimal estimation of cover co-frequency sub-image, which estimates the cover JPEG image based on the Markov model of co-frequency sub-image. The proposed method combines the coefficients of the same position in each 8 × 8 block in the JPEG image to obtain 64 co-frequency sub-images and then uses the maximum a posterior (MAP) probability algorithm to find the optimal estimations of cover co-frequency sub-images by the Markov model. Then, the residual of each DCT coefficient is obtained by computing the absolute difference between it and the estimated cover version of it, and the average residual over coefficients in the same position of multiple stego images embedded along the same path is used to estimate the stego position. The experimental results show that the proposed payload location method can significantly improve the locating accuracy of the stego positions in low frequencies.

Traditional steganography methods are usually designed on a lossless channel; thus, messages are often not extracted correctly from an image transmitted over a lossy channel that includes attacks such as scaling. To address this issue, in recent years, the field of robust steganography has emerged. In this paper, the process of image scaling by interpolation is first observed and serves as the basis for proposing the idea of inverse interpolation. Subsequently, the idea of constructing an inverse interpolation equation set is proposed to solve the problem of intersectional blocks during the inverse interpolation process. Then, the scaling factor’s valid range of inverse interpolation is analyzed. Next, the inverse interpolation is successfully applied in robust image steganography. A method that combines antiscaling and antidetection is proposed. Afterward, actual tests on the top 9 mobile phone brands with 28 models and 2 social communication apps that are currently popular in China are done. The scaling factor’s valid range of the proposed method is verified to match the actual lossy channel. The experimental results show that the proposed method achieves a reliable extraction of embedded messages for common interpolation scaling attacks while maintaining high statistical detection resistance.