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

Computer Technology and Information Science (ISCTIS), International Symposium on

作者： Wen Cheng ShiBin Zhang Yusheng Lin School of Cybersecurity Sichuan Key Laboratory of advanced cryptography and system security Chengdu University of Information Technology Chengdu China

In response to the inefficiency of the existing advGAN method, which requires calculating the differences between the adversarial samples and the normal samples one by one when generating adversarial perturbations, this paper proposes a quantum adversarial sample generation algorithm (QASGA) based on adversarial quantum generative adversarial networks. First, the real samples are encoded into quantum states, then the generator G of QGAN is used to generate adversarial perturbations, which are superimposed with normal samples to obtain adversarial samples. At the same time, the SWAP-TEST method is used to calculate the similarity between all real samples and adversarial samples at once, thereby accelerating adversarial attacks. Experimental results show that the QASGA algorithm proposed in this paper can generate high-fidelity adversarial samples with a one-time similarity calculation on the IRIS dataset, and can reduce the classification accuracy of the BP neural network from 96.67% to 26.67%, verifying the effectiveness of the proposed QASGA algorithm.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Quantum Fuzzy Principal Component Analysis 8th

Quantum Fuzzy Principal Component Analysis

引用

8th International Conference on Artificial Intelligence and security , ICAIS 2022

作者： Wang, Cheng Zhang, Shibin Xia, Jinyue School of Cybersecurity Chengdu University of Information Technology Chengdu610225 China Advanced Cryptography and System Security Key Laboratory of Sichuan Province Chengdu610255 China ArmonkNY14201 United States

ISBN: (纸本)9783031067662

At present, principal component analysis is widely used in the dimensionality reduction processing of high-dimensional data. On the premise of ensuring that the information loss in the construction process is as little as possible, several irrelevant new variables far less than the number of original variables are generated by constructing a series of linear combinations of original variables, which constitute a low-dimensional space. The information contained in it can better restore the information of original variables in high-dimensional space. In other words, it finds the best low rank approximation by calculating the eigenvalues and eigenvectors of the original matrix. However, classical principal component analysis is very sensitive to outliers and missing values. If there are outliers or missing data in the data matrix, the effect of the algorithm is often poor. With the increase of matrix data, the operation cost also increases exponentially, resulting in large time complexity. Aiming at the problems of classical principal component analysis, we proposed a quantum fuzzy principal component analysis algorithm in this paper. By introducing fuzzy sets to fuzzify the covariance matrix, the influence of outliers or missing values is reduced. At the same time, in order to reduce the complexity of the algorithm, we use the parallelism of quantum computing to accelerate our algorithm. The results show that compared with the classical principal component analysis, the algorithm is more effective and the algorithm efficiency is better. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Quantum Gate-Based Quantum Private Comparison Protocol Using Four-Particle GHZ States 8th

Quantum Gate-Based Quantum Private Comparison Protocol Using...

引用

8th International Conference on Artificial Intelligence and security , ICAIS 2022

作者： Hou, Min Zhang, Shibin Xia, Jinyue School of Cybersecurity Chengdu University of Information Technology Chengdu610225 China Advanced Cryptography and System Security Key Laboratory of Sichuan Province Chengdu610255 China ArmonkNY14201 United States

ISBN: (纸本)9783031067631

The previous quantum private comparison (QPC) protocols often utilize quantum technology to provide security and the classic computing to perform exclusive-OR operation. In this paper, a secure quantum gate-based quantum private protocol without classical computing is proposed, which uses four-particle GHZ states as quantum resource and quantum circuit to perform computing. Four-particle GHZ states are easy to be prepared with current technology. The proposed protocol doesn’t need swapping entanglement technology but single-particle measurement and Bell state measurement. Additionally, a semi-honest third party (TP) is involved to help the two participants accomplish the private comparison. Compared with the previous quantum private comparison protocols with classic computing, the proposed protocol is of simplicity and has a quantity of security. Finally, the analysis shows its correctness and it can withstand various attacks including outside attacks and participant ones. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Timing circuits

来源：评论

学校读者我要写书评

暂无评论

Efficient Quantum Private Comparison Using Locally Indistinguishable Orthogonal Product States 8th

Efficient Quantum Private Comparison Using Locally Indisting...

引用

8th International Conference on Artificial Intelligence and security , ICAIS 2022

作者： Huang, Xi Zhang, Shibin Xia, Jinyue School of Cybersecurity Chengdu University of Information Technology Chengdu610225 China Advanced Cryptography and System Security Key Laboratory of Sichuan Province Chengdu610255 China ArmonkNY14201 United States

ISBN: (纸本)9783031067631

