{"title":"Tripod: Use Data Augmentation to Enhance Website Fingerprinting","authors":"Yixi Zhang, Xueliang Sun, Xiang Qin, Chaoran Li, Siwei Wang, Yi Xie","doi":"10.1109/ISCC53001.2021.9631528","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631528","url":null,"abstract":"Website Fingerprinting (WF) enables a passive adversary to identify the website a user is visiting, even when the web access adopts security or privacy technologies. WF attacks based on deep learning are highly effective when feeding sufficient training traces, for example, hundreds of traffic traces of accessing each website. However, collecting extensive traffic consumes much time and resources, degenerating WF attacks' timeliness and invisibility. Nevertheless, decreasing training traces dramatically drops the WF accuracy. This paper proposes Tripod, a novel data augmentation method to enhance WF attacks, making them effective with a small training set. It applies three packet manipulations (Injecting, Removing, and Losing) on one collected traffic trace to generate several augmented traces. WF attacks then use the website classifier trained by the augmented set of all traces. In the closed-world scenario, the Var-CNN attack with 20 training traces per website only correctly identifies 56.1% of websites, while Tripod significantly increases this accuracy to 95.9%. Furthermore, Tripod increases the true positive rate of Var-CNN from 26.9% to 91.4% in the more realistic open-world scenario.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"133 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125799154","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Mobile Augmented Reality for Craniotomy Planning","authors":"M. Alves, Daniel Oliveira Dantas","doi":"10.1109/ISCC53001.2021.9631438","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631438","url":null,"abstract":"Augmented reality (AR) neuronavigation has been proposed to address the shortcomings of conventional neuron-avigators. Researchers have presented low-cost AR methods for craniotomy planning, but they lack navigation capabilities. Other studies introduce AR neuronavigation systems that are a step further in usability than traditional neuronavigators, but they may be hard to obtain or reproduce. AR neuronavigation was also implemented on mobile devices, but most systems have an undesired lag during the navigation. This work investigates the feasibility of creating an accurate and low-cost standalone mobile AR neuronavigator. Unlike other mobile approaches, this solution has no perceptible lag as the processing is efficiently performed on the device instead of an external computer. Results show that a neuronavigation system can be deployed on a mobile device, running smoothly at 60 frames per second, and achieving a smaller than 5 mm target registration error.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128445746","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Gustavo Pantuza, Lucas A. C. Bleme, M. Vieira, L. Vieira
{"title":"Danian: tail latency reduction of networking application through an O(1) scheduler","authors":"Gustavo Pantuza, Lucas A. C. Bleme, M. Vieira, L. Vieira","doi":"10.1109/ISCC53001.2021.9631451","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631451","url":null,"abstract":"Core allocation for application threads is a problem of reasonable complexity and computational cost inside Unix systems. Caladan scheduler is a solution aiming to reduce the cost of how threads and cores are allocated in microsecond scale. The Danian system optimizes through memoization the thread picking algorithm that picks the best thread for a given core. Such improvements have direct impact on applications distributed across networks on a data center. Thread picking operation cost dropped from O(n) to O(1), the CPU time reduced 7%, the tail latency reduced 3% on Caladan Synthetic experiment and 5% on the Netperf experiment.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127298345","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Deep Quantile Regression for QoT Inference and Confident Decision Making","authors":"T. Panayiotou, Hafsa Maryam, G. Ellinas","doi":"10.1109/ISCC53001.2021.9631468","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631468","url":null,"abstract":"This work examines deep quantile regression for quality-of-transmission (QoT) estimation and accurate decision making in optical networks. Quantile regression is applied to approximate QoT models capable of inferring QoT bounds for any future lightpath, according to a predefined level of certainty, for confident decision making, without the need to consider traditional margins at decision time. It is shown, that quantile regression automatically accounts for such margins, in a discriminative fashion, leading to a significant margin reduction and subsequently to more accurate inference of the QoT of unestablished lightpaths, when compared to the traditional margin-based decision approaches. Specifically, deep quantile regression for QoT estimation ensures that lightpaths with insufficient QoT will be accurately identified and rejected, while also identifying correctly lightpaths with sufficient QoT, making it a confident decision making tool for the planning of optical networks.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133722520","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Scalability of Hash-Based Pattern Matching for High-Speed Network Security and Monitoring","authors":"Tomás Fukac, J. Korenek, J. Matoušek","doi":"10.1109/ISCC53001.2021.9631447","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631447","url":null,"abstract":"Gradually increasing throughput of high-speed networks puts continuous pressure on the performance of operations over a stream of network data. Probably the most affected operation in the area of network security and monitoring is pattern matching, which is in the core of widely deployed intrusion detection systems (IDSes) like Snort, Suricata and Bro. This paper therefore proposes several optimizations of a hash-based pattern matching architecture that together allow to increase its throughput to 100 Gbps and beyond. Proposed optimizations target an interconnection network between parallel hash function engines and independent memory blocks addressed by hashes computed over short strings of input data. Specifically, the optimizations reduce resource utilization by sharing parts of the full interconnection network among its several outputs and lower collision rate in these shared parts by aggregation and distributed buffering of memory access requests. The optimized pattern matching architecture is therefore able to utilize a higher number of parallel hash functions, each of which can use the interconnection network to access any memory block. This allows not only to increase the throughput of a key component within IDSes to more than 100 Gbps, but also to support a larger set of network threat patterns and to update this set dynamically.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132998544","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Self-Sovereign Decentralized Identity Platform Based on Blockchain","authors":"Ya Chen, Chao Liu, Yu Wang, Yazhe Wang","doi":"10.1109/ISCC53001.2021.9631518","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631518","url":null,"abstract":"Traditional accounts and passwords mechanism usually needs to register multiple accounts for adopting different scenarios, which makes it difficult to manage passwords and handle privacy leakage issues. On the other hand, users have no real control over their identities under centralized trusted authorities or insecure third-party operators. In this paper, we propose a self-sovereign decentralized identity platform called SSIChain. SSIChain uses distributed infrastructure blockchain to replace authorities and third-party operators. In the proposed platform, the DID and a credential represent an user's digital identity. We define DID chaincode and credential protocol to cover the full lifecycle of a user's digital identity. We build a complete consortium blockchain and application environment, and implement a prototype as an App for Android-based phones. Moreover, we detect that SSIChain only takes at most 2.1 seconds for authentication with high TPS, which can meet users' demands for identity management well.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133143513","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"FastHorovod: Expediting Parallel Message-Passing Schedule for Distributed DNN Training","authors":"Yanghai Wang, Dezun Dong, Yemao Xu, Shuo Ouyang, Xiangke Liao","doi":"10.1109/ISCC53001.2021.9631443","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631443","url":null,"abstract":"Large-scale deep neural networks training have been widely deployed on dense-GPU public cloud clusters. Intensive communication and synchronization cost for gradients and parameters is becoming the bottleneck of distributed deep learning training. Horovod is one of the most popular distributed communication frameworks to address the scale-out issue of deep learning training on GPU clusters. Existing public-cloud GPU datacenters, such as Amazon EC2 and Alibaba GPU cloud, are usually equipped with commodity high-speed Ethernet and TCP networking. In current vanilla Horovod, however, we observe that one GPU device is merely associated with at most one proxy communication process. The proxy process is responsible for dealing with all the communication operations of parameter all-reduce for one or multiple GPUs. Such configuration makes communication interface based on TCP protocols suffer from limited network goodput and incur training performance penalties. In this paper, we make the first attempt to improve the message passing interface of Horovod and address the mismatching between the computation and communication capability when deploying Horovod in TCP-based public-cloud GPU clusters. We propose FastHorovod to exploit more cost-efficient auxiliary communication processes on CPU to expedite parallel message-passing schedule for GPU. We conduct extensive experiments against state-of-the-art Horovod. The experiment results show that our design can significantly accelerate the distributed training communication on TCP-based public-cloud GPU clusters, and FastHorovod improves the training speed of AlexNet and VGG16 models by 64.5% and 72.6% respectively.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131336819","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Effective and Efficient Method for Word-Level Textual Adversarial Attack","authors":"Zhixin Shi, Yuru Ma, Xiaoyan Yu","doi":"10.1109/ISCC53001.2021.9631472","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631472","url":null,"abstract":"Adversarial examples are used to reveal the vulnerability of deep neural networks (DNNs) and improve their robustness. The word-level attack is a well-studied class of textual adversarial attack methods. However, existing word-level attacks have unstable success rates in different application scenarios. And the attacks under black-box setting suffer from low efficiency because they need to query the target DNN model with a great quantity. In this paper, we present SynonymPSO, a word-level attack method for generating adversarial texts. Specifically, we use a variety of means to find and filter synonyms to construct a comprehensive candidate pool. Besides, we design a kind of modification record strategy to improve the efficiency of the particle swarm optimization algorithm. Compared with prior works, SynonymPSO has the following features: (1) effective - it outperforms the state-of-art attacks in terms of attack success rate on most occasions; (2) efficient - it generates adversarial examples with fewer queries and less time. We evaluate SynonymPSO on five datasets that belong to different text classification tasks, including sentiment analysis, natural language inference and spam detection. The experimental results demonstrate its effectiveness and efficiency. For instance, when attacking BiLSTM over Enron dataset, the attack success rate of our method is 20% higher than the baseline while the query number is reduced by 94%.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131365650","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
John Violos, Stylianos Tsanakas, T. Theodoropoulos, Aris Leivadeas, K. Tserpes, T. Varvarigou
{"title":"Hypertuming GRU Neural Networks for Edge Resource Usage Prediction","authors":"John Violos, Stylianos Tsanakas, T. Theodoropoulos, Aris Leivadeas, K. Tserpes, T. Varvarigou","doi":"10.1109/ISCC53001.2021.9631548","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631548","url":null,"abstract":"The proliferation of Internet of Things (IoT) and edge devices constitute important an efficient orchestration of the edge computing infrastructures, calling the providers to rethink their decision making methods. The resource usage prediction can be a prominent source of information for adaptive resource allocation and task offloading. In this research, we propose a Gated Recurrent Neural Network multi-output regression model that leverage time series resource usage metrics. The edge computing infrastructures are characterized as dynamical and heterogeneous environments. This motivated us to propose the innovative Hybrid Bayesian Evolutionary Strategy (HBES) algorithm for automated adaptation of the resource usage models in order to to enhance the generality of our approach. The proposed resource usage prediction mechanism has been experimentally evaluated and compared with other state of the art methods with significant improvements in terms of RMSE and MAE.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129266507","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jixin Zhao, Shukui Zhang, Yang Zhang, Li Zhang, Hao Long
{"title":"Deep Reinforcement Learning-Based Routing Optimization Algorithm for Edge Data Center","authors":"Jixin Zhao, Shukui Zhang, Yang Zhang, Li Zhang, Hao Long","doi":"10.1109/ISCC53001.2021.9631254","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631254","url":null,"abstract":"Mobile Edge Computing (MEC) has solved a sharp increase in data volume caused by various emerging network applications. The edge data center is an essential part of MEC, which connects the edge of the network and the backbone network. Faced with a complex network environment, edge data centers suffer low bandwidth resource utilization and high network latency. This paper proposes Twin Delayed Deep Deterministic policy gradient based Routing Optimization (TRO) algorithm to improve the performance of edge data centers. The TRO algorithm uses Deep Reinforcement Learning (DRL) and Software-Defined Networking (SDN) to achieve routing optimization from two aspects of bandwidth utilization and load balancing. Experiments demonstrate that compared with other algorithms, the TRO algorithm proposed in this paper significantly improves network throughput and reduces average packet latency and average packet latency error.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123639943","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}