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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Coarse-to-fine sentence-level emotion classification based on the intra-sentence features and sentential context 12

Coarse-to-fine sentence-level emotion classification based o...

引用

21st ACM International Conference on Information and Knowledge Management, CIKM 2012

作者： Xu, Jun Xu, Ruifeng Lu, Qin Wang, Xiaolong Key Laboratory of Network Oriented Intelligent Computation Shenzhen Graduate School Harbin Institute of Technology Shenzhen China Department of Computing Hong Kong Polytechnic University Hong Kong Hong Kong

ISBN: (纸本)9781450311564

This paper proposes a novel approach using a coarse-to-fine analysis strategy for sentence-level emotion classification which takes into consideration of similarities to sentences in training set as well as adjacent sentences in the context. First, we use intra-sentence based features to determine the emotion label set of a target sentence coarsely through the statistical information gained from the label sets of the k most similar sentences in the training data. Then, we use the emotion transfer probabilities between neighboring sentences to refine the emotion labels of the target sentences. Such iterative refinements terminate when the emotion classification converges. The proposed algorithm is evaluated on Ren-CECps, a Chinese blog emotion corpus. Experimental results show that the coarse-to-fine emotion classification algorithm improves the sentence-level emotion classification by 19.11% on the average precision metric, which outperforms the baseline methods. © 2012 ACM.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

A secure message delivery scheme with path tracking for delay tolerant networks

A secure message delivery scheme with path tracking for dela...

引用

2012 1st IEEE International Conference on Communications in China, ICCC 2012

作者： Jia, Zhongtian Raffay, Muhammad Ali Li, Lixiang Lin, Xiaodong Yang, Yixian Shandong Provincial Key Laboratory of Network Based Intelligent Computing University of Jinan Jinan 250022 China Information Security Center Beijing University of Posts and Telecommunications Beijing 100876 China Faculty of Business and Information Technology University of Ontario Institute of Technology Oshawa ON L1H 7K4 Canada

ISBN: (纸本)9781467328159

In delay tolerant networks (DTNs), message delivery is operated in an opportunistic way through store-carry and forward relaying, and every DTN node is in anticipation of cooperation for data forwarding from others. Unfortunately, there always exist some selfish nodes that are reluctant to contribute to this cooperative data forwarding procedure so as to save their valuable storage buffer, limited computation power and precious energy. In order to stimulate nodes' willingness to participate in data forwarding, a number of incentive schemes have been proposed recently. However, most existing incentive schemes simply ignore efforts of nodes involved in message delivery if messages delivered fail to reach their destinations. Due to the nature of DTN, such as intermittent connectivity, it is not unusual to have unreliable message delivery, which results in unrewarded or wasted efforts for participating nodes and may discourage them from participating in future data forwarding. Therefore, it is crucial to recognize contribution of every node involved in a data forwarding procedure even the message it helps to forward doesn't successfully reach its destination. However, how to track all delivery paths so as to give every intermediate node some incentive for their cooperative efforts of data forwarding is still an open research problem. To address this problem, we propose a secure message forwarding scheme with path tracking. The proposed method is end-to-end secure with data source and identity authentication. In addition, it can thwart some well known attacks including edge inserting attack, sibling inserting attack and free riding attack. © 2012 IEEE.

关键词： Delay tolerant networks

来源：评论

学校读者我要写书评

暂无评论

security Analysis of an Electronic Commerce Protocol Using Casper/FDR2

引用

Wuhan University Journal of Natural Sciences 2012年第6期17卷 499-503页

作者： CHANG Yinlong HU Huaping Department of Mathematics and Computer Science/Key Laboratory of Information Security of Network System Fuzhou UniversityFuzhou 350108FujianChina School of Computer Science National University of Defense TechnologyChangsha 410073HunanChina

Researchers have proposed several security protocols to protect the electronic commerce security in these years;however,not all of them are secure *** article extends model checking method with Casper/FDR2 to model and analyze a new electronic *** are found in the protocol and their mechanisms are discussed.A variety of solutions are given to different security *** improved protocol is proven to be robust and secure.

