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

Forward secure threshold signature scheme in the standard model

International Journal of computers and Applications 2012年第2期34卷 98-104页

作者： Hao, Rong Yu, Jia Li, Jing Song, Zhiling College of Information Engineering Qingdao University 266071 Qingdao China Shandong Provincial Key Laboratory of Computer Network 250014 Jinan China

There is an inherit weakness in regular digital signatures. If private key is exposed, all signatures will be insecure no matter whether they were generated before key exposure or not. Forward secure signatures and forward secure threshold signatures are proposed to deal with this problem. In this work, we propose a forward secure threshold signature scheme in the standard model. The complexity of each parameter in this scheme is at most log-squared in terms of the total number of time periods. Another important trait is that the signature only comprises one-time tag and triple group elements. In the end, we prove that the proposed scheme is forward secure without random oracles.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

An energy-efficient routing algorithm of zigbee network

引用

Journal of Computational information Systems 2012年第23期8卷 9873-9879页

作者： Liu, Yongshan Chen, Wei Shang, Xuehui Lv, Yongteng Han, Yuanyuan Liu, Chang College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao 066004 China

As regard to the case of extending the lifetime of zigbee network, the defination of node's boundary is proposed. First, all the information for node's boundary is stored when zigbee network is built. Then, the packet between the nodes which are in the node's boundary is transferred directly. The packet between the nodes whose boundaries are adjacent is transferred through the node with maximum energy. The exprimental results show that the new algorithm can efficiently extend the lifetime of zigbee network. ©2012 by Binary information Press.

关键词： Zigbee

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

BPSS:BUFFERING- AND PREDICTION- BASED SLEEP SCHEME FOR WIRELESS SENSOR networkS

BPSS:BUFFERING- AND PREDICTION- BASED SLEEP SCHEME FOR WIREL...

引用

2012 IEEE 2nd International Conference on Cloud Computing and Intelligence Systems

作者： Yijun Zhu Yanjun Li Yihua Zhu School of Computer Science and Technology Zhejiang University of Technology Zhejiang Provincial Key Laboratory of Information Network Technology

Energy saving is a critical concern in wireless sensor networks (WSNs). Usually, duty cycle is applied to reduce the energy expended by radio transceiver of nodes. In this paper, a Buffering- and Prediction- based Sleep Scheme (BPSS) is proposed for WSNs. The proposed BPSS is featured by that only relay nodes are allowed to duty cycle whereas sample nodes not, a buffer is set at each sample node to hold the data captured by the sample nodes for the events occurring during the sleeping period of relay nodes, and the relay nodes predict the occurrence times of events according to exponentially weighted moving average with a decay parameter so as to set their sleeping periods adapting to event traffic. The proposed BPSS is implemented on TinyOS and TelosW motes and experiments show the BPSS is able to reduce energy consumption while maintaining high event reception ratio in the sink node.

关键词： Wireless sensor networks Duty cycle Event reception ratio Energy saving

来源：评论

学校读者我要写书评

暂无评论

Virtual grid-based clustering of uncertain data on vulnerability database

引用

Journal of Convergence information Technology 2012年第20期7卷 429-438页

作者： Dong, Jun Cao, Mengmeng Huang, Guoyan Ren, Jiadong College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao 066004 China

Most existing vulnerability taxonomy classifies vulnerabilities by their idiosyncrasies, weaknesses, flaws and faults et al. The disadvantage of the taxonomy is that the classification standard is not unified and there is overlap classification phenomenon in vulnerability taxonomy. In order to solve the problem, we will propose an algorithm VUNClique, Virtual Grid-based Clustering of Uncertain Data on vulnerability database. Firstly, this paper transforms the vulnerability database into uncertain dataset using the existing vulnerability database pretreatment model. Secondly, we define a Virtual grid structure, the cells are divided into real cells and virtual cells, but only the real cells which contain data objects stored in memory. The probability attribute value similarity is defined to deal with the similarity of non-numeric attributes, which compares the number of non-numeric attributes with the same value between tuples to measure the similarity. We provide a secondary partition algorithm to improve the similarity between the tuples in the same cell, the algorithm merges a tuple into it's high-density neighbor cell which has the maximum value of probability attribute value similarity with it. Then, a novel identify cluster algorithm is provided to cluster the high-density real cells. It can identify clusters of arbitrary shapes by traversing real cells twice. Finally, performance experiments over the uncertain dataset transformed by NVD vulnerability database. The experiments results show that VUNClique can find clusters of arbitrary shapes, and greatly improve the efficiency of clustering.

关键词： Cells

来源：评论