In this paper, an efficient quantum private comparison (QPC) for equality comparison using locally indistinguishable orthogonal product states is proposed. In the proposed protocol, two participants can compare the equality of three classical bits in each comparison, which could greatly reduce comparison times and improve efficiency. A semi-honest third party (TP) is involved to help two participants compare the equality of their secrets and she may misbehave on her own, but she is not allowed to conspire with any participants. Additionally, the security analysis shows that the proposed QPC protocol is secure against both outside attacks and participant ones. Compared with the existing QPC protocols, the proposed protocol needs neither swapping entanglement technology nor unitary operations, in which quantum devices are expensive and difficult to implement. Finally, it is generalized to multi-party QPC (MQPC) protocol. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

Attribute-Based Data Sharing Scheme with Flexible Search Functionality for Cloud-Assisted Autonomous Transportation system

引用

IEEE Transactions on Industrial Informatics 2023年第11期19卷 10977-10986页

作者： Xiong, Hu Wang, Hanxiao Meng, Weizhi Yeh, Kuo-Hui University of Electronic Science and Technology of China School of Information and Software Engineering Network and Data Security Key Laboratory of Sichuan Province Chengdu610054 China Advanced Cryptography and System Security Key Laboratory of Sichuan Province Chengdu610025 China Technical University of Denmark Department of Applied Mathematics and Computer Science Kongens Lyngby2800 Denmark National Dong Hwa University Department of Information Management Hualien97401 Taiwan National Sun Yat-sen University Department of Computer Science and Engineering Kaohsiung804201 Taiwan

The existing group public key encryption with equality test schemes could only support one-to-one data sharing and are not suitable for cloud-assisted autonomous transportation systems, which demand one-to-many data sharing. To tackle this problem efficiently, in this article, we put forward the group-attribute-based encryption with equality test (G-ABEET) scheme. The presented G-ABEET allows sensors equipped in vehicles to encrypt traffic data with an expressive access policy before sharing it. Only users with attributes required by the access policy ought to access the shared ciphertexts, thus achieving selective one-to-many data sharing. Meanwhile, the authorized cloud server could provide group users with equality tests over the ciphertexts, realizing ciphertext search ability. Furthermore, with the group mechanism, the G-ABEET scheme could resist offline message recovery attacks. Besides, in the standard model, we give rigorous security proof of the G-ABEET construction. The feasibility and efficiency of G-ABEET are demonstrated by experimental simulations. © 2005-2012 IEEE.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

An Industrial Control system Risk Assessment Method

An Industrial Control System Risk Assessment Method

引用

International Conference on Wavelet Active Media Technology and Information Processing (ICWAMTIP)

作者： Shu Jian Xie Qiuxia Xian Bo Wang Chenli Lu Jiazhong Huang Yuanyuan School of Cybersecurity Chengdu University of Information Technology Chengdu Sichuan China Advanced Cryptography and System Security Key Laboratory of Sichuan Province Chengdu Sichuan China

With the rapid development of information technology, the combination of industrial control system and network communication technology is widely used in energy, manufacturing, military, aerospace and transportation. Attacks against industrial control system every year are lower than those against the Internet, but they have a more significant impact on society. Therefore, risk assessment of industrial control system is the first task to prevent attacks. In this paper, we propose a risk assessment method for industrial control system, starting from the idea of game theory, combining the assessment index assignment methods of subjective hierarchy process analytic hierarchy process (AHP) and objective entropy weight method (EWM), determining the target matrix according to the weights of the two, and utilizing the approximation of the ideal solution. The final evaluation results are obtained by using the technique for order preference by similarity to ideal solution (TOPSIS). The results show that the combination of subjective and objective methods can make the weighting of assessment indicators more reasonable and effective.

关键词：

来源：评论

学校读者我要写书评

暂无评论

BPTTD: Block-Parallel Singular Value Decomposition(SVD) Based Tensor Train Decomposition 26

BPTTD: Block-Parallel Singular Value Decomposition(SVD) Base...

引用

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

作者： Meng, Fanshuo Li, Peng Fan, Weibei Zhang, Hongjun Xue, Zhuangzhuang Cheng, Haitao Nanjing University of Posts and Telecommunications School of Computer Science Nanjing210023 China Institute of Network Security and Trusted Computing Nanjing210023 China Nanjing University of Posts and Telecommunications School of Internet of Things Nanjing210023 China Advanced Cryptography and System Security Key Laboratory of Sichuan Province Chengdu610054 China

ISBN: (纸本)9798350331684

Tensors are naturally suitable for representing high-dimensional data. Tensor train decomposition is an effective data processing method to cope with high-dimensional tensors. It is widely used in many fields, such as recommendation system, data completion and dimension reduction. However, experiments show that the traditional tensor decomposition method is only suitable for processing small-scale data. With the increase of the amount of data, the traditional algorithm will not be able to meet the efficiency of processing data. Therefore, this paper improves the traditional tensor train decomposition algorithm. Based on the most crucial step - SVD in the algorithm process, we first divide the matrix into column blocks, and then, considering the storage characteristics of cache, we call multiple threads to process different submatrix blocks. Each thread calls the one-sided Jacobi algorithm respectively to parallelize the SVD process of the matrix. In this paper, performance comparison experiments are carried out on simulated tensor data. The experimental results demonstrate that this method shows good scalability and can greatly improve the speed of tensor train decomposition. © 2023 IEEE.

