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

Efficient (t, n) secret sharing scheme against cheating

Journal of Computational information Systems 2012年第9期8卷 3815-3821页

作者： Liu, Yanxiao Zhang, Yuqing Hu, Yupu Key Lab. of Computer Networks and Information Security of Ministry of Education Xidian University China National Computer Network Intrusion Protection Center GUCAS China

A (t, n) secret sharing (SS) scheme can be divided into two protocols: share generation protocol and secret reconstruction protocol. In share generation protocol, a mutually trusted dealer selects a secret and distributes shares to shareholders secretly;in secret reconstruction protocol, a group of t qualified shareholders pool their shares together to reconstruct the secret. However, in secret reconstruction protocol, dishonest shareholders (i.e., cheaters) can pool forged shares to fool honest shareholders. By this way, the cheaters can recover the legitimate secret exclusively, and the honest shareholders get nothing but a fake secret. In this paper, we propose a (t, n)SS that is capable of detecting such cheating fact efficiently. Our scheme is an extension of Shamir's (t, n)SS that uses a symmetric bivariate polynomial. In addition, our scheme adopts no security assumption, it is unconditional secure. © 2011 by Binary information Press.

关键词： Shareholders

来源：评论

学校读者我要写书评

暂无评论

Research on Separation of Three Powers Architecture for Trusted OS

引用

Physics Procedia 2012年 25卷 1168-1175页

作者： Yu Li Yong Zhao Siyuan Xin College of Computer Science and Technology Beijing University of Technology Beijing 100124 China Key Lab of Information Network Security Ministry of Public Security Shanghai 201204 China Institute of Electronic Technology the PLA Information Engineering University

The privilege in the operating system (OS) often results in the break of confidentiality and integrity of the system. To solve this problem, several security mechanisms are proposed, such as Role-based Access Control, Separation of Duty. However, these mechanisms can not eliminate the privilege in OS kernel layer. This paper proposes a Separation of Three Powers Architecture (STPA). The authorizations in OS are divided into three parts: System Management Subsystem (SMS), security Management Subsystem (SEMS) and Audit Subsystem (AS). Mutual support and mutual checks and balances which are the design principles of STPA eliminate the administrator in the kernel layer. Furthermore, the paper gives the formal description for authorization division using the graph theory. Finally, the implementation of STPA is given. Proved by experiments, the Separation of Three Powers Architecture we proposed can provide reliable protection for the OS through authorization division.

关键词： Separation of Three Powers Architecture Authorization Graph Separation of Privilege Trusted Operating System

来源：评论

学校读者我要写书评

暂无评论

Research on Separation of Three Powers Architecture for Trusted OS

Research on Separation of Three Powers Architecture for Trus...

引用

2012 International Conference on Solid State Devices and Materials Science(SSDMS 2012)

作者： Yu Li Yong Zhao Siyuan Xin College of Computer Science and Technology Beijing University of Technology Key Lab of Information Network Security Ministry of Public Security Institute of Electronic Technology the PLA Information Engineering University

The privilege in the operating system(OS) often results in the break of confidentiality and integrity of the system. To solve this problem, several security mechanisms are proposed, such as Role-based Access Control, Separation of Duty. However, these mechanisms can not eliminate the privilege in OS kernel layer. This paper proposes a Separation of Three Powers Architecture(STPA). The authorizations in OS are divided into three parts: System Management Subsystem(SMS), security Management Subsystem(SEMS) and Audit Subsystem(AS). Mutual support and mutual checks and balances which are the design principles of STPA eliminate the administrator in the kernel layer. Furthermore, the paper gives the formal description for authorization division using the graph theory. Finally, the implementation of STPA is given. Proved by experiments, the Separation of Three Powers Architecture we proposed can provide reliable protection for the OS through authorization division.

关键词： Separation of Three Powers Architecture Authorization Graph Separation of Privilege Trusted Operating System

来源：评论

学校读者我要写书评

暂无评论

Fully Secure Broadcast Encryption for Inner-Product Predicates

