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

7th International Conference on Intelligent information Hiding and Multimedia Signal Processing, IIHMSP 2011

作者： Ma, Guojun Pei, Qingqi Wang, Yuchen Jiang, Xiaohong State Key Laboratory of Integrated Services Networks Xidian University Xi'an China School of Electronic Engineering University of Electronic Science and Technology of China Chengdu China Key Lab. of Computer Networks and Information Security Ministry of Education Xidian University Xi'an China

ISBN: (纸本)9780769545172

Content sharing is one of the most significant issues of Digital Rights Management (abbr. DRM). Various schemes for content sharing have been presented in the past years. However, the main goals of these schemes are to solve portability problems instead of rational sharing between different users who are not family members. In this work, we propose an initial step toward this rational sharing and present a general sharing model based on proxy re-encryption. Our model can support the flexible sharing mechanism, with which the user can choose any of the purchased content to share with any legal device, and the content provider can know and limit the number of sharing devices to achieve some novel DRM policies such as pay-per-sharing. To our best knowledge, our sharing model is the first model for content sharing between different users' devices who are not family members using proxy re-encryption. With rational applications, our model can benefit for both the user and content provider to achieve win-win development. © 2011 IEEE.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Updatable key Management Scheme with Intrusion Tolerance for Unattended Wireless Sensor network

Updatable Key Management Scheme with Intrusion Tolerance for...

引用

2011 IEEE Global Telecommunications Conference - GLOBECOM 2011

作者： Liang-min Wang Tao Jiang Xiao-yan Zhu Department of Computer Science Jiangsu University Zhenjiang China Key Laboratory of Computer Network and Information Security of Education Ministry Xidian University Xi'an China

An Unattended Wireless Sensor network (UWSN) collects the sensing data by using mobile sinks (MSs). It differs from the traditional multi-hop wireless sensor networks in which unbalanced traffic makes the sensors close to the base station deplete their power earlier than others. An UWSN can save the battery power and prolong the network lifetime. Unfortunately, MSs would be given too much privilege when acting as the collecting base station, which will cause security concern if compromised. Besides, UWSNs are usually deployed in unreachable and hostile environments, where sensors can be easily compromised. Thus, their security issues should be carefully addressed to deal with node compromise. In this paper, we present a novel key management scheme to secure UWSNs. We employ the Blundo symmetric polynomial mechanism to guard against the newly compromised nodes in a period while utilizing the periodic key updating based on the reverse hash chain to block the compromised nodes and revoke the compromised MSs if failing the authentication. We show that our scheme is robust against node compromised attacks and carry out comparison analysis on the intrusion-tolerance ratio, communication and computing overhead.

关键词： Peer to peer computing Polynomials Sensors security Wireless sensor networks Silicon Mobile communication

来源：评论

学校读者我要写书评

暂无评论

Conflict-free transmission schedule based on network coding in wireless networks

Conflict-free transmission schedule based on network coding ...

引用

International Conference on Communications and Mobile Computing

作者： Wang, Jing Liu, Xiangyang Wang, Xinmei School of Information Engineering Chang'an University Xi'an China Computer Network Teaching Office Xi'an Communication College Xi'an China State Key Lab. of Integrated Service Networks Xidian University Xi'an China

ISBN: (纸本)9780769543574

In wireless networks, the cross-layer design of joint medium access control and network coding can avoid destructive interferences among concurrent transmissions. Wireless network codes in conjunction with conflict-free network realizations are designed by Sagduyu. Then, this paper proposed a new conflict-free transmission schedule based on network coding to achieve better network performance. We construct sub tree graphs by sub tree decomposition, and based on the achieved sub tree graphs, time slots are assigned from the first sub tree. Nodes of the latter sub trees can be chosen to combine with the front time slots according to whether there exist conflicts or not. Finally, network codes allocation method for network with two sources is presented, which adopts the theory of graph coloring. © 2011 IEEE.