学校读者我要写书评

暂无评论

A high dimensional data clustering algorithm based on hypergraph

引用

Journal of Computational information Systems 2012年第23期8卷 9839-9846页

High dimensional data clustering is an important issue for data mining. Firstly, the records in the dataset are mapped to the vertices of hypergraph, the hyperedges of hypergraph are composed of the vertices which have the same value on one certain attributes. Then a multilevel hypergraph partitioning algorithm is used to find k parts of the hypergraph. Finally, the clusters with good quality are choosed out by computing the value of clusters validity. The experimental results show that the new algorithm can efficiently construct high quality clusters. ©2012 by Binary information Press.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Fourth Normal Form and Free Redundancy for XML Document Based on Path Expression

Fourth Normal Form and Free Redundancy for XML Document Base...

引用

International Conference on computer Science and network Technology

作者： Zhongping Zhang Zhixiao Liu College of Information Science and Engineering The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University College of Information Science and Engineering Yanshan University

ISBN: (纸本)9781467329637

With eXtensible Markup Language (XML) becoming more and more popular, to avoid the redundancy, XML schema design has become an important issue. So the normalization of XML is a hotspot in research field. Similar to relational database, this paper is database based with the goal of eliminating the data redundancy, to study the concepts of path expression in Document Type Definition (DTD). In this paper, XML is extended with functional dependency (XFD) and multi-valued dependency (XMVD), which are fundamental to semantic specification. And make formalized definitions on XFD and XMVD;Based on the concepts of XML tree and data dependency, it provides the description of key and redundancy. On the condition of the coexistence of XFD and XMVD, it further proposes the terms to meet the fourth normal form (4XNF) and provides theorem to determine the XML document tree which meets the above terms without redundancy, and the sound of the 4XNF is proved by experiment.

关键词： Normalization Functional dependency Multi-valued dependency key Redundancy The fourth normal form redundancy XML document extensible markup language normalization data redundancy data dependency

来源：评论

学校读者我要写书评

暂无评论

A clustering algorithm for heterogeneous objects based on information dissimilarity

引用

Journal of Convergence information Technology 2012年第22期7卷 93-100页

作者： Chen, Ziyang Wang, Xuefeng Ren, Jiadong College of Information Science and Engineering Yanshan University Qinhuangdao City 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao City 066004 China

Due to the introduction of weight of attributes, most of existing dissimilarity measures can not accurately reflect the difference between two heterogeneous objects, and then clustering quality was decreased. In this paper, we present HIDK-means, an approach for clustering heterogeneous data based on information dissimilarity. At first, the algorithm defines heterogeneous information dissimilarity between two heterogeneous objects based on Kolmogorov information theory, and calculates approximately heterogeneous information dissimilarity by a universal probability of an object. Then, in the clustering process, the algorithm selects the initial cluster centers by maximum sum of dissimilarity. After that, each remaining object is assigned to a cluster center which has the smallest dissimilarity with it and the criterion function is calculated. Iteratively, cluster centers are updated and the process is ceased until the criterion function converges or the iteration number reaches the pre-set threshold. The experimental results show that the proposed algorithm HIDK-means is effective in clustering heterogeneous objects and also scalable to large datasets.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An algorithm based on temporary table for mining top-k closed frequent patterns in data streams

International Journal of Digital Content Technology and its ...

引用

International Journal of Digital Content Technology and its Applications 2012年第20期6卷 582-589页

作者： Wang, Peilong Yang, Xuan Zhang, Yuanyuan Ren, Jiadong College of Information Science and Engineering Yanshan University Qinhuangdao City 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao City 066004 China

In this paper, we present an algorithm TKBT(top-k closed frequent mining based on TKTT) to mine top-k closed frequent itemsets in data streams efficiently. First according to the consecutive and changeable characteristics of the data from data streams in sliding window, a novel structure, BWT(bit-vector window table) is defined. In BWT horizontal direction we use bit vectors to express the transactions, record the count of items in the oldest, the newest window and all the windows a t current time, which decreases the calculating time of the items count when a new window slides in. In BWT vertical direction we set window partition, which makes us just need replace the oldest window information with the corresponding newest window when a new window comes. The construction of TKTT (top-k temporary table) is based on BWT. The itemsets in TKTT are ranked in a descending count order. TKBT can get top-k closed frequent itemsets by connecting the candidates in TKTT using top-down strategy. The candidate number is reduced by using closed itemset displace its subset and less connection times are contributed to the less runtime. Experiment results show that TKBT is very effective and scalable.

关键词： Closed frequent item sets Data streams Sliding window Top-K

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：