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

40th Annual computer security Applications Conference, ACSAC 2024

作者： Guo, Xiangxin Jia, Shijie Lin, Jingqiang Ma, Yuan Zheng, Fangyu Li, Guangzheng Xu, Bowen Cheng, Yueqiang Ji, Kailiang School of Cyber Security University of Science and Technology of China Hefei China Key Laboratory of Cyberspace Security Defense Institute of Information Engineering CAS Beijing China School of Cryptology University of Chinese Academy of Sciences Beijing China Faculty of Electrical Engineering and Computer Science Ningbo University Ningbo China NIO China

ISBN: (纸本)9798331520885

Cryptographic APIs are essential for ensuring the security of software systems. However, many research studies have revealed that the misuse of cryptographic APIs is commonly widespread. Detecting such misuse in Python poses challenges due to its intricate features, including dynamic features and pass-by-object-reference. Existing tools lack the precision and accuracy to tackle these challenges, leading to both high false positives and false negatives. In this work, we propose a specific Python Cryptographic Abstract Syntax Tree (PCAST) to represent the structure of source code, which rewrites AST nodes to handle complex Python features. Based on PCAST, we design and implement CryptoPyt, a static code analysis tool that leverages precise taint analysis and 17 cryptographic misuse rules to automatically identify potential cryptographic APIs misuse in Python projects. We conduct an in-depth analysis of all the APIs within the popular 21 Python cryptographic libraries and design five kinds of taint detectors to perform intra-procedural and inter-function analysis on the APIs and arguments. To demonstrate the effectiveness of CryptoPyt, we conduct experiments with six state-of-the-art tools (i.e., Cryptolation, LICMA, Bandit, Dlint, Semgrep and CodeQL) on both the labeled benchmark PyCryptoBench and the real-world Python cryptographic projects datasets PCAMD. Our evaluations show that CryptoPyt achieves an F1 score of 0.80 on PyCryptoBench and a recall rate of 99.08% on PCAMD. Furthermore, we disclose the discovered critical issues to the developers and seven high-level CVE IDs have been assigned to these findings. Our tool contributes to enhancing the security of Python cryptographic software. © 2024 IEEE.

关键词： Python

来源：评论

学校读者我要写书评

暂无评论

SarlBFT: Scalable Tree Communication Pattern BFT Protocol

SarlBFT: Scalable Tree Communication Pattern BFT Protocol

引用

Cyber Science and Technology Congress (CyberSciTech), IEEE

作者： Jianxin Yang Hui Lin Xiaoding Wang Fujian Provincial Key Laboratory of Network Security and Cryptology College of Computer and Cyber Security Fujian Normal University Fuzhou Fujian P.R. China

ISBN: (数字)9798331532093

ISBN: (纸本)9798331532109

With the increasing interest in blockchain within the business domain, there has been a growing focus on the implementation of permissioned blockchains. However, many of these blockchains rely on Byzantine Fault Tolerance (BFT) consensus algorithms that suffer from scalability limitations and restricted throughput. Furthermore, most of these protocols are primarily designed based on stable-leader, lacking in terms of fairness. Common techniques aimed at enhancing efficiency and fairness include pipelining and leader rotation. Despite these efforts, the throughput of these methods remains limited, and the protocols necessitate a sequence of consecutive three or four correct leaders to commit operations. To tackle this challenge, we propose an innovative BFT protocol based on a Tree-like Pipeline named SarlBFT. This protocol demonstrates its effectiveness in maintaining operational continuity and achieving high data processing rates, even when successive reliable leaders are not present. Additionally, supporting leader rotation enhances fairness and strengthens resistance against censorship. Our evaluation results indicate that SarlBFT reduces the expected commit latency of HotStuff by nearly 2 times in the event of failures, while concurrently increasing throughput by approximately 5 times.

关键词： Resistance Fault tolerance Protocols Scalability Fault tolerant systems Throughput Data processing Blockchains Proposals Pipeline processing

来源：评论

学校读者我要写书评

暂无评论

Regularization Mixup Adversarial Training: A Defense Strategy for Membership Privacy with Model Availability Assurance

Regularization Mixup Adversarial Training: A Defense Strateg...

引用

Big Data and Privacy Computing (BDPC), International Conference on

