检索结果-内蒙古大学图书馆

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Shi, Jiaoli Hu, Chao Yao, Shimao Mei, Zhuolin Wu, Bin Li, Hui Jiujiang Univ. School of Computer and Big Data Jiujiang China Jiangxi Univ. of Finance and Economics School of Software IoT Engineering Nanchang China Jiujiang Key Lab. of Network and Information Security Jiujiang China Jiujiang University School of Computer and Big Data Jiujiang China Peking University School of Elec. and Comp. Engineering Shenzhen China

ISBN: (纸本)9798350330717

Efficiency, security, and flexibility are difficult to balance in a full policy hiding CP-ABE scheme. This paper creatively converts the privacy matching problem of access policy and a user's private key to the privacy three-party set computation problem. Then the new privacy set computation problem is resolved by a message driven key generation method. Additionally, the ROBDD (Reduced Ordered Binary Decision Diagrams) is utilized to rich access structure expression and convert access policies into feasible path sets. Each feasible path is composed of attributes and these attributes are bound to the ciphertext using CP-ABE. Based on the innovative ideas mentioned above, we present a Lighten Fine-grained Access Control scheme supporting Full Policy Hidden (LFAC-FPH) that integrates data confidentiality protection, access policy rich expression but complete hiding, fine-grained access control, and lightweight terminal computing. Our scheme has three advantages: 1) High Efficiency. The proposed scheme can achieve fast privacy matching of access policies during user decryption. 2) Full Policy Hiding. The access policy bound by an owner on the ciphertext does not leak any information. Moreover, a user cannot know attributes they do not own. 3) High Flexibility. The decryption process does not require online from owners or KGC, and system attributes can be added at any time. © 2023 IEEE.

关键词： CP-ABE full policy hiding lighten computation Private-Preserving

来源：评论

学校读者我要写书评

暂无评论

CustomFair: A Customized Fairness Method for Federated Recommender Systems in Social Internet of Things

引用

IEEE Internet of Things Journal 2024年

作者： Chen, Guorong Li, Chao Du, Fei Yuan, Xiaohan Chi, Cheng Yin, Zihang Wang, Bin Li, Tao Bao, Xuhua Wang, Wei Beijing Jiaotong University Beijing Key Laboratory of Security and Privacy in Intelligent Transportation Beijing100044 China China Academy of Information and Communications Technology Beijing China Network and Data Security Hangzhou310053 China Nankai University College of Computer Science Tianjin300350 China LTD Sangfor Technologies Co Beijing China Xi'an Jiaotong University Ministry of Education Key Lab for Intelligent Networks and Network Security Xi'an China

In the Social Internet of Things (SIoT), edge computing integrates artificial intelligence to learn intricate relationships. The scale and complexity of SIoT cause a data explosion from diverse objects, hindering tailored services to users who own objects. Moreover, conventional edge computing in SIoT depends on centralized data collection, raising concerns about data privacy. To address the above two issues, federated recommender systems (FRSs) present a promising solution. FRSs can provide SIoT services to users and train a shared model while retaining sensitive data locally on objects. However, as FRSs are driven by data, they are inherently susceptible to algorithmic bias, raising substantial fairness concerns that have attracted considerable attention in SIoT. Recent fairness studies predominantly concentrate on a single sensitive attribute for users, thereby overlooking their autonomy. Therefore, we propose CustomFair, a personalized fairness framework that enables users in FRSs to select preferred sensitive attributes and acquire satisfied recommendation services in SIoT scenarios. First, we define customized fairness to ensure group fairness based on users' sensitive attributes. The server segments users into subgroups in a privacy-preserving manner. Second, CustomFair employs the DynBalance method with a flexible regularization coefficient to improve recommendation performance and utilizes the AdaptEpoch strategy to achieve fairness. Extensive experiments indicate that CustomFair improves recommendation performance by 0.1 ∼ 42.92 and enhances fairness by reducing disparities of 0.03 ∼ 5.41 compared to two baselines across three datasets. © 2014 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

EVPIR: Efficient and Verifiable Privacy-Preserving Image Retrieval in Cloud-assisted Internet of Things

引用

IEEE Internet of Things Journal 2025年

作者： Li, Mingyue Li, Yuntao Du, Ruizhong Jia, Chunfu Shao, Wei Hebei University School of Cyber Security and Computer Baoding071000 China Key Lab on High Trusted Information Sys tem in Hebei Province Hebei China College of Cyber Sciences Nankai university Tianjin300350 China Tianjin Key Laboratory of Network and Data Security Technology Tianjin300350 China Jinan250014 China