引用

Procedia Engineering 2012年 29卷 316-320页

作者： Sun Jin Hu Yu-pu Department of Application Mathematics in Xi’an University of Technology Xi’an 710048 China Key Lab of Computer Network and Information Security Xidian University Xi’an 710071 China

According to the broadcast encryption scheme with wide applications in the real world without considering its security and efficiency in the model simultaneously, a fully secure broadcast encryption for inner-product predicates (IPBE) was proposed by combining with Waters dual system encryption methodology and inner-product predicate encryption. Based on the standard model, the scheme can not only achieve constant-size key and ciphertext, but also guarantee the security of the plaintext M as well as the security of the attribute vectors. Furthermore, the scheme is proved by using a non-interactive static assumption and the analysis results indicated that the scheme is fully secure.

关键词： broadcast encryption full security inner-product predicate encryption provably secure

来源：评论

学校读者我要写书评

暂无评论

CCA-secure unidirectional proxy broadcast re-encryption in the standard model

引用

Journal of Computational information Systems 2012年第14期8卷 5909-5916页

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

Considering construct a chosen-ciphertext secure unidirectional PRE in the adaptive corruption model is still an important question and the broadcast encryption with wide applications in the real world, the first CCA-secure unidirectional proxy broadcast re-encryption (PBRE) scheme was proposed under the standard model. By using a new ciphertext component in our scheme, the challenger enable to successfully generate the challenge ciphertext for the adversary, even if the adversary is allowed to adaptively corrupt users. Simultaneously, the PBRE scheme is proven chosen-ciphertext security in the adaptive corruption model. Compared with the best known existing unidirectional PRE scheme, new scheme enjoy the advantages of both higher efficiency and stronger security. © 2011 by Binary information Press.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

MOEA/D with iterative thresholding algorithm for sparse optimization problems

MOEA/D with iterative thresholding algorithm for sparse opti...

引用

12th International Conference on Parallel Problem Solving from Nature, PPSN 2012

作者： Li, Hui Su, Xiaolei Xu, Zongben Zhang, Qingfu Institute for Information and System Sciences Key Lab. for Intelligent Networks and Network Security Xi'an Jiaotong University Xi'an Shaanxi 710049 China School of Computer Science and Electronic Engineering University of Essex Wivenhoe Park Colchester CO4 3SQ United Kingdom

ISBN: (纸本)9783642329630

Currently, a majority of existing algorithms for sparse optimization problems are based on regularization framework. The main goal of these algorithms is to recover a sparse solution with k non-zero components(called k-sparse). In fact, the sparse optimization problem can also be regarded as a multi-objective optimization problem, which considers the minimization of two objectives (i.e., loss term and penalty term). In this paper, we proposed a revised version of MOEA/D based on iterative thresholding algorithm for sparse optimization. It only aims at finding a local part of trade-off solutions, which should include the k-sparse solution. Some experiments were conducted to verify the effectiveness of MOEA/D for sparse signal recovery in compressive sensing. Our experimental results showed that MOEA/D is capable of identifying the sparsity degree without prior sparsity information. © 2012 Springer-Verlag.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Privacy-preserving Path-Inclusion Protocol through Oblivious Automata

Privacy-preserving Path-Inclusion Protocol through Oblivious...

引用

2012 IEEE International Conference on Intelligent Control, Automatic Detection and High-End Equipment (IEEE 2012智能控制、自动检测与高端装备国际会议(ICADE 2012))

作者： Meishan Huang Bogang Lin Yang Yang College of Mathematics and Computer Science Fuzhou University Fuzhou China Key Lab of Information Security of Network Systerm Fuzhou University Fujian Province

This paper focuses on path-inclusion secure two-party computation problem,and an efficient protocol for securely computing the path-inclusion problem is *** problem is defined in the two parties setting,where Alice and Bob both have a *** goal of Bob is to learn whether his path is included by the path Alice holds,without revealing it to Alice or learning anything else about Alice's *** construction is based on an automata evaluation *** our protocol,each path is coded into a string which reserves all information about the original *** both parties are involved in the automata evaluation *** one of them can learn whether one path includes the other one.