关键词： Wireless networks

来源：评论

学校读者我要写书评

暂无评论

An efficient remote data possession checking in cloud storage

International Journal of Digital Content Technology and its ...

引用

International Journal of Digital Content Technology and its Applications 2011年第4期5卷 43-50页

作者： Chen, Lanxiang Guo, Gongde School of Mathematics and Computer Science Fujian Normal University Fuzhou 350108 China Key Lab of Network Security and Cryptology Fuzhou 350108 China

As cloud storage can achieve the goal that getting all storage resources in a plug-and-play way, it becomes a focus of attention. It has the advantages of high scalability, ease-of-use, cost-effectiveness and simplifying infrastructure planning etc. However, because of security and reliability, cloud storage is not widely adopted. When users store their data in cloud storage, they mostly concern about whether the data is intact. This is the goal of remote data possession checking (RDPC) schemes. This paper proposes an efficient RDPC scheme. It has several advantages as follows. First, it is efficient in terms of computation and communication. Second, it allows verification without the need for the challenger to compare against the original data. Third, it uses only small challenges and responses, and users need to store only two secret keys and several random numbers. Finally, a challenge updating method is proposed based on Euler's theorem.

关键词： Cloud storage

来源：评论

学校读者我要写书评

暂无评论

RepHi: A Novel Attack against P2P Reputation Systems

RepHi: A Novel Attack against P2P Reputation Systems

引用

IEEE Conference on computer Communications Workshops

作者： Jingyu Feng Yuqing Zhang Shenglong Chen Anmin Fu Key Lab of Computer Networks and Information Security of Ministry of Education Xidian University Xi'an 710071 China

ISBN: (纸本)9781424499199

Reputation systems are having increasing influence on guarding P2P networks. However, reputation systems themselves are vulnerable to attack. Due to the nature of aggregating ratings, the reputation scores of certain peers can be manipulated intentionally by adversaries. In this paper, we report the discovery of a novel attack, named RepHi (Reputation Hijack), against rating-based reputation systems, such as those used in P2P networks. In RepHi, attackers disguise as routers to hijack and modify ratings. This attack can cause multi-dimensional damage, that is, undermining reputation systems, manipulating reputation and hurting the credibility of raters. We conduct an investigation on RepHi, including basic ideas and case studies. Compared with other known attacks, the RepHi attackers require less efforts to achieve the similar goals.

关键词： P2P Trust Reputation Hijack security

来源：评论

学校读者我要写书评

暂无评论

Abuse-freeness Electronic Payment Protocol

Abuse-freeness Electronic Payment Protocol

引用

International Conference on Intelligent networking and Collaborative Systems (INCOS)

作者： Kai Fan Yue Wang Hui Li Ministry of Edu. Key Laboratory of Computer Network and Information Security Xidian University Xi'an China Shaanxi Telecom Limited Xi'an China

Abuse-freeness is one of the most interesting new problems in the electronic payment security today. It is an effective supplementary for the fairness. It is confused for researchers how to get real abuse-freeness in electronic payment. An abuse-freeness electronic payment protocol for real goods is proposed in this paper. The protocol has the abuse-freeness by introducing a trusted third party and using the concurrent signature and it has prevented both sides in payment to originate and terminate protocol maliciously. At the same time fairness and security are also achieved in the proposed protocol.

关键词： Protocols Contracts Manuals security Process control Forgery Equations

来源：评论

学校读者我要写书评

暂无评论

A Privacy Preserving Handover Authentication Scheme for EAP-Based Wireless networks

A Privacy Preserving Handover Authentication Scheme for EAP-...

引用

2011 IEEE Global Telecommunications Conference - GLOBECOM 2011

作者： Qi Jing Yuqing Zhang Anmin Fu Xuefeng Liu Key Laboratory of Computer Networks and Information Security of Ministry of Education Xidian University Xi'an China National Computer Network Intrusion Protection Center GUCAS Beijing China