With the proliferation of mobile devices and the advancement of cloud computing capabilities, cloud-assisted Internet of Things (IoT) attracts increased attention based on its computational and storage advantages. Upon these conveniences, there also raises privacy concerns that numerous solutions have been proposed to solve it. However, existing methods suffer from challenges such as low retrieval accuracy, inefficiency in large-scale image retrieval, and lack of efficient result verification. In this paper, we propose an Efficient Verifiable Privacy-preserving Image Retrieval scheme (EVPIR). Specifically, we design a hierarchical graph index to significantly enhance retrieval efficiency, which organizes image feature vectors into a multi-level structure, establishing connections between neighboring nodes within each layer and creating a highly structured and efficient retrieval framework. During the retrieval process, we employ greedy search algorithm to navigate these connections and identify the closest neighbors across different levels, which make the proposed multi-level approach reduce the search space at each level, achieving faster and more accurate retrieval. Furthermore, we design an efficient dynamic verifiable framework leveraging Chameleon hash functions and BLS signatures where we utilize Chameleon hash nodes based on Merkle Hash Trees (MHT) to enable dynamic updates of the verification tree and employ BLS signatures to construct multiple verification nodes for effectively shortening the verification path. Finally, security analysis shows that EVPIR can defend various threat models and extensive experiments further demonstrates that EVPIR can improve retrieval and verification efficiency. (Figure presented) © 2014 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Speed Master: Quick or Slow Play to Attack Speaker Recognition 39

Speed Master: Quick or Slow Play to Attack Speaker Recogniti...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Ye, Zhe Zhang, Wenjie Ren, Ying Kang, Xiangui Yan, Diqun Ma, Bin Wang, Shiqi Guangdong Key Lab of Information Security School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Faculty of Electrical Engineering and Computer Science Ningbo University Ningbo China Key Laboratory of Computing Power Network and Information Security Ministry of Education Qilu University of Technology Shandong Academy of Sciences Jinan China Department of Computer Science City University of Hong Kong Hong Kong

ISBN: (纸本)157735897X

Backdoor attacks pose a significant threat during the model’s training phase. Attackers craft pre-defined triggers to break deep neural networks, ensuring the model accurately classifies clean samples during inference yet erroneously classifies samples added with these triggers. Recent studies have shown that speaker recognition systems trained on large-scale data are susceptible to backdoor attacks. Existing attackers employ unnoticed ambient sounds as triggers. However, these sounds are not inherently part of the training samples themselves. In essence, triggers can be designed to maintain an intrinsic connection with the original speech to enhance stealthiness. Our paper presents a novel attack methodology named Speed Master, which undermines deep neural networks by manipulating the speed of speech samples. Specifically, we execute poison-only backdoor attacks using speed or tempo adjustment. Changes in speech rate have become a common occurrence, as seen on platforms that allow users to adjust playback speed. In real-world scenarios, people naturally adjust their speaking rate depending on the context. As a result, changes in a speaker’s speech rate are typically perceived as normal and are unlikely to raise suspicion. Furthermore, detecting such subtle adjustments becomes challenging for users without reference speech. Our comprehensive experiments demonstrate that Speed Master can achieve an ASR over 99% in the digital domain, with only a 0.6% poisoning rate. Additionally, we validate the feasibility of Speed Master in the real world and its resistance to typical defensive measures. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Quantum Secret Sharing Enhanced: Utilizing W States for Anonymous and Secure Communication

arXiv

引用

arXiv 2024年

作者： Li, Guo-Dong Cheng, Wen-Chuan Wang, Qing-Le Cheng, Long Mao, Ying Jia, Heng-Yue School of Control and Computer Engineering North China Electric Power University Beijing102206 China Key Lab of Information Network Security Ministry of Public Security Shanghai200031 China Department of Computer and Information Science Fordham University New York City10458 United States School of Information Central University of Finance and Economics Beijing102206 China Engineering Research Center of State Financial Security Ministry of Education Central University of Finance and Economics Beijing102206 China

