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

Threshold quantum secret sharing between multi-party and multi-party

Science China(Physics,Mechanics & Astronomy) 2008年第9期51卷 1308-1315页

作者： YANG YuGuang1,2,3 & WEN QiaoYan4 1 College of computer Science and Technology,Beijing University of Technology,Beijing 100124,China 2 State key laboratory of Integrated Services network,Xidian University,Xi’an 710071,China 3 State key laboratory of information Security (Graduate University of Chinese Academy of Sciences),Beijing 100049,China 4 State key laboratory of networking and Switching Technology,Beijing University of Posts and Tele-communications,Beijing 100876,China College of Computer Science and Technology Beijing University of Technology Beijing 100124 China State Key Laboratory of Integrated Services Network Xidian University Xi’an 710071 China State Key Laboratory of Information Security (Graduate University of Chinese Academy of Sciences) Beijing 100049 China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China

A threshold quantum secret sharing (TQSS) scheme between multi-party and multi-party was proposed using a sequence of single photons,which is useful and efficient when the parties of communication are not all present. We described the process of this TQSS scheme and discussed its security. It was shown that entan-glement is not necessary for quantum secret sharing. Moreover,the theoretic effi-ciency was improved to approach 100% as almost all the instances can be used for generating the private key,and each photon can carry one bit of information. This protocol is feasible with the present-day technique.

关键词： threshold quantum secret sharing quantum cryptography single photon multi-party and multi-party

来源：评论

学校读者我要写书评

暂无评论

Quantum threshold group signature

引用

Science China(Physics,Mechanics & Astronomy) 2008年第10期51卷 1505-1514页

作者： YANG YuGuang1,2,3 & WEN QiaoYan4 1 College of computer Science and Technology, Beijing University of Technology, Beijing 100124, China 2 State key laboratory of Integrated Services network, Xidian University, Xi’an 710071, China 3 State key laboratory of information Security (Graduate University of Chinese Academy of Sciences), Beijing 100049, China 4 State key laboratory of networking and Switching Technology, Beijing University of Posts and Tele-communications, Beijing 100876, China College of Computer Science and Technology Beijing University of Technology Beijing 100124 China State Key Laboratory of Integrated Services Network Xidian University Xi’an 710071 China State Key Laboratory of Information Security Graduate University of Chinese Academy of Sciences Beijing 100049 China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China

In most situations, the signer is generally a single person. However, when the message is written on behalf of an organization, a valid message may require the approval or consent of several persons. Threshold signature is a solution to this problem. Generally speaking, as an authority which can be trusted by all members does not exist, a threshold signature scheme without a trusted party appears more attractive. Following some ideas of the classical Shamir’s threshold signature scheme, a quantum threshold group signature one is proposed. In the proposed scheme, only t or more of n persons in the group can generate the group signature and any t-1 or fewer ones cannot do that. In the verification phase, any t or more of n signature receivers can verify the message and any t-1 or fewer receivers cannot verify the validity of the signature.

关键词： threshold quantum signature trusted party quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

Novel one-hop transmission algorithm in wireless network based on network coding

引用

Dongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Southeast University (Natural Science Edition) 2008年第SUPPL. 1期38卷 213-216页

作者： Lu, Yifei Ju, Xi Tao, Jun Xia, Qin Wang, Cuihan School of Computer Science and Engineering Southeast University Nanjing 211189 China Key Library of Computer Network and Information Integration Nanjing 210096 China

To solve the problem of the efficient transmission in error-prone wireless network, an ideal transmission model based on coding group (ITCG) is proposed in this paper. Furthermore, a retransmission model based on coding group (RTCG) is introduced due to the error-prone channel in wireless network. Also, a novel transmission algorithm of retransmission model is proposed based on coding group (ARTCG). At last, through the experiment, the transmission delay and throughput of the unicast and ARTCG are separately analyzed. Simulation results show that ARTCG can improve the transmission efficiency and solve the sharp decrement of performance with the condition of node's burst error. ARTCG can keep the transmission fairness of the different data.

关键词： Wireless networks

来源：评论

学校读者我要写书评

暂无评论

Modeling and analysis of a self-learning worm based on good point set scanning