作者： Zehua Ding Youliang Tian Guorong Wang Jinbo Xiong State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang China Fujian Provincial Key Laboratory of Network Security and Cryptology College of Computer and Cyber Security Fujian Normal University Fuzhou China

ISBN: (数字)9798350307597

ISBN: (纸本)9798350307603

Neural network models face two highly destructive threats in real-world applications: membership inference attacks (MIAs) and adversarial attacks (AAs). One compromises the model's confidentiality, leading to membership privacy breaches, while the other disrupts the model's availability, rendering it dysfunctional. Recent work has shown that adversarial examples can pose dual threats to neural network models, both MIAs and AAs, so that these two different types of attacks have a certain degree of intersection. However, existing defense methods typically focus on defending against one of the two attacks and cannot simultaneously address both. To address the above issues, we propose a defense method called regularization mixup adversarial training (RMAT), aiming to protect model membership privacy while ensuring model availability. The core idea of RMAT is to use a continuous augmentation strategy during training to generate mixup adversarial examples, weakening attackers' understanding of membership data, and updating the model with a new membership-weighted loss strategy to improve its generalization ability for handling unknown samples. This approach can further protect the model's membership privacy and ensure model availability. Experimental results demonstrate that compared to single defense strategies, RMAT can simultaneously protect the model's membership privacy and availability.

关键词： Training Privacy Data privacy Neural networks computer architecture Rendering (computer graphics) Privacy breach

来源：评论

学校读者我要写书评

暂无评论

Lightweight Federated Learning Secure Aggregation Protocols

Lightweight Federated Learning Secure Aggregation Protocols

引用

International Conference on networking and network Applications (NaNA)

作者： Xianyu Mu Youliang Tian Zhou Zhou Jinbo Xiong State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang China Fujian Provincial Key Laboratory of Network Security and Cryptology College of Computer and Cyber Security Fujian Normal University Fuzhou China Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies Shenzhen China

ISBN: (数字)9798350376777

ISBN: (纸本)9798350376784

With the increasing awareness of user privacy protection and the improvement of domestic and international privacy protection laws, coalitional learning has become the current machine learning framework to protect user privacy. However, there are still specific security threats in coalitional learning, i.e., semi-honest servers obtain the corresponding privacy information by launching reverse inference attacks on the user’s local model gradient. Although effective against the attacks of semi-honest adversaries, previous research schemes resulted in huge computational costs and poor robustness. Therefore, in this paper, we propose a federated learning security aggregation protocol based on lightweight cryptography algorithms, which can significantly reduce the computational costs at the user’s end and is robust to users offline. First, this paper constructs an efficient secure aggregation protocol based on lightweight cryptographic algorithms, which significantly reduces the computational costs required on the user side. Second, an effective reconfiguration algorithm is designed in order to prevent the aggregation failure caused by the auxiliary computing nodes going offline. Finally, this paper demonstrates the security of the protocol through security analysis. In addition, this paper shows through experimental results that the scheme achieves a significant efficiency improvement, and the number of required communication rounds is reduced to two.

关键词： Privacy Protocols Runtime Federated learning Computational modeling Inference algorithms Robustness

来源：评论

学校读者我要写书评

暂无评论

PE: A Poincare Explanation Method for Fast Text Hierarchy Generation

PE: A Poincare Explanation Method for Fast Text Hierarchy Ge...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Chen, Qian Li, Dongyang He, Xiaofeng Li, Hongzhao Yi, Hongyu School of Computer Science and Technology East China Normal University Shanghai China NPPA Key Laboratory of Publishing Integration Development ECNUP Shanghai China Sichuan Caizi Software Information Network Co. Ltd. China

ISBN: (纸本)9798891761681

The black-box nature of deep learning models in NLP hinders their widespread *** research focus has shifted to Hierarchical Attribution (HA) for its ability to model feature *** works model non-contiguous combinations with a time-costly greedy search in Euclidean spaces, neglecting underlying linguistic information in feature *** this work, we introduce a novel method, namely Poincare Explanation (PE), for modeling feature interactions with hyperbolic spaces in a time efficient ***, we take building text hierarchies as finding spanning trees in hyperbolic *** we project the embeddings into hyperbolic spaces to elicit inherit semantic and syntax hierarchical *** we propose a simple yet effective strategy to calculate Shapley *** we build the the hierarchy with proving the constructing process in the projected space could be viewed as building a minimum spanning tree and introduce a time efficient building *** results demonstrate the effectiveness of our approach. © 2024 Association for Computational Linguistics.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