关键词： Path-inclusion automata evaluation String matching secure multi-party computation

来源：评论

学校读者我要写书评

暂无评论

The new multipoint relays selection in OLSR using particle swarm optimization

引用

Telkomnika 2012年第2期10卷 343-352页

作者： Malik, Reza Firsandaya Rahman, Tharek Abdul Ngah, Razali Hashim, Siti Zaiton Mohd. Communication Network and Security Research Lab Faculty of Computer Science Universitas Sriwijaya Indonesia Wireless Communication Centre Faculty of Electrical Engineering Universiti Teknologi Malaysia Faculty of Computer Science and Information Systems Universiti Teknologi Malaysia

The standard optimized link state routing (OLSR) introduces an interesting concept, the multipoint relays (MPRs), to mitigate message overhead during the flooding process. This paper propose a new algorithm for MPRs selection to enhance the performance of OLSR using particle swarm optimization sigmoid increasing inertia weight (PSOSIIW). The sigmoid increasing inertia weight has significance improve the particle swarm optimization (PSO) in terms of simplicity and quick convergence towards optimum solution. The new fitness function of PSOSIIW, packet delay of each node and degree of willingness are introduced to support MPRs selection in OLSR. The throughput, packet loss and end-toend delay of the proposed method are examined using network simulator 2 (ns2). Overall results indicate that OLSR-PSOSIIW has shown good performance compared to the standard OLSR and OLSR-PSO, particularly for the throughput and end-to-end delay. Generally the proposed OLSR-PSOSIIW shows advantage of using PSO for optimizing routing paths in the MPRs selection algorithm. © 2012 Universitas Ahmad Dahlan.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

State-of-the-art virtualization security in cloud computing

引用

Journal of information and Computational Science 2012年第6期9卷 1487-1497页

作者： Qin, Zhongyuan Zhang, Qunfang Wan, Changsheng Di, Yuxing Information Science and Engineering School Southeast University Nanjing 210096 China Key Lab of Information Network Security Ministry of Public Security 201204 China Computer Department Nanjing Institute of Artillery Corps Nanjing 211132 China Communication Department Nanjing Institute of Artillery Corps Nanjing 211132 China

Cloud computing is an active and prosperous field of computer science, both academically and industrially. Meanwhile, security is one of major concerns that may prevent the wide acceptance of cloud computing. In particular, as the key technique behind cloud computing, virtualization may be vulnerable to many attacks. In this paper, we review and classify the state-of-the-art virtual machine security techniques according to their roles in the virtual machine architecture, i.e., at the hardware level, as the hypervisor and inside the virtual machines. Finally, we discuss additional problems that remain to be addressed. © 2012 by Binary information Press.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Malware Detection in Smartphone Using Hidden Markov Model

Malware Detection in Smartphone Using Hidden Markov Model

引用

International Conference on Multimedia information networking and security (MINES)

作者： Kejun Xin Gang Li Zhongyuan Qin Qunfang Zhang Nanjing Sample Technology Co. Ltd. Nanjing Jiangsu China Ministry of Public Security Key Lab of Information Network Security Shanghai China Computer Department Nanjing Institute of Artillery Corps Nanjing Jiangsu China

ISBN: (纸本)9781467330930

In recent years, smart phone technology is becoming increasingly popular. The dangers of mobile phone malwares are becoming more and more serious. In this paper we present a new mobile smartphone malware detection scheme based on Hidden Markov Model (HMM) which is different from the traditional signature scanning methods. Firstly, we monitor the key press and system function call sequence, and take the key press as hidden state. After decoding HMM model, abnormal process can be detected using the matching rate of HMM output to the actual key press sequence. The experimental results demonstrate that the proposed method can effectively detect mobile malwares.

关键词： Hidden Markov models Malware Presses Mobile communication computers Mathematical model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：