Quantum secret sharing (QSS) is the result of merging the principles of quantum mechanics with secret information sharing. It enables a sender to share a secret among receivers, and the receivers can then collectively recover the secret when the need arises. To enhance the practicality of these quantum protocols, an innovative concept of quantum anonymous secret sharing (QASS) is advanced. In this paper, we propose a QASS protocol via W states, which can share secrets while ensuring recover-ability, recover-security, and recover-anonymity. We have rigorously evaluated our protocols, verifying their accuracy and fortifying their security against scenarios involving the active adversary. This includes considerations for dishonest receivers and non-receivers. Moreover, acknowledging the imperfections inherent in real-world communication channels, we have also undertaken an exhaustive analysis of our protocol’s security and effectiveness in a quantum network where some form of noise is present. Our investigations reveal that W states exhibit good performance in mitigating noise interference, making them apt for practical applications. © 2024, CC BY-NC-ND.

关键词： Quantum theory

来源：评论

学校读者我要写书评

暂无评论

Simulating Cyber Attacks and Designing Malware using Python 10

Simulating Cyber Attacks and Designing Malware using Python

引用

10th International Conference on Signal Processing and Integrated networks, SPIN 2023

作者： Ankit, Akash Inder, Shubham Sharma, Anuj Johari, Rahul Vidyarthi, Deo Prakash University School of Information Communication and Technology Guru Gobind Singh Indraprastha University SWINGER: Security Wireless IoT Network Group of Engineering and Research Dwarka New Delhi110078 India MelbourneVIC3000 Australia Jawaharlal Nehru University Parallel and Distributed System Lab School of Computer and Systems Sciences New Delhi110067 India

ISBN: (纸本)9781665490993

In this Internet era, we have become heavily dependent on the World Wide Web and it has become a basic amenity for humans. A normal user can be trapped easily in this vicious web if not careful enough. It is a field that requires users to be on their toes every time they try to connect to this enormous interconnection of networks. Reports and Surveys have said that in the coming years, Cybercrime could become the biggest threat. In this proposed work, the authors have deployed applications and designed malware for the purpose of simulating various kinds of cyber-attacks so that they could study their effects & affects and ultimately devise solutions to resolve the vulnerabilities in a system. These applications included networking concepts & protocols and a software based keylogger which was developed with no malicious intent, but to analyse the architectural view or design of a malware and to study the stages of a malware attack like entry, distribution, exploitation, infection and execution. Efforts have been made to demonstrate spooting attacks with an idea of identifying vulnerabilities and security loopholes in a particular system that can be exploited by an attacker if not resolved within time. © 2023 IEEE.

关键词： network security

来源：评论

学校读者我要写书评

暂无评论

TrUStAPIS: a trust requirements elicitation method for IoT

TrUStAPIS: a trust requirements elicitation method for IoT

引用

作者： Ferraris, Davide Fernandez-Gago, Carmen Network Information and Computer Security Lab University of Malaga Malaga29071 Spain

The internet of things (IoT) is an environment of interconnected entities, which are identifiable, usable and controllable via the Internet. Trust is useful for a system such as the IoT as the entities involved would like to know how the other entities they have to interact with are going to perform. When developing an IoT entity, it will be desirable to guarantee trust during its whole life cycle. Trust domain is strongly dependent on other domains such as security and privacy. To consider these domains as a whole and to elicit the right requirements since the first phases of the system development life cycle is a key point when developing an IoT entity. This paper presents a requirements elicitation method focusing on trust plus other domains such as security, privacy and usability that increase the trust level of the IoT entity developed. To help the developers to elicit the requirements, we propose a JavaScript notation object template containing all the key elements that must be taken into consideration. We emphasize on the importance of the concept of traceability. This property permits to connect all the elicited requirements guaranteeing more control on the whole requirements engineering process. © 2019, Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

SFTA: Spiking Neural networks Vulnerable to Spiking Feature Transferable Attack

SFTA: Spiking Neural Networks Vulnerable to Spiking Feature ...

引用

IEEE International Symposium on Parallel and Distributed Processing with Applications and IEEE International Conference on Ubiquitous Computing and Communications (ISPA/IUCC)

作者： Xuanwei Lin Chen Dong Ximeng Liu College of Computer and Data Science Fuzhou University Fujian Key Laboratory of Network Computing and Intelligent Information Processing (Fuzhou University) Key Lab of Information Security of Network Systems (Fuzhou University)