Extensible Authentication Protocol (EAP) is a framework which aims to provide a flexible authentication for wireless networks. Due to the involvement of an EAP server and several round trips between a mobile node (MN) and the EAP server, a full EAP authentication takes about 1000ms which is unacceptable in a handover process. This paper proposes a privacy preserving handover authentication scheme for EAP-based wireless networks. We use the proxy signature scheme to accomplish authentication between MN and an access point (AP) without involving the third party. The detailed security analysis shows that our scheme can achieve the privacy preserving and forward/backward security. In addition, we evaluate the latency performance of the proposed scheme by the analysis and simulation. The results demonstrate that our scheme is more efficient in terms of computation and communication overheads.

关键词： Manganese Authentication Privacy Servers Public key

来源：评论

学校读者我要写书评

暂无评论

Forward Secure Proxy Blind Signature Scheme

Forward Secure Proxy Blind Signature Scheme

引用

International Conference on Intelligent networking and Collaborative Systems (INCOS)

作者： Kai Fan Yue Wang Hui Li Ministry of Edu. Key Laboratory of Computer Network and Information Security Xidian University Xi'an China Shaanxi Telecom Limited Xi'an China

There is no forward security in any proxy blind signature schemes today. The lack of forward security will impact the system security tremendously if the key is stolen. To avoid such a security problem this paper proposes a forward secure proxy blind signature scheme which employs the key evolution mechanism in a newly proposed proxy blind signature scheme. The security of proxy blind signature and the forward security are both analyzed in the proposed scheme. Even if the current signature key is compromised, the attacker cannot forge signatures as if they had been generated before the key leakage. That is to say, signatures signed before the leakage are still valid.

关键词： Public key Forgery Receivers Mathematical model Equations Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Genetic Algorithm-Based Power Management in Cloud Platform

Genetic Algorithm-Based Power Management in Cloud Platform

引用

International Conference on Internet Technology and Applications (iTAP)

作者： Zili Xiong Zhang Zhang Huafeng Kong Deqing Zou School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Key Laboratory of Information Network Security Ministry of Public Security Third Research Institute of Ministry of Public Security Shanghai China

Cloud computing is a novel computing pattern, and it can provide underlying hardware resource for cloud users on demand. Virtualization is the key technology of cloud computing, and it provides the technical support for cloud computing. In cloud platform, power management is an indispensable function of cloud system administration. Based on genetic algorithm, this paper proposes a power management method based on virtual cluster. The experiments on Xen platform prove the effectiveness of our method.

关键词： Genetic algorithms Entropy Cloud computing Quality of service security Presses Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Mining dynamical frequent itemsets based on ant colony algorithm

Mining dynamical frequent itemsets based on ant colony algor...

引用

IEEE International Conference on computer Science and Automation Engineering (CSAE)

作者： Chen, Shengbing Wang, Xiaofeng Wang, Xiaofang Key Lab of Network and Intelligent Information Processing Hefei University Hefei 230601 China Department of Computer Science and Technology Hefei University Hefei 230601 China Intelligent Computing Lab Institute of Intelligent Machines Chinese Academy of Sciences Hefei 230031 China Department of Computer Artillery Academy Hefei 230031 China

ISBN: (纸本)9781424487257

Mining frequent itemsets is a core problem in many data mining tasks, most existing works on mining frequent itemsets can only capture the long-term and static frequency itemsets, they do not suit the task whose frequent itemsets often change. Using the theory of ant colony algorithm, we proposed a new method for mining dynamical frequent itemset(called AC-MFI). The method considers the item of transaction as a node in the path, takes the itemset as a path, and takes each transaction as a foraging behavior. According to the pheromone updating policy of ant colony algorithm, AC-MFI mines dynamical frequent itemsets from transaction data stream. Experiment results show that the method is valid and practicable. © 2011 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：