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

2016 International Conference on Sustainable Energy, Environment and Information Engineering (SEEIE 2016)

作者： Jin SUN Yu-pu HU Department of Application Mathematics in Xi'an University of Technology Key Lab of Computer Network and Information Security Xidian University

According to the broadcast encryption scheme couldn't consider its security and efficiency in one model simultaneously, a full secure attribute-based broadcast encryption achieved through selective techniques was proposed. The scheme can achieve constant-size ciphertext in the standard model. By utilizing the prior techniques to prove selective security for functional encryption systems as a direct ingredient in devising proofs of full security, it is proved by combining the dual system encryption argument and the static assumptions. The analysis results show that the scheme of this paper is full secure.

关键词： Attribute-based encryption Broadcast encryption Dual system CP-ABBE

来源：评论

学校读者我要写书评

暂无评论

Distributed energy balanced routing for wireless sensor network using energy prediction metric

Distributed energy balanced routing for wireless sensor netw...

引用

International Conference on Information Science and Control Engineering

作者： Quan Guo Xiaoying Song Liaoning Key Lab of Network Security and Computing Technology Dalian Neusoft Information Institute College of Computer Science and Engineering Northeastern University

ISBN: (纸本)9781509025367

A considerable amount of energy efficient routing algorithms have been proposed to save energy and prolong network lifetime. Those algorithms mainly focus on forwarding packets along the minimum energy path to the sink to merely minimize energy consumption, which causes an unbalanced distribution of residual energy among sensor nodes, and eventually results in a network partition. In this paper, we propose a distributed energy balanced routing algorithm using energy prediction metric (EBEP). The routing scheme considers not only efficient energy but also energy balance. Firstly, with the help of Markov chain model and state conversion model, the future residual energy of front neighbor nodes can be predicted so that it is the most important local information when a node makes routing decision. Furthermore, the function of cost is adopted by our EBEP routing algorithm in order to synthetically evaluate and then select the best candidate of next step. Finally, the experimental results demonstrate the performance advantages of our EBEP routing algorithm.

关键词： Wireless sensor networks Balancing energy consumption Energy-efficient routing Markov chain model Residual energy

来源：评论

学校读者我要写书评

暂无评论

Chosen-ciphertext secure bidirectional proxy broadcast re-encryption schemes

引用

International Journal of Information and Communication technology 2016年第4期8卷 405-419页

作者： Sun, Jin Hu, Yupu Department of Application Mathematics Xi'an University of Technology Xi'an710048 China Key Lab. of Computer Network and Information Security Xidian University Xi'an710071 China

A proxy re-encryption (PRE) scheme supports the delegation of decryption rights via a proxy, who makes the ciphertexts decryptable by the delegatee. However, how to structure a chosen-ciphertext secure proxy re-encryption scheme without pair is still an open question. In this paper, by adjusting the Schnorr signature scheme and giving the accessional ciphertext components, a bidirectional (which the proxy is able to transform ciphertexts in both directions) proxy broadcast re-encryption schemes (PBRE) was proposed without pair, and the reduction of scheme's security is the computational Diffie-Hellman (CDH) assumption. The proof of security shows that the proposed scheme is chosen-ciphertext attack secure in the random oracle model. Copyright © 2016 Inderscience Enterprises Ltd.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Avoiding optimal mean robust PCA/2DPCA with non-greedy 1-norm maximization 25

Avoiding optimal mean robust PCA/2DPCA with non-greedy 1-nor...

引用

25th International Joint Conference on Artificial Intelligence, IJCAI 2016

作者： Luo, Minnan Nie, Feiping Chang, Xiaojun Yang, Yi Hauptmann, Alexander Zheng, Qinghua Shaanxi Province Key Lab of Satellite-Terrestrial Network Department of Computer Science Xi'An Jiaotong University China School of Computer Science Center for Optical Imagery Analysis and Learning Northwestern Polytechnical University China Centre for Quantum Computation and Intelligent Systems University of Technology Sydney Australia School of Computer Science Carnegie Mellon University PA United States