关键词： Casper FDR2 electronic commerce model checking formal analysis

来源：评论

学校读者我要写书评

暂无评论

Tele-AR system based on real-time camera tracking

Tele-AR system based on real-time camera tracking

引用

2012 International Conference on Virtual Reality and Visualization, ICVRV 2012

作者： Wang, Yanke Zhong, Fan Li, Chao Xiang, Hui Peng, Qunsheng Qin, Xueying School of Computer Science and Technology Shandong University Jinan China Shandong Provincial Key Laboratory of Network Based Intelligent Computing Jinan China State Key Lab. of CAD and CG Zhejiang University Hangzhou China

ISBN: (纸本)9780769548364

We propose a visual tele-AR system, which is a combination of tele-existence and AR techniques. By wearing a video see-through HMD and moving his head, a user in this system is able to tele-operate a remote pan-tilt platform to observe the remote scene. Unlike traditional tele-existence systems which use mechanical or magnetic sensors for tele-operation, we propose a novel tele-operation method based on real-time tracking of master and slave cameras. The master camera is a component of the video see-through HMD mounted in front of user's eyes, while the slave camera is carried by a remote platform. We estimate use's head motion by tracking the master camera in real time, and translate head motions into motion commands to drive the remote pan-tilt platform. Ideally, motion of the remote platform will be exactly the same as user's head. Unfortunately, motion speed of the slave platform is usually limited by their mechanical capability, which may cause pose inconsistence between master and slave cameras, especially when user's head moves fast. We solve this problem by also tracking slave camera in real time, and warping video images according to difference between master and slave camera pose. Since slave camera is tracked, we can integrate virtual objects into remote scene, giving the user an augmented visual sense. To reduce system delay, our implementation is accelerated GPU parallel computation. Experimental results show the efficiency and robustness of our method. © 2012 IEEE.

关键词： Augmented reality

来源：评论

学校读者我要写书评

暂无评论

In-field testing of NAND flash storage: Why and how?

In-field testing of NAND flash storage: Why and how?

引用

2012 IEEE 21st Asian Test Symposium, ATS 2012

作者： Hu, Yu Gu, Xinli Li, Xiaowei State Key Laboratory of Computer Architecture Institute of Computing Technology CAS Beijing China North America Network Division Huawei Technologies Co. Ltd Santa Clara United States

ISBN: (纸本)9780769548760

NAND Flash memories have rapidly emerged as a storage class memory such as SSD, CF Card, SD Card. Due to its distinct operation mechanisms, NAND Flash memory suffers from erase/program endurance, data retention and program/read disturbance problems. In this work, we propose an in-field testing technique which takes some pages in a block as predictors. We will discuss the proposed technique in detail in the poster session. © 2012 IEEE.

关键词： NAND circuits

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Improving WTLS protocol using identity-based cryptography

Improving WTLS protocol using identity-based cryptography

引用

6th International Conference on Management of e-Commerce and e-Government, ICMeCG 2012

作者： Yu, Dai-Rong Qi, Zhen-Hua Wang, Yan Ma, Bing-Xian Shandong Provincial Key Laboratory of Network Based Intelligent Computing University of Jinan Jinan China Senior Engineering School of Liaocheng Liaocheng China Electronic Department Shandong College of Electronic Technology Jinan China

ISBN: (纸本)9781467329439

IBC is emerging as an important contender to traditional public key cryptography for its attractive properties. But the Wireless Transport Layer security (WTLS) protocol does not support it at present. To resolve this problem, an improved WTLS protocol based on IBC (IB-WTLS) is proposed. Firstly, new cipher suits are designed for WTLS protocol, which give support to IBC scheme. Secondly, the IBC-based authentication is implemented by using IBC public-keys instead of X.509 public-keys. At last, IB-WTLS protocol message architecture is improved by defining a set of entity interaction operation sequences. The results show that IB-WTLS have advantages of lightweight and efficiency of IBC, as well as easy to deploy. © 2012 IEEE.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：