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

PS-HOMO: A Protection Scheme for iOS SMS

Journal of Physics: Conference Series 2020年第2期1486卷

作者： Guomiao Zhou Qianqiong Wu Ming Duan Qi Xi State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Henan 450000 China Institute of Electrical Engineering and Automation Luoyang Institute of Science and Technology Luoyang Henan 471000 China

iOS Short Message Service (SMS) transmits messages in plaintext, which would lead to potential security threats of data. It is meaningful to design a safe and effective SMS. In this paper, all iOS Security Guides are referred to and all the cryptographic algorithms in iOS data protection are analyzed. Because there is no homomorphic encryption, a library of homomorphic encryption algorithms for iOS based on RSA and Paillier is developed. Using this library, a protection scheme PS-HOMO for protecting iOS SMS data is proposed and implemented. Under the premise of ensuring the data confidentiality, PS-HOMO also has the function of ciphertext operation due to the multiplicative homomorphism of RSA and additive homomorphism of Paillier. A comprehensive performance test was performed on PS-HOMO. The results show that the performance is in line with our expectations and will not have a major impact on the original system. The security of PS-HOMO is theoretically analyzed from man-in-the-middle attack, replay attack, and traffic analysis attack. Two application scenarios of the PS-HOMO, remote anonymous voting and privacy telemedicine service are envisaged. We hope PS-HOMO would play a significant role in privacy protection.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improved Impossible Polytopic Attacks on Round-reduced DES

引用

Journal of Physics: Conference Series 2020年第3期1486卷

作者： Jing Wang Qianqiong Wu Chaohui Fu Guomiao Zhou Ming Duan State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Henan 450000 China College of electrical engineering and automation Luoyang Institute of Science and Technology Luoyang Henan 471000 China

In Eurocrypt 2016, Tyge Tiessen introduced the d-difference which considering the differences between multiple plaintexts, and proposed the impossible polytopic attack on block cipher which effectively reducing the data complexity. In this paper, we improve the impossible polytopic attacks of round-reduced DES by some ideas like truncated differentials. Given the input 3-difference of each S-box in the third round, the number of the output 3-difference is actually smaller than the theoretical upper bound, which helps us reduce the memory complexity of the attack on 5-round DES from 212 bytes to 26.9 bytes and increase the success rate of the attack. Using the idea of truncated differentials, the time complexity of the attack on 6-round DES is reduced from 232.2 encryptions to 225.8 encryptions by selecting the output 3-differences of 6 S-boxes for key recovery. We also improve the attack on 7-round DES by using more plaintexts based on our improved attack on 6-round DES.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Integrating a weighted-average method into the random walk framework to generate individual friend recommendations

引用

Science China(Information Sciences) 2017年第11期60卷 43-64页

作者： Jibing GONG Xiaoxia GAO Hong CHENG Jihui LIU Yanqing SONG Mantang ZHANG Yi ZHAO School of Information Science and Engineering Yanshan University The Key Lab for Computer Virtual Technology and System Integration Yanshan University State Key Lab of Mathematical Engineering and Advanced Computing Department of Systems Engineering and Engineering Management The Chinese University of Hong Kong

Friend recommendation is a fundamental service in both social networks and practical applications,and is influenced by user behaviors such as interactions, interests, and activities. In this study, we first conduct in-depth investigations on factors that affect recommendation results. Next, we design Friend++, a hybrid multi-individual recommendation model that integrates a weighted average method(WAM) into the random walk(RW) framework by seamlessly employing social ties, behavior context, and personal information. In Friend++, the first plus signifies recommending a new friend through network features, while the second plus stands for using node features. To verify our method, we conduct experiments on three social datasets crawled from the Sina microblog system(Weibo). Experimental results show that the proposed method significantly outperforms six baseline methods in terms of recall, precision, F1-measure, and MAP. As a final step, we describe a case study that demonstrates the scalability and universality of our method. Through discussion, we reach a meaningful conclusion: although common interests are more important than user activities in making recommendations, user interactions may be the most important factor in finding the most appropriate potential friends.

关键词： multi-individual friend recommendation architecture behavior context analysis Intimacy degree random walk framework social networks

来源：评论

学校读者我要写书评

暂无评论

Universally composable anonymous password authenticated key exchange

引用

Science China(Information Sciences) 2017年第5期60卷 153-168页

作者： Xuexian HU Jiang ZHANG Zhenfeng ZHANG Jing XU Trusted Computing and Information Assurance Laboratory Institute of SoftwareChinese Academy of Sciences State Key Laboratory of Mathematical Engineering and Advanced Computing Science and Technology on Information Assurance Laboratory State Key Laboratory of Cryptology

