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

14th International Conference on information security and Cryptology, ICISC 2011

作者： Du, Yusong Zhang, Fangguo Liu, Meicheng School of Information Science and Technology Sun Yat-sen University Guangzhou 510006 China Key Lab. of Network Security and Cryptology Fujian Normal University Fuzhou 350007 China State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Beijing 100190 China

ISBN: (纸本)9783642319112

Boolean functions with large algebraic immunity resist algebraic attacks to a certain degree, but they may not resist fast algebraic attacks (FAA's). It is necessary to study the resistance of Boolean functions against FAA's. In this paper, we localize the optimal resistance of Boolean functions against FAA's and introduce the concept of e-fast algebraic immunity (e-FAI) for n-variable Boolean functions against FAA's, where e is a positive integer and . We give the sufficient and necessary condition of e-FAI. With e-FAI the problem of deciding the resistance of an n-variable Boolean function against FAA's can be converted into the problem of observing the properties of one given matrix. An algorithm for deciding e-FAI and the optimal resistance against FAA's is also described. © 2012 Springer-Verlag.

关键词： Boolean functions

来源：评论

学校读者我要写书评

暂无评论

PASS: An adaptive multi-copy routing scheme for intermittently connected mobile Ad Hoc networks

引用

Journal of Convergence information Technology 2012年第14期7卷 315-323页

作者： Xu, Jia Wang, Ru Chuan Sun, Li Juan College of Computer Nanjing University of Posts and Telecommunications Nanjing China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing China Key Lab of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Ministry of Education Jiangsu Province Nanjing China Key Laboratory for Computer Network and Information Integration Southeast University Ministry of Education Nanjing China State Key Lab. for Novel Software Technology Nanjing University Nanjing China

Intermittently Connected Mobile Ad Hoc networks (ICMANs) are mobile networks in which complete source-to-destination paths do not exist most of the time. This paper proposed a Predictable Adaptive Seed Spray routing (PASS) for intermittently connected mobile Ad Hoc networks. PASS is a cost-efficient delay-bounded routing protocol without network parameters and provides acceptable and resilient service in the face of challenged environments. Simulations have shown that PASS outperforms existing schemes such as Epidemic, binary spray & wait and AMR with respect to routing cost and adaptability.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

Binary particle swarm optimization with multiple evolutionary strategies

引用

Science China(information Sciences) 2012年第11期55卷 2485-2494页

作者： ZHAO Jing1,HAN ChongZhao1 & WEI Bin2 1Ministry of Education key lab For Intelligent networks and network security,State key laboratory for Manufacturing Systems Engineering,Institute of Integrated Automation,School of Electronics and information Engineering,Xi'an Jiaotong University,Xi'an 710049,China 2Institute of System Engineering,School of Electronics and information Engineering,Xi'an Jiaotong University,Xi'an 710049,China 1. Ministry of Education Key Lab For Intelligent Networks and Network Security State Key Laboratory for Manufacturing Systems Engineering Institute of Integrated Automation School of Electronics and Information Engineering Xi’an Jiaotong University Xi’an 710049 China2. Institute of System Engineering School of Electronics and Information Engineering Xi’an Jiaotong University Xi’an 710049 China

This paper introduces a novel variation of binary particle swarm optimization(BPSO) algorithm and a further extension to improve its ***,mimicking the behaviors of some creatures group,multiple evolutionary strategies BPSO(MBPSO) is introduced which takes different evolutionary strategies for various particles according to their ***,on the basis of MBPSO,a new strategy is discussed to improve the performance of the MBPSO(M2BPSO) which adopts the concept of the mutation operator aiming to overcome the premature convergence and slow convergent speed during the later stages of the *** proposed two algorithms are tested on seven benchmark functions and their results are compared with those obtained by other *** results show that our methods outperform the other algorithms.

关键词： binary particle swarm optimizer evolutionary strategies swarm intelligence

来源：评论

学校读者我要写书评

暂无评论

Intrusion-resilient identity-based signature: security definition and construction

Intrusion-resilient identity-based signature: Security defin...

引用

作者： Yu, Jia Kong, Fanyu Cheng, Xiangguo Hao, Rong Fan, Jianxi College of Information Engineering Qingdao University 266071 Qingdao China Shandong Provincial Key Laboratory of Computer Network 250014 Jinan China Institute of Network Security Shandong University 250100 Jinan China School of Computer Science and Technology Soochow University 215006 Suzhou China

Traditional identity-based signatures depend on the assumption that secret keys are absolutely secure. Once a secret key is exposed, all signatures associated with this secret key have to be reissued. Therefore, limiting the impact of key exposure in identity-based signature is an important task. In this paper, we propose to integrate the intrusion-resilient security into identity-based signatures to deal with their key exposure problem. Compared with forward-secure identity-based signatures and key-insulated identity-based signatures, our proposal can achieve higher security. The proposed scheme satisfies that signatures in any other time periods are secure even after arbitrarily many compromises of base and signer, as long as the compromises do not happen simultaneously. Furthermore, the intruder cannot generate signatures pertaining to previous time periods, even if she compromises base and signer simultaneously to get all their secret information. The scheme enjoys nice average performance. There are no cost parameters including key setup time, key extract time, base (signer) key update time, base (signer) key refresh time, signing time, verifying time, and signature size, public parameter size, base (signer) storage size having complexity more than O(log T) in terms of the total number of time periods T in this scheme. We also give the security definition of intrusion-resilient identity-based signature scheme and prove that our scheme is secure based on this security definition in the random oracle model assuming CDH problem is hard. © 2011 Elsevier Inc.

关键词： network security

来源：评论

学校读者我要写书评

暂无评论

High capacity steganographic method based upon quantization error of JPEG

High capacity steganographic method based upon quantization ...

引用

2012 2nd International Conference on computer Application and System Modeling, ICCASM 2012

作者： Dong, Xiuze Liu, Shu Zhang, Ru Niu, Xinxin Wang, Lifeng Information Security Center Beijing University of Posts and Telecommunications Beijing 100876 China Electronic and Information Engineering Department Beijing Electronic Science and Technology Institute Beijing 100070 China Key Laboratory of Information Network Security Ministry of Public Security Shanghai 201204 China Computer Science and Technology Department Beijing Electronic Science and Technology Institute Beijing 100070 China

ISBN: (纸本)9789491216008

Quantizing Error during the process of JPEG compression is analyzed, and a new information hiding algorithm is proposed based on Quantizing Error of JPEG image. Experimental results show that the proposed algorithm can provide a high capacity information hiding and keep the visual quality well, also the produced stego-image are almost identical to the original cover images. © The Authors.

关键词： Image compression

来源：评论

学校读者我要写书评

暂无评论

SSOP: Secure Storage Outsourcing Protocols in Mobile Cloud Computing

SSOP: Secure Storage Outsourcing Protocols in Mobile Cloud C...

引用

2012 IEEE 14th International Conference on Communication Technology

作者： Xiao Liu Rui Jiang Huafeng Kong School of Information Science and Engineering Southeast University Key Lab of Information Network Security Ministry of Public Security

ISBN: (纸本)9781467321006

With the rapid spread of Smartphones and the development of access technologies such as 3G 4G Wifi and LTE,mobile cloud computing has greatly enhanced the storage and computing ability of mobile ***,a series of security problems have been brought ***,Wei Ren et al present resilient storage outsourcing schemes to secure storage outsourcing in mobile cloud computing,which are resilient to storage compromise on mobile devices and do not assume that trusted cloud servers are *** this paper,we present detailed analysis of these three resilient storage outsourcing schemes-ShS,CoS and EnS proposed by Wei Ren et al and point out these schemes have security ***,we propose SSOP (Secure Storage Outsourcing Protocols) which can keep the frame of the former schemes and overcome their security ***,we make the security analysis of our improved protocols,which can keep the merits of the former schemes and have higher security.

关键词： mobile cloud computing cloud storage security protocols

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Evolutionary cryptography theory based generating method for a secure Koblitz elliptic curve and its improvement by a hidden Markov models

引用

Science China(information Sciences) 2012年第4期55卷 911-920页

作者： WANG Chao 1,ZHANG HuanGuo 2,3 & LIU LiLi 4 1 key lab of Specialty Fiber Optics and Optical Access network,Ministry of Education,Shanghai University,Shanghai 200072,China 2 computer School of Wuhan University,Wuhan 430072,China 3 key laboratory of Aerospace information security and Trusted Computing Ministry of Education,Wuhan 430072,China 4 Huawei Technologies CO.LTD.,Shanghai 201206,China 1. Key Lab of Specialty Fiber Optics and Optical Access Network Ministry of Education Shanghai University Shanghai 200072 China2. Computer School of Wuhan University Wuhan 430072 China3. Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education Wuhan 430072 China4. Huawei Technologies CO. LTD. Shanghai 201206 China

Considering potential attacks from cloud-computing and quantum-computing,it is becoming nec-essary to provide higher security elliptic *** hidden Markov models are introduced for designing the trace-vector computation algorithm to accelerate the search for elliptic curve (EC) *** present a new algorithm for secure Koblitz EC generation based on evolutionary cryptography *** algorithm is tested by selecting a secure Koblitz EC over the field F(2 2000),with experiments showing that both the base field and base point of the secure curve generated exceed the parameter range for Koblitz curves recommended by *** base fields generated go beyond 1900 bits,which is higher than the 571 bits recommended by *** also find new secure curves in the range F(2 163)-F(2 571) recommended by *** perform a detailed security analysis of those secure curves,showing that those we propose satisfy the same security criteria as NIST.

关键词： secure EC selection evolutionary cryptography theory ant colony algorithm Koblitz EC HMM

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A fault-tolerant multicast tree approach based on the family hierarchy tunnel

A fault-tolerant multicast tree approach based on the family...

引用

16th International Conference on Mechatronics Technology, ICMT 2012

作者： Zhou, Yan-Ling Shen, Yu-Feng Key Lab. of Network and Intelligent Information Processing Department of Computer Science and Technology University Hefei Anhui China Computer Science and Technology Anhui Sanlian University Hefei Anhui China

ISBN: (纸本)9787900769428

Fault-tolerant recovery in Multicast communication is an important issue. An ideal multicast fault-tolerant approach can save network resources, reduce the delay and cost, realize quick recovery. In this paper, we propose a new multicast fault-tolerant approach-FH-TFTM based on proposed multicast fault-tolerant algorithms. It can go over problems faced in traditional approaches, for example node failure, unpredictable problems, time delay, network cost and loop avoidance. FH-TFTM can reduce consuming network resources, and carry out effectively setting up backup paths.

关键词： Recovery

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：