Many recent works have shown that spiking neural networks (SNNs) are vulnerable to well-crafted adversarial attacks in the white-box setting, which may lead to misclassification of the trained model. However, the information about the model is in a black-box setting and is usually unknown to the attacker, e.g., the parameters and structure of the model. So it is more challenging to counter the attack in the black-box setting, and there is still little research on this aspect in SNNs. Therefore, this work describes a transfer-based black box adversarial attack against spike feature space representations, providing insights for robust spike features in SNNs models. The attack is explicitly designed to be transferable, and more robust feature gradients are obtained by accumulating the feature gradients of the intermediate layers. Then we can successfully attack the black-box model by suppressing robust positive features and enhancing negative features. Extensive experimental evaluation demonstrates the proposed method’s effectiveness and superior performance on static and neuromorphic datasets. i.e., The attack success is 89.72% and 90% on the static MNIST and CIFAR10 datasets, and 85.97% and 69.09% on the neuromorphic N-MNIST and CIFARO-DVS datasets.

关键词： Correlation Neuromorphics Neural networks Closed box Ubiquitous computing Optimization Glass box

来源：评论

学校读者我要写书评

暂无评论

Taxi Station Location Model Based on Spatio-Temporal Demand Cube

Taxi Station Location Model Based on Spatio-Temporal Demand ...

引用

International Conference on networking and network Applications (NaNA)

作者： LuLu Gao XiaoNan Li ZhiCheng Wei Key Lab of Network and Information Security Shijiazhuang Hebei Province China College of Computer and Cyber Security Shijiazhuang Hebei Province China Hebei Provincial Engineering Research Center for Supply Chain Big Data Analytics & Security Hebei Normal University Shijiazhuang Hebei Province China

With the widespread use of mobile apps, empty taxis can easily receive new orders without having to roam around. Therefore, it is necessary to plan taxi stations where empty taxis can park. In the location selection problem, the spatial and temporal distribution of passenger demand needs to be considered to ensure that the selected location can meet the actual needs of passengers. In this paper, a Spatio-Temporal Cube Demand Coverage Model (STC-DCM) is proposed for taxi station location selection. Firstly, a spatiotemporal demand cube is constructed to obtain fine-grained user demands based on time and space, and genetic algorithm is used to maximize the demand coverage rate. Then, the final location selection results are obtained using the fusion module and adjustment optimization module, where the fusion module integrates multiple location selection solutions using ensemble learning method. Experimental results show that our proposed model can better cover dynamic passenger demand compared to traditional models.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Improved iBAT-COOP Protocol for Cooperative Diversity in FANETs

引用

computers, Materials & Continua 2021年第5期67卷 2527-2546页

作者： Shahzad Hameed Qurratul-Ain Minhas Sheeraz Ahmed Shabana Habib Mohammad Kamrul Hasan Muhammad Islam Sheroz Khan Quaid-i-Azam University IslamabadPakistan Iqra National University PeshawarPakistan Network and Communication Technology Lab Center for Cyber SecurityUKMBangiMalaysia Department of Information Technology College of ComputerQassim UniversityBuraydahSaudi Arabia Department of Electrical Engineering Onaizah College of Engineering&Information TechnologyAl-QassimSaudi Arabia

Flying ad hoc networks(FANETs)present a challenging environment due to the dynamic and highly mobile nature of the *** network topology and uncertain node mobility structure of FANETs do not aim to consider only one path *** different techniques are adopted to address the issues arising in FANETs,from game theory to clustering to channel estimation and other statistical *** approaches mostly employ traditional concepts for problem *** of the novel approaches that provide simpler solutions to more complex problems is to use biologically inspired *** Nature-inspired schemes address cooperation and alliance which can be used to ensure connectivity among network *** such species that resembles the dynamicity of FANETs are *** this paper,the biologically inspired metaheuristic technique of the BAT Algorithm is proposed to present a routing protocol called iBATCOOP(Improved BAT Algorithm using Cooperation technique).We opt for the design implementation of the natural posture of bats to handle the necessary flying ***,we envision the concept of cooperative diversity using multiple relays and present an iBAT-COOP routing protocol for *** paper employs cooperation for an optimal route selection and reflects on distance,Signal to Noise Ratio(SNR),and link conditions to an efficient level to deal with FANET’s *** way of simulations,the performance of iBAT-COOP protocol outperforms BAT-FANET protocol and reduces packet loss ratio,end-to-end delay,and transmission loss by 81%,21%,and 82%***,the average link duration is improved by 25%compared to the BAT-FANET protocol.

关键词： Routing protocols UAVs FANETs iBATCOOP BATCOOP

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：