Modeling and analysis of a self-learning worm based on good ...

引用

International Wireless Communications and Mobile Computing Conference, IWCMC 2008

作者： Wang, Fangwei Zhang, Yunkai Ma, Jianfeng Key Laboratory of Computer Networks and Information Security Xidian University Xi'an 710071 China Network Center Hebei Normal University Shijiazhuang 050016 China Key Laboratory of Computer Networks and Information Security Ministry of Education Xidian University Xi'an 710071 China

ISBN: (纸本)9781424422029

In order to speed up the propagating process, the worms need to scan many IP addresses to target vulnerable hosts. However, the distribution of IP addresses is highly non-uniform, which results in many scans wasted on invulnerable addresses. Inspired by the theory of good point set, this paper proposes a new scanning strategy, referred to as good point set scanning (GPSS), for worms. Experimental results show that GPSS can generate more distinct IP addresses and less unused IP addresses than the permutation scanning. Combined with group distribution, a static optimal GPSS is derived. Since the information can not be easily collected before a worm is released, a self-learning worm with GPSS is designed. Such worm can accurately estimate the underlying vulnerable-host distribution when a sufficient number of IP addresses of infected hosts are collected. We use a modified Analytical Active Worm Propagation (AAWP) to simulate data of Code Red and the performance of different scanning strategies. Experimental results show that once the distribution of vulnerable hosts is accurately estimated, a selflearning worm can propagate much faster than other worms. © 2008 IEEE.

关键词： Scanning

来源：评论

学校读者我要写书评

暂无评论

Node-failure tolerance of topology in wireless sensor networks

引用

International Journal of network Security 2008年第2期7卷 261-264页

作者： Wang, Liang-Min Ma, Jian-Feng Guo, Yuan-Bo The Computer School Jiangsu University Zhenjiang 212013 China Key Laboratory of Computer Network and Information Security of Education Ministry Xidian University Xi'an Shaanxi 710071 China School of Electronic Technology Engineering University of PLA Zhengzhou 450004 China

Three basic questions are presented and answered in researching on nodefailure topology in wireless sensor network. First, what is the definition of nodefailure tolerance? Second, how to evaluate this tolerance abilit... 详细信息

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Components Selection Methods for Enterprise Interoperability in Multi Domain Models

引用

IFAC Proceedings Volumes 2008年第2期41卷 11919-11924页

作者： Ke FENG Xiaoping LI Qian WANG Jingjing SHAN School of Computer Science & Engineering Southeast University 210096 Nanjing P.R. China Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education

Component-based development is gradually showing its advantages in building complex systems with shorter time and less cost than traditional methods. However, mismatching and semantic are key problems in component searching process. In this paper, a function description model is proposed to precisely and completely describe the user requirements and component function based on domain models. In the component selection process, a sophisticated matching algorithm is introduced for semantic problems in matching two activity profiles derived from different domain models. A component selection method is also presented to improve interoperability for multi domain models, followed by the implemented prototype of the proposed methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Clustering control algorithm of wireless sensor networks in low probability event scenario

引用

Jisuanji Yanjiu yu Fazhan/computer Research and Development 2008年第10期45卷 1662-1668页

作者： Liu, Linfeng Jin, Shan School of Computer Science and Engineering Southeast University Nanjing 210096 China Key Laboratory of Computer Network and Information Integration Southeast University Nanjing 210096 China School of Computer Nanjing University of Posts and Telecommunications Nanjing 210003 China

In order to fulfill the task of prolonging network lifetime, the primary objective of wireless sensor network execution is to consume the battery energy efficiently. The network topology, which is the important foundation of upper layer protocols, serves as the supportive groundwork for this goal. A significant feature of WSN is application diversity;therefore the topology control techniques under different event scenarios should be obviously different. In searching for a topology control scheme that conforms to the low probability event scenario, a theoretical model of sensor networks is constructed and analyzed. Because the listening cost is the dominating power cost under the low probability event scenario. It turns out that there is consanguineous relationship between network lifetime and the k-center problem, which are dual to each other in the theoretical sense. A periodical clustering algorithm (PCA) based on k-center problem is introduced consequently. PCA is composed of three phases: neighbor discovery phase, head decision phase and node attachment phase. PCA algorithm reflects the thinking of the load balancing, while minimizing the number of cluster heads. The performance of PCA algorithm is analyzed through theoretical model and simulation experiments, which indicates that PCA algorithm can be deployed quickly, and a well-constructed topology and an effectively prolonged network lifetime can be acquired.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