Robust principal component analysis (PCA) is one of the most important dimension reduction techniques to handle high-dimensional data with outliers. However, the existing robust PCA presupposes that the mean of the data is zero and incorrectly utilizes the Euclidean distance based optimal mean for robust PCA with 1-norm. Some studies consider this issue and integrate the estimation of the optimal mean into the dimension reduction objective, which leads to expensive computation. In this paper, we equivalently reformulate the maximization of variances for robust PCA, such that the optimal projection directions are learned by maximizing the sum of the projected difference between each pair of instances, rather than the difference between each instance and the mean of the data. Based on this reformulation, we propose a novel robust PCA to automatically avoid the calculation of the optimal mean based on 1-norm distance. This strategy also makes the assumption of centered data unnecessary. Additionally, we intuitively extend the proposed robust PCA to its 2D version for image recognition. Efficient non-greedy algorithms are exploited to solve the proposed robust PCA and 2D robust PCA with fast convergence and low computational complexity. Some experimental results on benchmark data sets demonstrate the effectiveness and superiority of the proposed approaches on image reconstruction and recognition.

关键词： Image recognition

来源：评论

学校读者我要写书评

暂无评论

Debugging Multithreaded Programs as if They Were Sequential

Debugging Multithreaded Programs as if They Were Sequential

引用

International Conference on Software Analysis, Testing and Evolution (SATE)

作者： Xiaodong Zhang Zijiang Yang Qinghua Zheng Yu Hao Pei Liu Lechen Yu Ming Fan Ting Liu Ministry of Education Key Lab for Intelligent Networks and Network Security Xi'an Jiaotong University Xi'an Shaanxi China Department of Computer Science Western Michigan University Kalamazoo MI USA

ISBN: (纸本)9781509045181

Debugging multithreaded software is challenging because the basic assumption that underlies sequential software debugging, i.e. the program behavior is deterministic under fixed inputs, is no longer valid due to the nondeterminism brought by thread scheduling. In this paper, we propose a proactive debugging method to restore this basic assumption so that programmers can debug multithreaded programs as if they were sequential. Our approach is based on the synergistic integration of a set of new symbolic analysis and dynamic analysis techniques. In particular, symbolic analysis is used to investigate the program behavior under multiple thread interleavings and then drive the dynamic execution to new branches. Dynamic analysis is used to execute these new branches and in turn guide the symbolic analysis further. The net effect of applying this feedback loop is a systematic and complete coverage of the program behavior under a fixed test input. We have implemented the proposed method in a software tool called Proactive-Debugger. Our experiments show that Proactive-Debugger outperforms both ESBMC and Maple, two state-of-the-art testing tools for detecting and reproducing bugs in multithreaded programs.

关键词： Debugging Instruction sets Software debugging Performance analysis Schedules Semantics Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Cryptanalysis of quantum secret sharing with d-level single particles

引用

Physical Review A 2016年第6期93卷 062343-062343页

作者： Song Lin Gong-De Guo Yong-Zhen Xu Ying Sun Xiao-Fen Liu School of Mathematics and Computer Science Fujian Normal University Fuzhou 350007 China Key Lab of Network Security and Cryptography Fujian Normal University Fuzhou 350007 China Beijing Electronic Science and Technology Institute Beijing 100070 China

In a recent paper [V. Karimipour and M. Asoudeh, Phys. Rev. A 92, 030301(R) (2015)], a multiparty quantum secret-sharing protocol based on d-level single particles was proposed. We discussed the security of this protocol and found that it is not secure for any one dishonest participant who can recover the secret without the aid of other participants.

关键词： Quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

CRM: A new dynamic cross-layer reputation computation model in wireless networks

引用

computer Journal 2015年第4期58卷 656-667页

作者： Lin, Hui Hu, Jia Ma, Jianfeng Xu, Li Yang, Li Key Lab of Network Security and Cryptology Fujian Normal University Fuzhou China Department of Mathematics and Computer Science Liverpool Hope University LiverpoolL16 9JD United Kingdom Shanxi Key Laboratory of Network and System Security Xidian University Xi'an Shaanxi China

Multi-hop wireless networks (MWNs) have been widely accepted as an indispensable component of next-generation communication systems due to their broad applications and easy deployment without relying on any infrastructure. Although showing huge benefits, MWNs face many security problems, particularly the internal multi-layer security threats being one of the most challenging issues. Since most security mechanisms require the cooperation of nodes, characterizing and learning actions of neighboring nodes and the evolution of these actions over time is vital to constructing an efficient and robust solution for security-sensitive applications such as social networking, mobile banking and teleconferencing. In this paper, we propose a new dynamic Cross-layer Reputation computation Model (CRM) to dynamically characterize and quantify actions of nodes. CRM couples an uncertainty-based conventional layered reputation computation model (RCM) with cross-layer design and multi-level security technology to identify malicious nodes and preservation of security against internal multi-layer threats. Simulation results and performance analyses demonstrate that CRM can provide rapid and accurate malicious node identification and management, and implement the preservation of security against the internal multi-layer and bad-mouthing attacks more effectively and efficiently than existing models. © The British computer Society 2014. All rights reserved.

