{"title":"Hyperledger based Verifiable and Secure Cloud Data Deletion","authors":"Srijita Basu, Shubhasri Roy, Debasish Bera, Sandip Karmakar","doi":"10.1109/INFOCOMWKSHPS57453.2023.10226125","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS57453.2023.10226125","url":null,"abstract":"In today's era of diversified computational advancements, cloud computing and its application have become an inevitable part of the industry and academia. Chunks of data are stored and removed everyday from the cloud instances. Any remaining trace of this deleted data may lead to illicit data leakage. Cloud Service Consumers (CSC)/users mostly depend on third-party auditors (TPA)/verification systems for guaranteeing that their data has been completely deleted from the cloud premises once their mutual service tenure ends. In this paper, blockchain technology is used to provide an authentication and verification platform for executing a secured and complete removal of user data from Cloud Service Provider (CSP) premises and providing a proof for the same. The Elliptic Curve Digital Signature Algorithm (ECDSA) signature scheme has been integrated into the existing hyperledger fabric framework to achieve the required results. A performance analysis based on hyperledger caliper is presented. It manifests a negligible performance overhead of 13% due to the additional ECDSA layer. Additionally, the comparative study shows the benefits of TPA independence, deletion request authentication and user identity management which makes the proposed scheme, a more secure and trustworthy datacenter design option as compared to contemporary solutions.","PeriodicalId":354290,"journal":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130338504","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":"Trajectory Design for Unmanned Aerial Vehicles via Meta-Reinforcement Learning","authors":"Ziyang Lu, Xueyuan Wang, M. C. Gursoy","doi":"10.1109/INFOCOMWKSHPS57453.2023.10226090","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS57453.2023.10226090","url":null,"abstract":"This paper considers the trajectory design problem for unmanned aerial vehicles (UAVs) via meta-reinforcement learning. It is assumed that the UAV can move in different directions to explore a specific area and collect data from the ground nodes (GNs) located in the area. The goal of the UAV is to reach the destination and maximize the total data collected during the flight on the trajectory while avoiding collisions with other UAVs. In the literature on UAV trajectory designs, vanilla learning algorithms are typically used to train a task-specific model, and provide near-optimal solutions for a specific spatial distribution of the GNs. However, this approach requires retraining from scratch when the locations of the GNs vary. In this work, we propose a meta reinforcement learning framework that incorporates the method of Model-Agnostic Meta-Learning (MAML). Instead of training task-specific models, we train a common initialization for different distributions of GNs and different channel conditions. From the initialization, only a few gradient descents are required for adapting to different tasks with different GN distributions and channel conditions. Additionally, we also explore when the proposed MAML framework is preferred and can outperform the compared algorithms.","PeriodicalId":354290,"journal":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"533 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114058541","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}
Wiktor Sedkowski, Rakshesh P. Bhatt, Clifton Fernandes, Kodandram Ranganath
{"title":"Vulnerability Exploit Pattern Generation and Analysis for proactive security risk mitigation for 5G networks","authors":"Wiktor Sedkowski, Rakshesh P. Bhatt, Clifton Fernandes, Kodandram Ranganath","doi":"10.1109/INFOCOMWKSHPS57453.2023.10225912","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS57453.2023.10225912","url":null,"abstract":"This paper presents a proactive intelligent mechanism to detect possible variants of known vulnerability exploits being attempted on any component of wireless networks. Vulnerability Exploit Pattern Analyzer presented in this paper can prevent possible zero-day attacks by learning from the available known exploits from published databases. There have been incidents like WannaCry ransomware attack, where a known Operating Systems vulnerability was exploited sometime after it was published, and even the patches were available in public. In 5G wireless networks, the number of network functions and devices are expected to be in millions. For most of the CVEs published, different exploits are also published, and available in online databases like Exploit DB. It is likely that attackers take such exploits, manipulate them to create different variants of such exploits and launch attacks on networks. For example, https://www.exploit-db.com/has more than 8000 exploits published only for SQL injection kind of vulnerabilities. Older vulnerability exploits can inspire creation of newer ones for other products. 5G and future wireless networks having service-based architecture at the core will require more proactive approaches to predict any misuse of emerging or manipulated variants of known exploits. This paper proposes one possible solution for the same and presents results from experiments done using patterns generated from a remote command injection vulnerability exploit.","PeriodicalId":354290,"journal":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114236438","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}
Sammy Yap Xiang Bang, S. M. Raza, Hui-Lin Yang, Hyunseung Choo
{"title":"EMP-GAN: Encoder-Decoder Generative Adversarial Network for Mobility Prediction","authors":"Sammy Yap Xiang Bang, S. M. Raza, Hui-Lin Yang, Hyunseung Choo","doi":"10.1109/INFOCOMWKSHPS57453.2023.10226163","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS57453.2023.10226163","url":null,"abstract":"Ultra-dense cell deployments in Beyond 5G and 6G result in extensive overlapping between cells. This makes current reactive handover mechanism inadequate due to availability of multiple strong signals at a position. Moreover, recently proposed predictive mobility management schemes are also not suitable as they may lead to unnecessary handovers. A predictive path-based mobility management scheme can solve these issues, but forecasting User Equipment (UE) paths with high accuracy is a challenging task. This paper proposes Encoder-Decoder Generative Adversarial Network (EMP-GAN) for forecasting multi-step ahead UE path. EMP-GAN architecture consists of generator and discriminator neural networks, where the generator predicts mobility (next multi-step target sequence) and the discriminator classifies between the predicted target sequence and the ground truth in adversarial learning. Besides adversarial learning, feature matching and fact forcing training methods are employed for fast convergence of GAN and performance improvement. EMP-GAN is evaluated on mobility dataset collected from the wireless network of Pangyo ICT Research Center, Korea, and results show that it outperforms state-of-the-art prediction models. In particular, EMP-GAN achieves 95.55%, 94.70%, 93.50%, and 92.39% accuracies for 3, 5, 7, and 9-step predictions, respectively.","PeriodicalId":354290,"journal":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124755403","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":"INFOCOM 2023 FOGML: The Second International IEEE INFOCOM Workshop on Distributed Machine Learning and Fog Networks","authors":"","doi":"10.1109/infocomwkshps57453.2023.10225888","DOIUrl":"https://doi.org/10.1109/infocomwkshps57453.2023.10225888","url":null,"abstract":"","PeriodicalId":354290,"journal":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129588933","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":"Enabling Security Research Through Efficient Partial Deployment Topology Configuration and Validation","authors":"Bashayer Alharbi, K. Olson, Eric Keller","doi":"10.1109/INFOCOMWKSHPS57453.2023.10226052","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS57453.2023.10226052","url":null,"abstract":"How to measure security value in partial deployments has long been a consideration for the Internet research community. Without clear security outcomes, adoption of security mechanisms may take years before users begin to see any benefit. This lack of clarity can serve to further delay adoption as incentives to implement are often outweighed by additional costs or complexity. While prior efforts have looked at theoretical approaches to estimate this critical mass of partial deployment within a topology, no effort has been able to effectively simulate and measure such an outcome. In this work, we provide an early effort to demonstrate how topology simulation can be used to effectively deploy and measure partial deployments of RPKI utilizing the SEED Internet Emulator. Our efforts show that this approach can be used to simulate large networks and provide an effective means to measure partial deployment value of security protocol deployments. Further, we demonstrate that adoption rates of greater than fifty percent begin to show exponential return on security outcomes for both adopters and non-adopters alike.","PeriodicalId":354290,"journal":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124556317","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}
Marco Silva, João Fonseca, D. Abreu, Paulo Romero Martins Maciel, Paulo Duarte, Raul Barbosa, Bruno Mendes, J. Silva, A. A. Góes, Marco Araújo, B. Sousa, M. Curado, José Santos
{"title":"O-RAN and RIC Compliant Solutions for Next Generation Networks","authors":"Marco Silva, João Fonseca, D. Abreu, Paulo Romero Martins Maciel, Paulo Duarte, Raul Barbosa, Bruno Mendes, J. Silva, A. A. Góes, Marco Araújo, B. Sousa, M. Curado, José Santos","doi":"10.1109/INFOCOMWKSHPS57453.2023.10225994","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS57453.2023.10225994","url":null,"abstract":"The Radio Access Network (RAN) is undergoing deep changes in the transition to beyond 5G systems. The Open-Radio Access Network (O-RAN) alliance aims to split the RAN architecture and support heterogeneity. At the same time, Open-Source Software (OSS) solutions like OpenAirInterface and srsRAN initiatives attempt to incorporate several stake-holders. This work proposes an End-to-End (E2E) orchestration framework using OSS solutions that are O-RAN compliant. A high-level architecture is presented focused on the RAN Intelligent Controller (RIC): the connection between Near-Real Time RAN Intelligent Controller (Near-RT RIC) with Service Management and Orchestration via the A1 interface and the connection with O-RAN Network Functions (E2 Nodes) via the E2 interface. The proposed architecture was validated on an experimental prototype. The main results compare state of the art OSS solutions status for deploying Near-RT RIC and RAN network functions. Our findings focused on the RAN functions interoperability with the RIC.","PeriodicalId":354290,"journal":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124629248","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":"W-State as a OHE Scheme for Efficient Path Selection on Quantum Random Walks","authors":"Julie Germain, R. Dantu","doi":"10.1109/INFOCOMWKSHPS57453.2023.10226051","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS57453.2023.10226051","url":null,"abstract":"Random walks are a promising area, where quantum computing could provide a speed advantage over classical computing. All random walks require a means to randomly select the direction of the path as it leaves each node. Previous quantum random walk approaches have used a “coin toss” approach, by taking advantage of the inherent randomness generated by a Hadamard gate applied to a qubit(s), to randomly select which edge to traverse. Inspired by AI's common use of one-hot encoding (OHE) and noting that W-State entanglement effectively generates a random OHE value, we designed and tested a OHE-based alternative for randomly selecting the next graph edge to travel. Though the “coin toss” approach has the advantage of requiring fewer qubits as the graphs increase in degree, our experiments confirmed that the approach had poor outcomes, at even slight graph size increases. In contrast, the OHE scheme was more successful at generating correct results when run on quantum hardware, indicating the trade-off of more qubits to obtain a usable outcome could be warranted. Neither would lead us to expect results adequate to perform large quantum random walks, but, provide guidance that the OHE approach is likely a step forward in that direction.","PeriodicalId":354290,"journal":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131503590","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 Learning Enabled Keystroke Eavesdropping Attack Over Videoconferencing Platforms","authors":"Xueyi Wang, Yifan Liu, Shancang Li","doi":"10.1109/INFOCOMWKSHPS57453.2023.10225861","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS57453.2023.10225861","url":null,"abstract":"The COVID-19 pandemic has significantly impacted people by driving people to work from home using communication tools such as Zoom, Teams, Slack, etc. The users of these communication services have exponentially increased in the past two years, e.g., Teams annual users reached 270 million in 2022 and Zoom averaged 300 million daily active users in videoconferencing platforms. However, using edging artificial intelligence techniques, new cyber attacking tools expose these services to eavesdropping or disruption. This work investigates keystroke eavesdropping attacks on physical keyboards using deep learning techniques to analyze the acoustic emanation of keystroke audios to identify victims' keystrokes. An accurate context-free inferring algorithm was developed that can automatically predict keystrokes during inputs. The experimental results demonstrated that the accuracy of keystroke inference approaches is around 90% over normal laptop keyboards.","PeriodicalId":354290,"journal":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128734651","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}