An Improved Simple Power Attack against Camellia's key Schedule

引用

Wuhan University Journal of Natural Sciences 2008年第5期13卷 591-594页

作者： LIU Shuanggen NI Haiying HU Yupu LIAO Yunyan Key Laboratory of Computer Network and InformationSecurity of Ministry of Education Xidian University Xi＇an710071 Shaanxi China College of Computer Information Engineering JiangxiNormal University Nanchang 330022 Jiangxi China

This paper presents an improved simple power attack against the key schedule of Camellia. While the original attack required an exact determination of the Hamming weight of intermediate data values based on power measurements, in this paper, two types of the simple power attack are presented and shown to be tolerant of errors that might occur in the Hamming weight determinations. In practical applications of the attack, such errors are likely to occur due to noise and distortion in the power measurements and their mapping to the Hamming weights of the data. To resist these attacks, the required design rationale of key schedules and several practical countermeasures are suggested.

关键词： simple power attack Camellia key schedule Hamming weight attack

来源：评论

学校读者我要写书评

暂无评论

The research of web GIS based on Portal

The research of web GIS based on Portal

引用

Geoinformatics 2008 and Joint Conference on GIS and Built Environment: Geo-Simulation and Virtual GIS Environments

作者： Shen, Lei Duan, Weixi Ren, Yingchao Dong, Peng Wu, Lei Tan, Jian State Key Laboratory of Remote Sensing Information Sciences IRSA CAS Beijing 100101 China Super Computing Center Computer Network Information Center CAS Beijing 100190 China

ISBN: (纸本)9780819473851

With the rapid development of computer network technologies and distributed computing technologies, more and more enterprises begin to accept and use Web GIS. As a result of the thought that traditional Web GIS has focused on system, a number of existing Web GIS are isolated by each other, and facing the problems with data islands and function overlaps, which results in the waste of spatial data resources, the redundant construction of spatial information service, the difficulty of system integration and so on. All of these demands that the new generation Web GIS should focus on users, be service-oriented and be easily integrated systems. The introduction of Portal can solve difficulties above. This paper studies how to bring in Portal in the process of designing and developing Web GIS to solve the difficulties of resource integration and the personalized services of users. And the author has successfully implemented a Web GIS Portal based on JSR 168 Java Portlet Specification. The facts have proved that a Web GIS developed by Portal can provide users with better user experience and be easily integrated with other application systems. © 2008 SPIE.

关键词： Portals

来源：评论

学校读者我要写书评

暂无评论

Threshold proxy quantum signature scheme with threshold shared verification

引用

Science China(Physics,Mechanics & Astronomy) 2008年第8期51卷 1079-1088页

作者： YANG YuGuang1,3,4 & WEN QiaoYan2 1 College of computer Science and Technology,Beijing University of Technology,Beijing 100124,China 2 State key laboratory of networking and Switching Technology,Beijing University of Posts and Tele-communications,Beijing 100876,China 3 State key laboratory of Integrated Services network,Xidian University,Xi’an 710071,China 4 State key laboratory of information Security(Graduate University of Chinese Academy of Sciences) ,Beijing 100049,China 1. College of Computer Science and Technology Beijing University of Technology Beijing 100124 China 3. State Key Laboratory of Integrated Services Network Xidian University Xi’an 710071 China 4. State Key Laboratory of Information Security (Graduate University of Chinese Academy of Sciences) Beijing 100049 China 2. State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China

A threshold proxy quantum signature scheme with threshold shared verification is proposed. An original signer could authorize a group as its proxy signers. Then only t or more of n persons in the proxy group can generate the proxy signature on behalf of the original signer and any t-1 or fewer ones cannot do that. When the proxy signature needs to be verified,any t or more of n persons belonging to the verification group can verify the message and any t-1 or fewer ones cannot verify the validity of the proxy signature.

关键词： quantum signature threshold proxy quantum group signature threshold shared verification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：