Anonymous password authenticated key exchange(APAKE) is an important cryptographic primitive, through which a client holding a password can establish a session key with a server both authentically and anonymously. Although the server is guaranteed that the client in communication is from a pre-determined group, but the client’s actual identity is protected. Because of their convenience, APAKE protocols have been widely studied and applied to the privacy protection research. However, all existing APAKE protocols are handled in stand-alone models and do not adequately settle the problem of protocol composition, which is a practical issue for protocol implementation. In this paper, we overcome this issue by formulating and realizing an ideal functionality for APAKE within the well-known universal composability(UC) framework, which thus guarantees security under the protocol composition operations. Our formulation captures the essential security requirements of APAKE such as off-line dictionary attack resistance, client anonymity and explicit mutual authentication. Moreover, it addresses the arbitrary probabilistic distribution of passwords. The construction of our protocol, which utilizes SPHF-friendly commitments and CCA2-secure encryption schemes, can be instantiated and proven secure in the standard model, i.e., without random oracle heuristics.

关键词： anonymous password authentication key exchange universal composability provable security standard model

来源：评论

学校读者我要写书评

暂无评论

Stealthy Malware Detection Based on Deep Neural Network

引用

Journal of Physics: Conference Series 2020年第1期1437卷

作者： Shoupu Lu Qingbao Li Xinbing Zhu State Key laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Henan Province 450001 China Henan University of Economics and Law Zhengzhou Henan Province 450000 China

Network attacks using advanced local hiding technology have not only increased, but also become a serious threat. However, attacks using these technologies can not be detected through traffic detection, and some attacks imitate benign traffic to avoid detection. To solve these problems, a malware process detection method based on process behavior in possibly infected terminals is proposed. In this method, a deep neural network is introduced to classify malware processes. Firstly, the recurrent neural network is trained to extract the characteristics of process behavior. Secondly, training convolutional neural network is used to classify feature images generated by trained RNN features. The experiments results show that this method can effectively extract the features of malicious processes, and the AUC of ROC curve is 0.97 in the best case.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Binary neural networks: A survey

arXiv

引用

arXiv 2020年

作者： Qin, Haotong Gong, Ruihao Liu, Xianglong Bai, Xiao Song, Jingkuan Sebe, Nicu State Key Lab of Software Development Environment Beihang University Beijing China Beijing Advanced Innovation Center for Big Data-Based Precision Medicine Beihang University Beijing China Center for Future Media School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China Department of Information Engineering and Computer Science University of Trento Trento Italy School of Computer Science and Engineering Beijing Advanced Innovation Center for Big Data and Brain Computing Jiangxi Research Institute Beihang University Beijing China

The binary neural network, largely saving the storage and computation, serves as a promising technique for deploying deep models on resource-limited devices. However, the binarization inevitably causes severe information loss, and even worse, its discontinuity brings difficulty to the optimization of the deep network. To address these issues, a variety of algorithms have been proposed, and achieved satisfying progress in recent years. In this paper, we present a comprehensive survey of these algorithms, mainly categorized into the native solutions directly conducting binarization, and the optimized ones using techniques like minimizing the quantization error, improving the network loss function, and reducing the gradient error. We also investigate other practical aspects of binary neural networks such as the hardware-friendly design and the training tricks. Then, we give the evaluation and discussions on different tasks, including image classification, object detection and semantic segmentation. Finally, the challenges that may be faced in future research are prospected. Copyright © 2020, The Authors. All rights reserved.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

A loop unrolling method based on machine learning 32

A loop unrolling method based on machine learning

引用

32nd International Conference on Vibroengineering

作者： Liu, Hui Guo, Zhanjie State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450001 China College of Computer and Information Engineering Henan Normal University Xinxiang453007 China Department of Electrical and Electronic Engineering Zhengzhou Technical College Zhengzhou450121 China

In order to improve the accuracy of loop unrolling factor in the compiler, we propose a loop unrolling method based on improved random decision forest. First, we improve the traditional random decision forest through adding weight value. Second, BSC algorithm based on SMOTE algorithm is proposed to solve the problem of unbalanced data sets. Nearly 1000 loops are selected from several benchmarks, and features extracted from these loops constitute the training set of the loop unrolling factor prediction model. The model has a prediction accuracy of 81 % for the unrolling factor, and the existing Open64 compiler gives 36 % only. © 2018 Hui Liu, et al.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Higher-order nodal points in two dimensions

arXiv

引用

arXiv 2021年

作者： Wu, Weikang Liu, Ying Yu, Zhi-Ming Zhao, Y.X. Gao, Weibo Yang, Shengyuan A. Research Laboratory for Quantum Materials Singapore University of Technology and Design Singapore487372 Singapore Division of Physics and Applied Physics School of Physical and Mathematical Sciences Nanyang Technological University Singapore637371 Singapore School of Materials Science and Engineering Hebei University of Technology Tianjin300130 China Beijing Key Lab of Nanophotonics & Ultrafine Optoelectronic Systems School of Physics Beijing Institute of Technology Beijing100081 China National Laboratory of Solid State Microstructures Department of Physics Nanjing University Nanjing210093 China Collaborative Innovation Center of Advanced Microstructures Nanjing University Nanjing210093 China