关键词： Singular value decomposition

来源：评论

学校读者我要写书评

暂无评论

Twitter Bot Detection with Multi-Head Attention and Supervised Contrastive Learning 21

Twitter Bot Detection with Multi-Head Attention and Supervis...

引用

21st International Computer Conference on Wavelet Active Media Technology and Information Processing, ICCWAMTIP 2024

作者： Qiang, Liu Jiazhong, Lu Yuanyuan, Huang Weisha, Zhang Jun, Lv School of Cybersecurity Xin Gu Industrial College Chengdu University of Information Technology Chengdu610225 China Advanced Cryptography and System Security Key Laboratory of Sichuan Province Chengdu610225 China SUGON Industrial Control and Security Center Chengdu610225 China School of Foreign Languages University of Electronic Science and Technology of China Chengdu611731 China Co. Ltd. China

ISBN: (纸本)9798331519254

The task of detecting bots on Twitter is an indispensable task for combating social network disinformation, curbing rumors, and managing online public opinion. However, today's social bots often disguise themselves by mimicking various aspects of real user characteristics to escape detection, which poses an unprecedented challenge to the existing Twitter bot detection task. To address this, an innovative detection method is presented in this study that improves the accuracy of Twitter bot detection by realizing the effective fusion of multi-dimensional features through the multi-head attention mechanism and applying it to a relational graph convolutional network. It also combines supervised contrastive learning to strengthen the differentiation ability of the high-latitude features. Experiments conducted on the publicly available dataset Twibot-20, compared to the baseline, the proposed method achieves approximately 1% better results in both Accuracy and the Matthews Correlation Coefficient, proving its effectiveness. © 2024 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

An Improved Certificateless Partial Blind Signature Scheme Based on Homomorphic Encryption 8th

An Improved Certificateless Partial Blind Signature Scheme B...

引用

8th International Conference on Artificial Intelligence and security , ICAIS 2022

作者： Tan, Pengfei Qin, Zhi Wan, Wunan Zhang, Shibin Zhang, Jinquan Xia, Jinyue School of Cybersecurity Chengdu University of Information Technology Chengdu610225 China Advanced Cryptography and System Security Key Laboratory of Sichuan Province Chengdu610225 China New YorkNY10041 United States

ISBN: (纸本)9783031067631

A modified Paillier homomorphic cryptography-based partial blind signature scheme is proposed to address the problems of centralized key generation in traditional blind signature schemes and the fact that the current tamper-proof protection scheme for public messages only protects them after they have been attacked or does not protect public messages. In this scheme, the certificateless idea allows the distribution of keys to be decentralized to the KGC (Public key Generation) and the user’s personal key to be protected, while the partial blind signature idea ensures that the signer’s signature is not misused and protects the signed message. The experimental results show that the use of the Paillier homomorphic encryption algorithm not only satisfies the feasible operational efficiency, but also demonstrates that the scheme can be resisted before the public message is tampered with, improving the security of the scheme in terms of security and feasibility. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

A High-Efficiency Blockchain Sharded Storage Expansion Model 8th

A High-Efficiency Blockchain Sharded Storage Expansion Model

引用

8th International Conference on Artificial Intelligence and security , ICAIS 2022

作者： Guo, Jinliang Zhang, Jinquan Wan, Wunan Qin, Zhi Pu, Huailin Zhang, Shibin Xia, Jinyue School of Cybersecurity Chengdu University of Information Technology Chengdu610225 China Advanced Cryptography and System Security Key Laboratory of Sichuan Province Chengdu610225 China New YorkNY10041 United States

ISBN: (纸本)9783031067631

Blockchain is a new decentralized storage system that combines cryptography, consensus algorithms, distributed storage and other technologies. The full node redundant storage of data on the blockchain provides extremely high security, but while the redundant storage of the blockchain improves the security of the system, it also puts a lot of storage pressure on the nodes. The storage scalability problem of the blockchain has become a shortcoming restricting the development of blockchain technology. Sharded storage is a solution to the scalability of blockchain storage. While the existing sharded storage solution relieves the storage pressure of nodes, it also increases the computing and communication consumption of nodes, and reduces the efficient of blockchain systems. This article proposes a highly efficient fragmented storage model, which classifies blocks according to the frequency and size of the blocks being accessed, and uses different storage schemes for blocks of different classifications, which reduces the storage pressure of the node while controlling the computing and communication consumption of the node. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：