An Imperceptible Adversarial Attack Against 3D Object Detectors in Autonomous Driving

引用

IEEE Internet of Things Journal 2025年第12期12卷 21404-21414页

作者： Wang, Yizhou Wu, Libing Jin, Jiong Wang, Enshu Zhang, Zhuangzhuang Zhao, Yu Wuhan University Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan430072 China Swinburne University of Technology School of Engineering MelbourneVIC3122 Australia Wuhan University School of Cyber Science and Engineering Wuhan430072 China City University of Hong Kong Department of Computer Science Hong Kong Hong Kong

As LiDAR-based 3D object detection gains attention, existing research on point cloud adversarial attacks has exposed vulnerabilities in 3D neural network models, which can further impact the reliability of perception systems in autonomous driving. However, current adversarial attacks primarily focus on the point cloud classification tasks, while detection tasks are more challenging to attack because they involve the localization of multiple targets and the sparse distribution of objects. Existing methods often implement attacks by adding global perturbations to the point clouds, which results in poor attack performance and lack of imperceptibility. In this paper, we investigate the robustness of 3D object detectors against adversarial examples. We propose a novel imperceptible attack method to generate 3D adversarial point clouds. First, we introduce the saliency map for the point clouds, assigning the unique value to each point to measure its importance to the model's discrimination results. These salient points are then aggregated and adaptively matched to different attack areas corresponding to different targets. Next, we design an optimization-based attack algorithm to generate adversarial point clouds, which are supervised by a dual-loss function consisting of the detection loss to ensure attack effectiveness and the distance loss to limit gap with the original point cloud. Finally, we conducted experiments on two real-world datasets, the KITTI and Waymo Open datasets, to evaluate the proposed attack method. Extensive experiments demonstrate that our attack method achieves average attack success rates of 83.07% and 77.11% on two datasets against seven 3D object detectors with minimal perturbations. Additionally, the generated adversarial point clouds exhibit strong transferability across multiple mainstream detectors. © 2025 IEEE.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Multimodal Dialogue Emotion Recognition Based on Label Optimization and Coarse-Grained Assisted Fine-Grained

Multimodal Dialogue Emotion Recognition Based on Label Optim...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Zhibo Zhang Zhenyu Yang Yan Huang Baojie Xu Wenyue Hu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Multimodal dialogue emotion recognition integrates data from multiple modalities to accurately identify emotional states in conversations. However, differences in expression and information density across modalities complicate the fusion of features. Traditional methods may introduce redundant information from other utterances, reducing the accuracy of emotion recognition. Existing one-hot labels often fail to capture the full range of emotional expressions, leading to biased results. To address these issues, we propose a model that fuses different modalities within the same utterance to avoid redundancy. It employs a progressive classification process, refining emotion recognition from coarse to fine granularity. Additionally, we use emotion polarity probabilities as weights for fine-grained classification and introduce a multimodal information-rich label that considers both the data and their interactions. Experiments on IEMOCAP and MELD datasets demonstrate the model’s effectiveness, significantly improving dialog emotion recognition accuracy. Our code is available at https://***/r/LOCG-188E.

关键词： Emotion recognition Accuracy Fuses Refining Termination of employment Speech recognition Signal processing Speech processing Optimization Faces

来源：评论

学校读者我要写书评

暂无评论

network security Situation Assessment Method Based on Absorbing Markov Chain

Network Security Situation Assessment Method Based on Absorb...

引用

2022 International Conference on networking and network Applications, NaNA 2022

作者： Gao, Hongbin Wang, Shangxing Zhang, Hongbin Liu, Bin Zhao, Dongmei Liu, Zhen Hebei University of Science and Technology School of Information Science and Engineering Shijiazhuang China Hebei University of Science and Technology School of Information Science and Engineering Hebei Key Laboratory of Network and Information Security Shijiazhuang China Hebei University of Science and Technology School of Economics and Management Research Center of Big Data and Social Computing Shijiazhuang China Hebei Normal University Hebei Key Laboratory of Network and Information Security Shijiazhuang China

