John Beerman, David Berent, Zach Falter, S. Bhunia
{"title":"A Review of Colonial Pipeline Ransomware Attack","authors":"John Beerman, David Berent, Zach Falter, S. Bhunia","doi":"10.1109/CCGridW59191.2023.00017","DOIUrl":"https://doi.org/10.1109/CCGridW59191.2023.00017","url":null,"abstract":"In April, 2021 a ransomware attack occurred on Colonial Pipeline. The details of this attack point to the hacking group DarkSide taking advantage of the design flaws in the Colonial Pipeline network. After extensive research, the specificity of this attack was related to VPN access through an unused account. In order to regain control of their systems, Colonial Pipeline paid the attackers. This act has only created an incentive for similar attacks across the nation. The events of this attack have impacted both the United States, where the company is located and the world in a very negative way. This paper analyzes the attack with published data and provides a detailed attack methodology. From the attack methodology the focus then shifts into the impacts that an attack of this caliber had, on both the company, the United States, and the world. We then outline possible defense strategies against this type of ransomware attack, analyzing what could have been done to prevent this attack from happening. In addition, we also detail how companies can prevent future attacks of this caliber. Finally we wrap up or findings and detail the key takeaways of the entire attack.","PeriodicalId":341115,"journal":{"name":"2023 IEEE/ACM 23rd International Symposium on Cluster, Cloud and Internet Computing Workshops (CCGridW)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114645111","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":"Securing Multi-IRS Aided mmWave Communications Against Eavesdropping and Jamming in Vehicular Cyber Physical Systems","authors":"Reham Alsabet, D. Rawat","doi":"10.1109/CCGridW59191.2023.00019","DOIUrl":"https://doi.org/10.1109/CCGridW59191.2023.00019","url":null,"abstract":"Intelligent transportation systems (ITS) will be dependent on inter-vehicle communication technology to run systems responsible for road safety, traffic flow, information and entertainment. As with standard communication systems, vehicle communication systems may be abused or attacked in ways that could compromise the transport systems and the security of drivers and their vehicles. Millimeter Wave (mmWave) communications are anticipated to play a significant part in this communication. This paper investigates securing the communications with mmWave by employing physical layer security through several Intelligent Reflecting Surfaces(IRSs) to secure communication network from both eavesdropping and jamming attacks. By utilizing multiple IRSs to generate numerous links of transmission among a receiver user and a number of base station antennas in the existence of a single eavesdropper and jammer. By optimizing both the phase shifts at passive IRSs beamforming and the active beamforming at the base station, we were able to boost the secrecy rate over multiple intelligent reflecting surfaces networks functioning in the mmWave radio spectrum. However, because the specified issue is non-convex, we provide an efficient approach that relies on alternating optimization to achieve a suboptimal solution. The outcomes of this study highlighted the benefits of leveraging several IRSs in the mmWave system to enhance the rate of security. Additionally, it was found out that IRS can be proposed to assist jammers in attacking legal users without requiring any internal energy to generate jamming signals, while eavesdropping can mitigate the harmful effects of jamming. The proposed strategy can successfully raise the secrecy rate of legitimate users by jamming the eavesdropper with multiple IRSs in mmWave networks, according to simulation results.","PeriodicalId":341115,"journal":{"name":"2023 IEEE/ACM 23rd International Symposium on Cluster, Cloud and Internet Computing Workshops (CCGridW)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125138909","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":"STP CPS Committee Members","authors":"","doi":"10.1109/ccgridw59191.2023.00008","DOIUrl":"https://doi.org/10.1109/ccgridw59191.2023.00008","url":null,"abstract":"","PeriodicalId":341115,"journal":{"name":"2023 IEEE/ACM 23rd International Symposium on Cluster, Cloud and Internet Computing Workshops (CCGridW)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116155428","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":"SAS-UNet: Modified encoder-decoder network for the segmentation of obscenity in images","authors":"Sonali Samal, T. Gadekallu, Pankaj Rajput, Yu-dong Zhang, Bunil Kumar Balabantaray","doi":"10.1109/CCGridW59191.2023.00022","DOIUrl":"https://doi.org/10.1109/CCGridW59191.2023.00022","url":null,"abstract":"Obscene content on online platforms can be harmful to society in several ways. Firstly, it can negatively impact the mental health of individuals who view or are exposed to it, particularly children and vulnerable individuals. Secondly, it can lead to the spread of illegal content such as child pornography or revenge porn, which can cause significant harm to the victims involved. Lastly, it can create a toxic and unsafe online environment, where cyberbullying, harassment, and hate speech thrive, ultimately leading to social division and harm to the community. As a result, it is important to promote the responsible and respectful use of online platforms to prevent such harm. Therefore, it is important to segment such obscene regions present in images across social media platforms. To deal with the issue, we have proposed a modified encoder-decoder-based technique entitled sandglass-block encoder with attention skip and swin-based bottleneck (SAS-UNet) for the segmentation of obscenity in nude/obscene images. Our proposed method SASUNet incorporates the usage of a sandglass block in the encoder section of U-Net, a swin transformer in the bottleneck, and CBAM inclusion at the skip connection. The proposed model is trained and validated with the segmented obscene image (SOI) dataset. The collected obscene images were segmented precisely to build a binary mask of all the obscene images. The proposed SAS-UNet achieved a precision of 94.30%, 93.22% recall, 92.31% of mDC value, and 91.42% of mIOU value which outperformed the existing algorithms.","PeriodicalId":341115,"journal":{"name":"2023 IEEE/ACM 23rd International Symposium on Cluster, Cloud and Internet Computing Workshops (CCGridW)","volume":"188 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116394627","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":"Highly Scalable Large-Scale Asynchronous Graph Processing using Actors","authors":"Youssef Elmougy, Akihiro Hayashi, Vivek Sarkar","doi":"10.1109/CCGridW59191.2023.00049","DOIUrl":"https://doi.org/10.1109/CCGridW59191.2023.00049","url":null,"abstract":"With the accelerating growth of Big Data, real-world graph processing applications now need to tackle graphs with billions of vertices and trillions of edges, thereby increasing the demand for effective solutions to application scalability. Unfortunately, current approaches to implementing these applications on modern HPC systems exhibit poor scale-out performance with increasing numbers of nodes. The scalability challenges for these applications are driven by large data sizes, synchronization overheads, and fine-grained communications with irregular data accesses and poor locality. This paper presents the scalability of a novel Actor-based programming system, which provides a lightweight runtime that supports fine-grained asynchronous execution and automatic message aggregation atop a Partitioned Global Address Space (PGAS) communication layer. Evaluations of the Jaccard Index and PageRank applications on the NERSC Perlmutter system demonstrate nearly perfect scaling up to 1,000 nodes and 64K cores (one-third of the targeted 3000-nodes for Perlmutter). In addition, our Actor-based implementations of Jaccard Index and PageRank executed with parallel efficiencies of 85.7% and 63.4% for the largest run of 64K cores. This performance represents a 29.6 × speedup relative to UPC and OpenSHMEM versions of PageRank.","PeriodicalId":341115,"journal":{"name":"2023 IEEE/ACM 23rd International Symposium on Cluster, Cloud and Internet Computing Workshops (CCGridW)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117230974","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":"Early Career and Students Showcase Committee Members","authors":"","doi":"10.1109/ccgridw59191.2023.00015","DOIUrl":"https://doi.org/10.1109/ccgridw59191.2023.00015","url":null,"abstract":"","PeriodicalId":341115,"journal":{"name":"2023 IEEE/ACM 23rd International Symposium on Cluster, Cloud and Internet Computing Workshops (CCGridW)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129654083","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}
Varad Kulkarni, Ruchi Bhoot, Animesh Baranawal, Yogesh L. Simmhan
{"title":"Enhancing Interval-centric Distributed Computing to Support Incremental Graphs","authors":"Varad Kulkarni, Ruchi Bhoot, Animesh Baranawal, Yogesh L. Simmhan","doi":"10.1109/CCGridW59191.2023.00072","DOIUrl":"https://doi.org/10.1109/CCGridW59191.2023.00072","url":null,"abstract":"Real-world graphs like social networks, fintech transactions and the World Wide Web (WWW) are dynamic in nature, and have addition and deletion of vertices and edges. The Interval-centric model (ICM) was proposed to intuitively design and execute distributed algorithms over temporal graphs having a lifespan on vertices, edges and their attributes. The temporal graphs are available a priori. The Windowed ICM (WICM) model further optimized its performance by avoiding the loading of the entire temporal graph in-memory. Here, we extend the WICM model to incrementally operate on dynamic graphs whose vertex and edge updates arrive over time. We achieve this by decoupling the receipt and application of updates to the temporal graph, and the computation on the graph using 3 strategies – JITM, DITM and AITM. We compare our results with the native WICM and strawman baseline. Our evaluation on the Reddit graph shows $approx 40$% better performance without compromising on correctness","PeriodicalId":341115,"journal":{"name":"2023 IEEE/ACM 23rd International Symposium on Cluster, Cloud and Internet Computing Workshops (CCGridW)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127546259","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":"Performance Modelling of Graph Neural Networks","authors":"Pranjal Naman, Yogesh L. Simmhan","doi":"10.1109/CCGridW59191.2023.00076","DOIUrl":"https://doi.org/10.1109/CCGridW59191.2023.00076","url":null,"abstract":"Recent years have witnessed a rapid rise in the popularity of Graph Neural Networks (GNNs) that address a wide variety of domains using different architectures. However, as relevant graph datasets become diverse in size, sparsity and features, it becomes important to quantify the effect of different graph properties on the training time for different GNN architectures. This will allow us to design compute-aware GNN architectures for specific problems, and further extend this for distributed training. In this paper, we formulate the calculation of the Floating Point Operations (FLOPs) required for a single forward pass through layers of a GNN. We report the analytical calculations for GraphConv and GraphSAGE models and compare against their profiling results for 10 graphs with varying properties. We observe that there is a strong correlation between our theoretical expectation of the number of FLOPs and the experimental execution time for a forward pass.","PeriodicalId":341115,"journal":{"name":"2023 IEEE/ACM 23rd International Symposium on Cluster, Cloud and Internet Computing Workshops (CCGridW)","volume":"54 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113988969","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":"Distributed In-band Network Telemetry","authors":"Dhyey Thummar, Iram Nawab, Sameer G. Kulkarni","doi":"10.1109/CCGridW59191.2023.00060","DOIUrl":"https://doi.org/10.1109/CCGridW59191.2023.00060","url":null,"abstract":"Modern-day networks are becoming bigger and more complex as the days go by. Thus, network telemetry plays a critical role in modern networking. One of the approaches has been In-band network telemetry (INT) which relies on the usage of network data packets to collect the data plane state without the need for separate control or data channels. This benefits to provide real-time and accurate network monitoring. The traditional in-band telemetry techniques usually incur significant overheads to the large packet size (INT meta-data) and redundant computation/processing at each switch for the marked packets. To address the limitations of traditional in-band network telemetry, we propose a hierarchically distributed INT that leverages the logically centralized control plane, such as Software Defined Networking (SDN), to distribute INT processing and analysis components across multiple switches, providing scalable and efficient network monitoring capabilities.","PeriodicalId":341115,"journal":{"name":"2023 IEEE/ACM 23rd International Symposium on Cluster, Cloud and Internet Computing Workshops (CCGridW)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131853208","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}