A two-dimensional (2D) topological semimetal is characterized by the nodal points in its low-energy band structure. While the linear nodal points have been extensively studied, especially in the context of graphene, the realm beyond linear nodal points remains largely unexplored. Here, we explore the possibility of higher-order nodal points, i.e., points with higher-order energy dispersions, in 2D systems. We perform an exhaustive search over all 80 layer groups both with and without spin-orbit coupling (SOC), and reveal all possible higher-order nodal points. We show that they can be classified into two categories: the quadratic nodal point (QNP) and the cubic nodal point (CNP). All the 2D higher-order nodal points have twofold degeneracy, and the order of dispersion cannot be higher than three. QNPs only exist in the absence of SOC, whereas CNPs only exist in the presence of SOC. Particularly, the CNPs represent a new topological state not known before. We show that they feature nontrivial topological charges, leading to extensive topological edge bands. Our work completely settles the problem of higher-order nodal points, discovers novel topological states in 2D, and provides detailed guidance to realize these states. Possible material candidates and experimental signatures are discussed. Copyright © 2021, The Authors. All rights reserved.

关键词： Dispersions

来源：评论

学校读者我要写书评

暂无评论

Discovery of a maximally charged Weyl point

arXiv

引用

arXiv 2022年

作者： Chen, Qiaolu Chen, Fujia Yan, Qinghui Zhang, Li Gao, Zhen Yang, Shengyuan A. Yu, Zhi-Ming Chen, Hongsheng Zhang, Baile Yang, Yihao Interdisciplinary Center for Quantum Information State Key Laboratory of Modern Optical Instrumentation ZJU-Hangzhou Global Scientific and Technological Innovation Center Zhejiang University Hangzhou310027 China International Joint Innovation Center Key Lab. of Advanced Micro Nano Electronic Devices & Smart Systems of Zhejiang The Electromagnetics Academy Zhejiang University Zhejiang University Haining314400 China Jinhua Institute of Zhejiang University Zhejiang University Jinhua321099 China Department of Electrical and Electronic Engineering Southern University of Science and Technology Shenzhen518055 China Research Laboratory for Quantum Materials Singapore University of Technology and Design 487372 Singapore School of Physics Beijing Institute of Technology Beijing100081 China Beijing Key Laboratory of Nanophotonics and Ultrafine Optoelectronic Systems School of Physics Beijing Institute of Technology Beijing100081 China Division of Physics and Applied Physics School of Physical and Mathematical Sciences Nanyang Technological University 21 Nanyang Link 637371 Singapore Centre for Disruptive Photonic Technologies The Photonics Institute Nanyang Technological University 50 Nanyang Avenue 639798 Singapore

The hypothetical Weyl particles in high-energy physics have been discovered in three-dimensional crystals as collective quasiparticle excitations near two-fold degenerate Weyl points1-5. Such momentum-space Weyl particles carry quantized chiral charges, which can be measured by counting the number of Fermi arcs emanating from the corresponding Weyl points. It is known that merging unit-charged Weyl particles can create new ones with more charges6. However, only very recently has it been realised that there is an upper limit - the maximal charge number that a two-fold Weyl point can host is four - achievable only in crystals without spin-orbit coupling7-9. Here, we report the experimental realisation of such a maximally charged Weyl point in a three-dimensional photonic crystal. The four charges support quadruple-helicoid Fermi arcs, forming an unprecedented topology of two non-contractible loops in the surface Brillouin zone. The helicoid Fermi arcs also exhibit the long-pursued type-II van Hove singularities that can reside at arbitrary momenta. This discovery reveals a type of maximally charged Weyl particles beyond conventional topological particles in crystals. Copyright © 2022, The Authors. All rights reserved.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Power-Aware Data Management Based on Hybrid RAM-NVM Memory for Smart Bracelet

引用

Journal of Electronic Science and Technology 2017年第4期15卷 385-390页

作者： Jin-Yu Zhan Jun-Huan Yang Wei Jiang Yi-Xin Li Yi-Ming Zhang School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu 610054 China State Key Lab of Mathematical Engineering and Advanced Computing Wuxi 214000China

Wearable devices become popular because they can help people observe health *** battery life is the critical problem for wearable devices. The non-volatile memory(NVM) attracts attention in recent years because of its fast reading and writing speed, high density, persistence, and especially low idle power. With its low idle power consumption,NVM can be applied in wearable devices to prolong the battery lifetime such as smart bracelet. However, NVM has higher write power consumption than dynamic random access memory(DRAM). In this paper, we assume to use hybrid random access memory(RAM)and NVM architecture for the smart bracelet *** paper presents a data management algorithm named bracelet power-aware data management(BPADM) based on the architecture. The BPADM can estimate the power consumption according to the memory access, such as sampling rate of data, and then determine the data should be stored in NVM or DRAM in order to satisfy low power. The experimental results show BPADM can reduce power consumption effectively for bracelet in normal and sleeping modes.

关键词： Hybrid memory non-volatile memory(NVM) power-aware smart bracelet

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：