ISBN: (数字)9781665461313

ISBN: (纸本)9781665461313

This paper has a new network security evaluation method as an absorbing Markov chain-based assessment method. This method is different from other network security situation assessment methods based on graph theory. It effectively refinement issues such as poor objectivity of other methods, incomplete consideration of evaluation factors, and mismatching of evaluation results with the actual situation of the network. Firstly, this method collects the security elements in the network. Then, using graph theory combined with absorbing Markov chain, the threat values of vulnerable nodes are calculated and sorted. Finally, the maximum possible attack path is obtained by blending network asset information to determine the current network security status. The experimental results prove that the method fully considers the vulnerability and threat node ranking and the specific case of system network assets, which makes the evaluation result close to the actual network situation. © 2022 IEEE.

关键词： network security

来源：评论

学校读者我要写书评

暂无评论

Efficient self-testing system for quantum computations based on permutations

引用

Chinese Physics B 2021年第4期30卷 61-73页

作者： Shuquan Ma Changhua Zhu Min Nie Dongxiao Quan State Key Laboratory of Integrated Services Networks Xidian UniversityXi'an 710071China Shaanxi Key Laboratory of Information Communication Network and Security Xi'an University of Posts&TelecommunicationsXi'an 710121China School of Communications and Information Engineering Xi'an University of Posts&TelecommunicationsXi'an 710121China

Verification in quantum computations is crucial since quantum systems are extremely vulnerable to the ***,verifying directly the output of a quantum computation is difficult since we know that efficiently simulating a large-scale quantum computation on a classical computer is usually thought to be *** overcome this difficulty,we propose a self-testing system for quantum computations,which can be used to verify if a quantum computation is performed correctly by *** basic idea is using some extra ancilla qubits to test the output of the *** design two kinds of permutation circuits into the original quantum circuit:one is applied on the ancilla qubits whose output indicates the testing information,the other is applied on all qubits(including ancilla qubits) which is aiming to uniformly permute the positions of all *** show that both permutation circuits are easy to *** this way,we prove that any quantum computation has an efficient self-testing *** the end,we also discuss the relation between our self-testing system and interactive proof systems,and show that the two systems are equivalent if the verifier is allowed to have some quantum capacity.

关键词： quantum computation verification self-testing systems complexity theory

来源：评论

学校读者我要写书评

暂无评论

Three-level Compact Caching for Search Engines Based on Solid State Drives 23

Three-level Compact Caching for Search Engines Based on Soli...

引用

23rd IEEE International Conference on High Performance Computing and Communications, 7th IEEE International Conference on Data Science and Systems, 19th IEEE International Conference on Smart City and 7th IEEE International Conference on Dependability in Sensor, Cloud and Big Data Systems and Applications, HPCC-DSS-SmartCity-DependSys 2021

作者： Zhang, Rui Sun, Pengyu Tong, Jiancong Zang, Ruirui Qian, Heng Pan, Yu Stones, Rebecca J. Wang, Gang Liu, Xiaoguang Li, Yusen College of Computer Science Nankai University Tianjin China Tianjin Key Laboratory of Network and Data Security Technology Tianjin China Baidu Inc Beijing China

ISBN: (纸本)9781665494571

The query processing in search engines can be classified into either disk I/O operations and CPU computation operations. Conventional search engine caching methods mostly aimed at reducing disk I/O operations. However, with the new trend of using solid state drives (SSDs) instead of hard disk drives for search engine storage, the bottleneck of query processing shifts from disk I/O to computation. In this paper, we design a three-level compact caching structure suited to SSD-based search engines, incorporating caches for (a) doculets, partial documents which contain previously encountered snippets, (b) fragments, compact data structures containing snippet metadata, and (c) ranked docID lists, which index the top-k documents relevant to a query. This three-level compact caching method aims at reducing the bottleneck of repetitive CPU computation operations. Moreover, by considering different levels of caches as a whole system, the proposed three-level compact caching eliminates the redundancy among cache items. This increases the efficiency of cache space utilization. Experimental results indicate an improvement in query response latency by a factor of around 2.6 when using static caching and 1.3 under dynamic caching. © 2021 IEEE.

关键词： Costs Solid state drives Smart cities Query processing Redundancy Search engines Metadata

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：