25 September 2023 in IEEE Transactions on Information Forensics and Security
Website Fingerprinting (WF) is a network traffic mining technique for anonymous traffic identification, which enables a local adversary to identify the target website that an anonymous network user is browsing. WF attacks based on deep convolutional neural networks (CNN) get the state-of-the-art anonymous traffic classification performance. However, due to the locality restriction of CNN architecture for feature extraction on sequence data, these methods ignore the temporal feature extraction in the anonymous traffic analysis. In this paper, we present Website Fingerprinting Transformer (WF-Transformer), a novel anonymous network traffic analysis method that leverages Transformer networks for temporal feature extraction of traffic traces and improves the classification performance of Tor encrypted traffic. The architecture of WF-Transformer is specially designed for traffic trace processing and can classify anonymous traffic effectively. Furthermore, we evaluate the performance of WF-Transformer in both closed-world and open-world scenarios. In the closed-world scenario, WF-Transformer attains 99.1% accuracy on Tor traffic without defenses, better than state-or-the-art attacks, and archives 92.1% accuracy on the traces defended by WTF-PAD method. In the open-world scenario, WF-Transformer has better precision and recall on both defended and non-defended traces. Furthermore, WF-Transformer with a short input length (2000 cells) outperforms the DF method with a long input length (5000 cells).
21 April 2023 in Computer Networks
14 August 2019 in IEEE Access
Clustering methods based on deep neural networks have been extensively studied and applied in data mining. Most existing unsupervised deep embedded clustering methods jointly learn feature representations and cluster assignments with deep neural networks. However, to the best of our knowledge, most of them ignore the relevance between representation learning and clustering, so that fail to couple feature representation learning and cluster assignments effectively, which leads to non-representative features for clustering and this in turn hurts clustering performance. In this paper, we propose Adversarial Deep Embedded Clustering (ADEC), a novel unsupervised clustering method based on adversarial auto-encoder (AAE) and $k$ -means clustering method. Specifically, ADEC matches distribution of feature representations with the given prior distribution to preserve the data structure with AAE, and $k$ -means based on distribution distance metrics is conducted for clustering with these feature representations, simultaneously. ADEC optimizes a clustering objective iteratively with backpropagation algorithm in learning AAE from data space to feature space. Extensive experiments have demonstrated the effectiveness of our proposed method on images clustering compared to several strong baseline methods.
24 November 2020 in Neural Computing and Applications
5 November 2024 in Expert Systems with Applications
25 October 2019 in IET Computer Vision
Deep learning is a powerful tool for domain adaptation by learning robust high‐level domain invariant representations. Recently, adversarial domain adaptation models are applied to learn representations with adversarial training manners in feature space. However, existing models often ignore the generation process for domain adaptation. To tackle this problem, deep cycle autoencoder (DCA) is proposed that integrates a generation procedure into the adversarial adaptation methods. The proposed DCA consists of four parts, a shared encoder, two separated decoders, a discriminator and a linear classifier. With the labelled source images and unlabelled target images as inputs, the encoder extracts high‐level representations for both source and target domains, and the two decoders reconstruct the inputs with the latent representations separately. The shared encoder is pitted against the discriminator; the encoder tries to confuse the discriminator while discriminator aims at distinguishing which domain the latent representations come from. DCA adopts both adversarial loss and maximum mean discrepancy loss in the latent space for distribution alignment. The classifier is trained with both the source original and reconstructed image representations. Extensive experimental results have demonstrated the effectiveness and the reliability of the proposed methods.