关键词： network security

来源：评论

学校读者我要写书评

暂无评论

security-Aware Routing and Core Allocation in Elastic Optical network with Multi-core

Security-Aware Routing and Core Allocation in Elastic Optica...

引用

International Conference on Computational Intelligence and security

作者： Hejun Xuan Yuping Wang Shanshan Hao Zhanqi Xu Xiaodong Li Xiaozhi Gao School of Computer Science and Technology Xidian University Xi'an Shaanxi China School of Computer Science and Information Technology Royal Melbourne Institute of Technology Melbourne Australia State Key Lab of Integrated Service Network Xidian University Xi'an Shaanxi China School of Engineering Science Lappeenranta University of Technology Finland

ISBN: (纸本)9781509048410

The routing, core allocation and spectrum assignment (RSA) problem in elastic optical networks with multi-core is a well-known NP-hard problem and the network information security is also an important problem in elastic optical networks. In this paper, we combine these two problems to investigate the routing, core allocation and spectrum assignment problem with the guaranteed secure level in elastic optical network with multi-core. We establish a new optimization model to determine an optimal routing, core allocation scheme with the guaranteed secure level by minimizing the maximum sequence number of frequency slots. To solve the model effectively, we propose a hybrid algorithm for routing and core allocation. First, the candidate secure paths, which can guarantee the required secure level for connection requests, are determined by using a heuristic algorithm. Then, to get an optimal routing and core allocation scheme, an effective genetic algorithm with a tailor-made crossover operator and a well-designed mutation operator is designed. Finally, simulation experiments are conducted, and the experimental results indicate that the effectiveness of the proposed model and algorithm.

关键词： Routing Resource management Optical fiber networks Sociology Statistics Multicore processing security

来源：评论

学校读者我要写书评

暂无评论

A new model for nickname detection based on network structure and similarity propagation

A new model for nickname detection based on network structur...

引用

IEEE Symposium on computers and Communications (ISCC)

作者： Zhaoli Liu Tao Qin Dan Zhao Xiaohong Guan Tao Yang MoE Key Lab for Intelligent Networks and Network Security Xi'an Jiaotong University Xi'an Shaanxi China Tsinghua National Laboratory for Information Science and Technology Tsinghua University Beijing China Department of Automation Northwestern Polytechnical University Xi'an China

ISBN: (纸本)9781509006809

Users can participate in variety topics and express their opinions using different kinds of online applications, and the IDs (nickname) they used are usually virtual and difficult for finding the physical person. Which pose great challenges for network security management and user's online behavior supervision. Focus on this problem, we proposed methods for nickname detection based on the user's online connection structure and similarity propagation model. Firstly, we collected user's profile information from two popular online applications, sina microblog and RenRen network. Then we mark several matched pairs which belong to the same person from the applications with hardly manually effort, and those IDs are selected as seed set for nickname detection. Secondly, we proposed an nickname detection model based on the connection structure and similarity propagation. We selected one matched pairs from the seed set and obtain all their neighbors. Then we calculated the similarity of each pairs from the neighbor set and calculate their neighbors' connection similarity and neighbors' location similarity. If the similarity is bigger than a selected threshold, we claim they are matched pairs and insert them into the seed sets. On one hand, the correlation results can propagated based on the updated seed set. On the other hand, the computational complexity are greatly reduced as we only employ the neighbors' profiles to calculate the similarity. Experimental results verify the efficiency of the proposed method, which can lay a solid foundation for the online network management and user's behavior supervision.

关键词： Measurement

来源：评论

学校读者我要写书评

暂无评论

The design and implementation of network attack and defense platform based on cloud desktop

引用

Journal of Physics: Conference Series 2017年第1期887卷

作者： Zining Yan Yunhan Wang Shijiao Shao Boquan Li Embedded System Lab. College of Computer Science and Technology Harbin China Institute of Information Engineering Chinese Academy of Sciences School of Cyber Security University of Chinese Academy of Sciences Key Laboratory of Network Assessment of Technology Chinese Academy of Sciences Beijing China

This paper discusses the cloud desktop technology, virtualization technology and penetration testing technology used in the network attack and defense training platform, and introduces the design and implementation process of the network attack and defense training platform. This paper focuses on the cloud desktop construction scheme based on B/S structure, and aims to enhance the flexibility and convenience of network attack and defense training platform.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：