IEEE Open Journal of the Computer Society最新文献_第8页

Backdoor Attacks to Deep Learning Models and Countermeasures: A Survey 深度学习模型的后门攻击及其对策研究

IEEE Open Journal of the Computer Society Pub Date : 2023-04-14 DOI: 10.1109/OJCS.2023.3267221

Yudong Li;Shigeng Zhang;Weiping Wang;Hong Song

{"title":"Backdoor Attacks to Deep Learning Models and Countermeasures: A Survey","authors":"Yudong Li;Shigeng Zhang;Weiping Wang;Hong Song","doi":"10.1109/OJCS.2023.3267221","DOIUrl":"https://doi.org/10.1109/OJCS.2023.3267221","url":null,"abstract":"Backdoor attacks have severely threatened deep neural network (DNN) models in the past several years. In backdoor attacks, the attackers try to plant hidden backdoors into DNN models, either in the training or inference stage, to mislead the output of the model when the input contains some specified triggers without affecting the prediction of normal inputs not containing the triggers. As a rapidly developing topic, numerous works on designing various backdoor attacks and developing techniques to defend against such attacks have been proposed in recent years. However, a comprehensive and holistic overview of backdoor attacks and countermeasures is still missing. In this paper, we provide a systematic overview of the design of backdoor attacks and the defense strategies to defend against backdoor attacks, covering the latest published works. We review representative backdoor attacks and defense strategies in both the computer vision domain and other domains, discuss their pros and cons, and make comparisons among them. We outline key challenges to be addressed and potential research directions in the future.","PeriodicalId":13205,"journal":{"name":"IEEE Open Journal of the Computer Society","volume":"4 ","pages":"134-146"},"PeriodicalIF":0.0,"publicationDate":"2023-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8782664/10016900/10102775.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67881014","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

FLIS: Clustered Federated Learning Via Inference Similarity for Non-IID Data Distribution FLIS：基于推理相似性的非IID数据分布集群联合学习

IEEE Open Journal of the Computer Society Pub Date : 2023-03-27 DOI: 10.1109/OJCS.2023.3262203

Mahdi Morafah;Saeed Vahidian;Weijia Wang;Bill Lin

{"title":"FLIS: Clustered Federated Learning Via Inference Similarity for Non-IID Data Distribution","authors":"Mahdi Morafah;Saeed Vahidian;Weijia Wang;Bill Lin","doi":"10.1109/OJCS.2023.3262203","DOIUrl":"https://doi.org/10.1109/OJCS.2023.3262203","url":null,"abstract":"Conventional federated learning (FL) approaches are ineffective in scenarios where clients have significant differences in the distributions of their local data. The Non-IID data distribution in the client data causes a drift in the local model updates from the global optima, which significantly impacts the performance of the trained models. In this article, we present a new algorithm called FLIS that aims to address this problem by grouping clients into clusters that have jointly trainable data distributions. This is achieved by comparing the \u0000<italic>inference similarity</i>\u0000 of client models. Our proposed framework captures settings where different groups of users may have their own objectives (learning tasks), but by aggregating their data with others in the same cluster (same learning task), superior models can be derived via more efficient and personalized federated learning. We present experimental results to demonstrate the benefits of FLIS over the state-of-the-art approaches on the CIFAR-100/10, SVHN, and FMNIST datasets. Our code is available at \u0000<uri>https://github.com/MMorafah/FLIS</uri>\u0000.","PeriodicalId":13205,"journal":{"name":"IEEE Open Journal of the Computer Society","volume":"4 ","pages":"109-120"},"PeriodicalIF":0.0,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8782664/10016900/10081485.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67881012","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 11

Promoting the Sustainability of Blockchain in Web 3.0 and the Metaverse Through Diversified Incentive Mechanism Design 通过多样化的激励机制设计促进区块链在Web 3.0和元宇宙中的可持续性

IEEE Open Journal of the Computer Society Pub Date : 2023-03-23 DOI: 10.1109/OJCS.2023.3260829

Daniel Mawunyo Doe;Jing Li;Niyato Dusit;Zhen Gao;Jun Li;Zhu Han

{"title":"Promoting the Sustainability of Blockchain in Web 3.0 and the Metaverse Through Diversified Incentive Mechanism Design","authors":"Daniel Mawunyo Doe;Jing Li;Niyato Dusit;Zhen Gao;Jun Li;Zhu Han","doi":"10.1109/OJCS.2023.3260829","DOIUrl":"https://doi.org/10.1109/OJCS.2023.3260829","url":null,"abstract":"This article explores the role of blockchains in the development of Web 3.0 and the Metaverse. The success of these technologies is dependent on the utilization of decentralized systems like blockchains, which can store and validate data on identities and reputations and facilitate the exchange of virtual assets. Full nodes, which store the entire blockchain state and validate all transactions, are essential for the decentralization and reliability of the network. However, operating a full node is resource-intensive and can be expensive. To tackle this challenge, we propose an incentive mechanism that utilizes contract-theoretic methods to economically motivate users to support the sustainability and growth of the blockchain network. Our contract design addresses the problem of information asymmetry (e.g., users' revenue-generating capabilities and efforts) between users and the blockchain network. Additionally, we recommend providing diverse incentives based on the user's revenue-generating capabilities and efforts to assist the blockchain network in funding incentives. Our experimental results demonstrate that our proposed mechanism increases the blockchain network's utility by \u0000<inline-formula><tex-math>$48.48%-54.52%$</tex-math></inline-formula>\u0000 and reduces the users' cost by \u0000<inline-formula><tex-math>$38.46%-62.5%$</tex-math></inline-formula>\u0000 compared with the state-of-the-art implementations such as Celo, Vipnode, and Pocket Network.","PeriodicalId":13205,"journal":{"name":"IEEE Open Journal of the Computer Society","volume":"4 ","pages":"171-184"},"PeriodicalIF":0.0,"publicationDate":"2023-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8782664/10016900/10078899.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67880867","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Blockchain-Aided Secure Semantic Communication for AI-Generated Content in Metaverse Metaverse中人工智能生成内容的区块链辅助安全语义通信

IEEE Open Journal of the Computer Society Pub Date : 2023-03-23 DOI: 10.1109/OJCS.2023.3260732

Yijing Lin;Hongyang Du;Dusit Niyato;Jiangtian Nie;Jiayi Zhang;Yanyu Cheng;Zhaohui Yang

{"title":"Blockchain-Aided Secure Semantic Communication for AI-Generated Content in Metaverse","authors":"Yijing Lin;Hongyang Du;Dusit Niyato;Jiangtian Nie;Jiayi Zhang;Yanyu Cheng;Zhaohui Yang","doi":"10.1109/OJCS.2023.3260732","DOIUrl":"https://doi.org/10.1109/OJCS.2023.3260732","url":null,"abstract":"The construction of virtual transportation networks requires massive data to be transmitted from edge devices to Virtual Service Providers (VSP) to facilitate circulations between the physical and virtual domains in Metaverse. Leveraging semantic communication for reducing information redundancy, VSPs can receive semantic data from edge devices to provide varied services through advanced techniques, e.g., AI-Generated Content (AIGC), for users to explore digital worlds. But the use of semantic communication raises a security issue because attackers could send malicious semantic data with similar semantic information but different desired content to break Metaverse services and cause wrong output of AIGC. Therefore, in this paper, we first propose a blockchain-aided semantic communication framework for AIGC services in virtual transportation networks to facilitate interactions of the physical and virtual domains among VSPs and edge devices. We illustrate a training-based targeted semantic attack scheme to generate adversarial semantic data by various loss functions. We also design a semantic defense scheme that uses the blockchain and zero-knowledge proofs to tell the difference between the semantic similarities of adversarial and authentic semantic data and to check the authenticity of semantic data transformations. Simulation results show that the proposed defense method can reduce the semantic similarity of the adversarial semantic data and the authentic ones by up to 30% compared with the attack scheme.","PeriodicalId":13205,"journal":{"name":"IEEE Open Journal of the Computer Society","volume":"4 ","pages":"72-83"},"PeriodicalIF":0.0,"publicationDate":"2023-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8782664/10016900/10079087.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67881009","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 16

A Light-Weight Technique to Detect GPS Spoofing Using Attenuated Signal Envelopes 一种利用衰减信号包络检测GPS欺骗的轻量级技术

IEEE Open Journal of the Computer Society Pub Date : 2023-03-22 DOI: 10.1109/OJCS.2023.3278496

Xiao Wei;Muhammad Naveed Aman;Biplab Sikdar

{"title":"A Light-Weight Technique to Detect GPS Spoofing Using Attenuated Signal Envelopes","authors":"Xiao Wei;Muhammad Naveed Aman;Biplab Sikdar","doi":"10.1109/OJCS.2023.3278496","DOIUrl":"https://doi.org/10.1109/OJCS.2023.3278496","url":null,"abstract":"Global Positioning System (GPS) spoofing attacks have attracted more attention as one of the most effective GPS attacks. Since the signals from an authentic satellite and the spoofer undergo different attenuation, the captured envelope of fake GPS signals exhibits distinctive transmission characteristics due to short transmission paths. This can be utilized for GPS spoofing detection. The existing technique for GPS spoofing are either computationally too expensive, require specialize hardware/software updates, or are not accurate enough. To solve these issues, we propose a light-weight GPS spoofing detection method based on a dynamic threshold and captured signal envelope. We validate the proposed technique using experiments based on actual GPS signals and hardware. The relation between envelope characteristics and the distance between a GPS transmitter and receiver are revealed. Inspired by the uncovered relation, a threshold approach towards the detection of GPS spoofing is developed. The proposed approach features a dynamic threshold determined by the \u0000<italic>dispersion value</i>\u0000 of a signal envelope's variance instead of a fixed threshold to maximize detection performance in multiple attack scenarios. The results show that the proposed technique can effectively detect GPS spoofing attacks with better accuracy and lower computational complexity as compared to existing techniques.","PeriodicalId":13205,"journal":{"name":"IEEE Open Journal of the Computer Society","volume":"4 ","pages":"158-170"},"PeriodicalIF":0.0,"publicationDate":"2023-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8782664/10016900/10130376.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67880868","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

An Efficient Decentralized Identity Management System Based on Range Proof for Social Networks 一种有效的基于范围证明的去中心化社交网络身份管理系统

IEEE Open Journal of the Computer Society Pub Date : 2023-03-16 DOI: 10.1109/OJCS.2023.3258188

Xinjie Zhu;Debiao He;Zijian Bao;Min Luo;Cong Peng

{"title":"An Efficient Decentralized Identity Management System Based on Range Proof for Social Networks","authors":"Xinjie Zhu;Debiao He;Zijian Bao;Min Luo;Cong Peng","doi":"10.1109/OJCS.2023.3258188","DOIUrl":"https://doi.org/10.1109/OJCS.2023.3258188","url":null,"abstract":"Online social networks (OSNs) are becoming more and more popular in people's lives as the demand for online interaction continues to grow. Current OSNs are using centralized identity management system (IDM), which has some problems of single point of failure and privacy data leakage. The emergence of decentralized identity (DID) can solve these problems. However, most existing DID systems have some privacy issues that a user's attributes value are disclosed while accessing service. In this paper, we design a DID protocol to solve these challenges. The proposed protocol includes a range proof protocol to provide attribute privacy. The range proof protocol works with anonymous credentials and does not need a trusted setup. Moreover, the identity model behind the DID protocol is extended from an existing model, which achieves identity revocation. Finally, we implement a system prototype on the blockchain for evaluation. The security analysis shows that our protocol provides stronger privacy protection. The performance evaluation indicates that the computation cost and blockchain overheads of our protocol are acceptable in OSNs.","PeriodicalId":13205,"journal":{"name":"IEEE Open Journal of the Computer Society","volume":"4 ","pages":"84-96"},"PeriodicalIF":0.0,"publicationDate":"2023-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8782664/10016900/10073618.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67881008","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

State Space Explosion Mitigation for Large-Scale Attack and Compliance Graphs Using Synchronous Exploit Firing 大规模攻击的状态空间爆炸缓解和使用同步攻击射击的柔顺图

IEEE Open Journal of the Computer Society Pub Date : 2023-03-16 DOI: 10.1109/OJCS.2023.3276370

Noah L. Schrick;Peter J. Hawrylak

{"title":"State Space Explosion Mitigation for Large-Scale Attack and Compliance Graphs Using Synchronous Exploit Firing","authors":"Noah L. Schrick;Peter J. Hawrylak","doi":"10.1109/OJCS.2023.3276370","DOIUrl":"https://doi.org/10.1109/OJCS.2023.3276370","url":null,"abstract":"Attack and compliance graphs are useful tools for cybersecurity and regulatory or compliance analysis. Thgraphs represent the state of a system or a set of systems, and can be used to identify all current or future ways the systems are compromised or at risk of violating regulatory or compliance mandates. However, due to their exhaustiveness and thorough permutation checking, these graphs suffer from state space explosion - the graphs rapidly increase in the total number of states, and likewise, their generation time also rapidly increases. This state space explosion in turn also slows the analysis process. This work introduces a mitigation technique called synchronous firing, where graph users and designers can prevent the generation of infeasible states by firing exploits simultaneously through joining inseparable features like time. This feature does not invalidate the integrity of the resulting attack or compliance graph by altering the exhaustiveness or permutation checking of the generation process, but rather jointly fires exploits through their defined inseparable features.","PeriodicalId":13205,"journal":{"name":"IEEE Open Journal of the Computer Society","volume":"4 ","pages":"147-157"},"PeriodicalIF":0.0,"publicationDate":"2023-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8782664/10016900/10124989.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67881013","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Blockchain-Based Decentralized Application: A Survey 基于区块链的去中心化应用：综述

IEEE Open Journal of the Computer Society Pub Date : 2023-03-13 DOI: 10.1109/OJCS.2023.3251854

Peilin Zheng;Zigui Jiang;Jiajing Wu;Zibin Zheng

引用次数: 4

A Unifying Mathematical Definition of Particle Methods 粒子方法的统一数学定义

IEEE Open Journal of the Computer Society Pub Date : 2023-03-08 DOI: 10.1109/OJCS.2023.3254466

Johannes Pahlke;Ivo F. Sbalzarini

引用次数: 4

Towards Area Efficient Logic Circuit: Exploring Potential of Reconfigurable Gate by Generic Exact Synthesis 面向区域有效逻辑电路：用广义精确综合法探索可重构门的潜力

IEEE Open Journal of the Computer Society Pub Date : 2023-03-06 DOI: 10.1109/OJCS.2023.3247752

Liuting Shang;Azad Naeemi;Chenyun Pan

{"title":"Towards Area Efficient Logic Circuit: Exploring Potential of Reconfigurable Gate by Generic Exact Synthesis","authors":"Liuting Shang;Azad Naeemi;Chenyun Pan","doi":"10.1109/OJCS.2023.3247752","DOIUrl":"https://doi.org/10.1109/OJCS.2023.3247752","url":null,"abstract":"In this article, we propose a generic design methodology to achieve area-efficient reconfigurable logic circuits by using exact synthesis based on Boolean satisfiability (SAT) solver. The proposed methodology better leverages the high representation ability of emerging reconfigurable logic gates (RLGs) to achieve reconfigurable circuits with fewer gates. In addition, we propose a fence-based acceleration method to provide >10× speed up for the synthesis without an observable loss of optimality. Furthermore, four sets of RLGs are developed based on a recently proposed valley-spin device as a case study to demonstrate the advantage of the proposed circuit. Simulations have been performed to analyze the impact of the fence searching algorithm and combination of operators. Based on disjoint-support decomposable (DSD) benchmarks, up to 38% and 73% reductions are observed in the area and energy-delay-area product (EDAP), respectively, compared to CMOS counterparts. Compared to the two existing synthesis methods, the proposed scheme provides 40% and 26.3% reduction in EDAP based on MCNC benchmark.","PeriodicalId":13205,"journal":{"name":"IEEE Open Journal of the Computer Society","volume":"4 ","pages":"50-61"},"PeriodicalIF":0.0,"publicationDate":"2023-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8782664/10016900/10059178.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67881055","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0