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

Attribute-Based Authenticated Group key Management Protocol for Mobile Peer-to-Peer network

China Communications 2012年第10期9卷 68-77页

作者： Zhang Guoyin Fu Xiaojing Ma Chunguang College of Computer Science and Technology Harbin Engineering University Harbin 150001 P. R. China Network and Data Security Key Laboratory of Sichuan Province University of Electronic Science and Technology of China Chengdu 611731 P. R. China

The authentication and privacy of a group member is important in multicast communication. This paper proposes a privacy-preserving authenticated group-key management protocol for the Mobile Peer-to-Peer network （ MP2PN ）. The MP2PN contains some super peers and each super peer controls a subgroup composed of regular peers. An efficient attribute-based signature based on Cipertext-Policy Attribute-Based Encryption （CP-ABE） is proposed and used in this group-key rmnagement protocol to authenticate a peer＇s at- tributes and identity. A peer can be described by a set of attributes or one unique special identity at- tribute. Peers that have some attributes in common can form a group and conmmnicate with each other anonymously and securely. Any super peer can initiate a group and act as a group controller. The group controller can authenticate a peer＇s attributes and identity as well as remove malicious peers. Any peer with attributes that rmtches the access structure can join the group and provide its input to form the group key. The proposed protocol pro- vides backward and forward secrecy. The sinmlation results show that this protocol is applicable for mobile devices and can meet the MP2PN requirements of group communication.

关键词： MP2PN group key tmnagement attribute-based signature anonymous conmmnica tion

来源：评论

学校读者我要写书评

暂无评论

A Fourier-Mellin transform based feature for image copy detection with rotation simulation strategy

International Journal of Digital Content Technology and its ...

引用

International Journal of Digital Content technology and its Applications 2012年第11期6卷 369-377页

作者： Zhou, Zhili Sun, Xingming Chen, Xianyi Tan, Lina Hunan Provincial Key Laboratory of Network and Information Security Hunan University Changsha 410082 China Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology Nanjing 210044 China

With the growing popularity of multimedia sharing websites, content-based image copy detection is very important for its copyright protection. Its key issue is to extract those features which are robust to various kinds of image copy attacks, namely geometric transformations and signal manipulations. However, the existing works have common weakness on detecting rotation and some other signal manipulations, such as water coloring, sponge, relief, and so on. To address this challenge, a Fourier-Mellin transform (FMT) based feature with rotation simulation strategy is proposed for image copy detection. The candidate image is first converted to gray-level image in size of 256×256. Then, the frequency-domain coefficients of the gray-level image are extracted by FMT. The ratios of adjacent coefficients, which are not only robust to various geometric transformations but also to signal manipulations, are used as our image feature for copy detection. Moreover, a rotation simulation strategy is proposed to enhance the ability of resisting the rotation attacks. Experimental results prove that the proposed method can effectively detect various copied transformations and outperforms the existing works.

关键词： Rotation

来源：评论

学校读者我要写书评

暂无评论

A measurement study on potential inter-domain routing diversity

引用

IEEE Transactions on network and Service Management 2012年第3期9卷 268-278页

作者： Hu, Chengchen Chen, Kai Chen, Yan Liu, Bin Vasilakos, Athanasios V. MoE Key Laboratory of Intelligent Networks and Network Security Department of Computer Science and Techonolgy Xi'An Jiaotong University Xi'an Shaanxi China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong Department of Electrical Engineering and Computer Science Northwestern University Evanston IL United States Department of Computer Science and Technology Tsinghua University Beijing China Department of Computer and Telecommunications Engineering University of Western Macedonia GR 50100 Kozani Greece

In response to Internet emergencies, Internet resiliency is investigated directly through an autonomous system (AS) level graph inferred from policy-compliant BGP paths or/and traceroute paths. Due to policy-driven inter-domain routing, the physical connectivity does not necessarily imply network reachability in the AS-level graph, i.e., many physical paths are not visible by the inter-domain routing protocol for connectivity recovery during Internet outages. We call the invisible connectivity at the routing layer, which can be quickly restored for recovering routing failures by simple configurations, as the potential routing diversities. In this paper, we evaluate two kinds of potential routing diversities, which are recognized as Internet eXchange Points (IXPs) participant reconnection and peering policy relaxation. Using the most complete dataset containing AS-level map and IXP participants that we can achieve, we successfully evaluate the ability of potential routing diversity for routing recovery during different kinds of Internet emergencies. Encouragingly, our experimental results show that 40% to 80% of the interrupted network pairs can be recovered on average beyond policy-compliant paths, with rich path diversities and a little traffic shifts. Thus, this paper implies that the potential routing diversities are promising venues to address Internet failures. © 2004-2012 IEEE.

关键词： Recovery

来源：评论

学校读者我要写书评

暂无评论

Threshold Ring Signature Scheme Based on TPM

引用

China Communications 2012年第1期9卷 80-85页

作者： Gong Bei Jiang Wei Lin Li Li Yu Zhang Xing College of Computer Science Beijing University of Technology Beijing 100124 P. R. China Institute of Electronic Technology Information Engineering University Zhengzhou 450004 P. R. China State Key Laboratory of Information Security Institute of Sottware Chinese Academy of Sciences Beijing Beijing 100049 P. R. China Key Laboratory of Information and Network Security 3rd Research Institute Ministry of Public Security Shanghai 201204 P. R. China

The conventional ring signature schemes cannot address the scenario where the rank of members of the ring needs to be distinguished, for example, in electronically commerce application. To solve this problem, we presented a Trusted Platform Module （TPM）-based threshold ring signature schen. Employing a reliable secret Share Distribution Center （SDC）, the proposed approach can authenticate the TPM-based identity rank of members of the ring but not track a specific member＇s identity. A subset including t members with the same identity rank is built. With the signing cooperation of t members of the subset, the ring signature based on Chinese remainder theorem is generated. We proved the anonymity and unforgeability of the proposed scheme and compared it with the threshold ring signature based on Lagrange interpolation polynomial. Our scheme is relatively simpler to calculate.

关键词： ring signature TPM threshold Chinese remainder theorem rank

来源：评论

学校读者我要写书评

暂无评论

An Efficient Mutation-Based Fuzz Testing Approach for Detecting Flaws of network Protocol

An Efficient Mutation-Based Fuzz Testing Approach for Detect...

引用

International Conference on Computer Science and Service System (CSSS)

作者： Zhao Zhang Qiao-Yan Wen Wen Tang State Key Laboratory of Network and Switching Technology Beijing University of Posts and Telecommunications Beijing China IT Security Cooperate Technology Siemens Limited China Beijing China

ISBN: (纸本)9781467307215

security flaws existed in protocol implementations might be exploited by malicious attackers and the consequences can be very serious. Therefore, detecting vulnerabilities of network protocol implementations is becoming a hot research topic recently. However, protocol security test is a very complex, challenging and error-prone task, as constructing test packets manually or randomly are not practical. This paper presents an efficient mutation-based approach for detecting implementation flaws of network protocol. Compared with other protocol testing tools, our approach divides the procedure of protocol testing into many phases, and flexible design can cover many testing cases for the protocol implementations under testing, and could apply for testing various protocol implementations quite easily. Besides, this approach is more comprehensible that makes the protocol security test easier to carry out. To assess the usefulness of this approach, several experiments are performed on four FTP server implementations and the results showed that our approach can find flaws of protocol implementation very easily. The method is of the important application value and can improve the security of network protocols.

关键词： Protocols Testing Servers Buffer overflows Authentication

来源：评论

学校读者我要写书评

暂无评论

Construction of Odd-Variable Boolean Function with Maximum Algebraic Immunity Using Univariate Polynomial Representation

引用

China Communications 2012年第10期9卷 33-39页

作者： Zhao Wentao Fu Shaojing Li Chao Qu Longjiang College of Computer National University of Defense Technology Changsha 410073 P. R. China Department of Mathematics and System Science National University of Defense Technology Changsha 410073 P. R. China Key Laboratory of Network Security and Cryptology Fujian Normal University Fuzhou 350007 P. R. China State key Laboratory of Information Security Chinese Academy of Science Beijing 100049 P. R. China

To protect against algebraic attacks, a high algebraic immunity is now an important criterion for Boolean functions used in stream ciphers. In this paper, a new method based on a univariate polynomial representation of Boolean functions is proposed. The proposed method is used to constmct Boolean functions with an odd number of variables and with maximum algebraic immunity. We also discuss the nonlinearity of the constructed functions. Moreover, a lower bound is deter- mined for the number of Boolean functions with rmximum algebraic immunity.

关键词： cryptography boolean function alge- braic attack algebraic immunity

来源：评论

学校读者我要写书评

暂无评论

Mining Protocol State Machines by Interactive Grammar Inference

Mining Protocol State Machines by Interactive Grammar Infere...

引用

International Conference on Digital Manufacturing and Automation (ICDMA)

Protocol state machine is very essential in network security and implementation fields, however, improper management of software evolution, compounded by changing and imprecise requirements, along with "short time to market" phenomenon, often leads to a lack of up-to-date specifications and they are often characterized by bugs, anomalies and even threads. How to mine the accurate protocol state machine under investigation is still an open problem. We address this problem by using an interactive grammar inference technique as it could generate queries to the protocol implementation in learning process. This paper describes: (1) a flexible method to construct and parse real packet according to the packet format, (2) how to generate packet queries to explore protocol state machine space, (3) applies the QSM technology to mine protocol state machine from network traces. To access the usefulness of our approach, several experiments for different protocols are performed and we could get more objective and accurate results compared with other protocol specification mining methods.

关键词： Protocols Space exploration security Software Inference algorithms Data mining Educational institutions

来源：评论

学校读者我要写书评

暂无评论

A SIMPLE FULLY HOMOMORPHIC ENCRYPTION SCHEME AVAILABLE IN CLOUD computing

A SIMPLE FULLY HOMOMORPHIC ENCRYPTION SCHEME AVAILABLE IN CL...

引用

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

作者： Jian Li Danjie Song Sicong Chen Xiaofeng Lu School of Computer Beijing University of Posts and Telecommunications Network and Data Security Key Laboratory of Sichuan Province University of Electronic Science and Technology of China

With continuous expansion of cloud computing, problems of third-party data security become increasingly prominent. However, effective retrieval of encrypted data and other operations are difficult to achieve by traditional cryptogram systems. Thus, a practical simple fully homomorphic encryption scheme, using only elementary modular arithmetic, derived from Gentry cryptosystem is put forward to ensure the privacy-preserving in cloud storage, in which encrypted data can be operated directly without affecting the confidentiality of the encryption systems, so that it can excellently realize the need of cipertext retrieval and other processing in untrusted servers. Compared with the previous protocols Marten van Dijk et al. proposed at Advances in Cryptology-EUROCRYPT 2010 and Craig Gentry proposed in the March 2010 issue of Communications of the ACM, especially in the aspect of cipertext retrieval, the proposed scheme is much more secure and feasible. And the performance evaluation and security analysis demonstrate the practice and validity of the proposed scheme.

关键词： Cloud computing fully homomorphic encryption Ciphertext retrieval Data security

来源：评论

学校读者我要写书评

暂无评论

security STRUCTURE OF CLOUD STORAGE BASED ON HOMOMORPHIC ENCRYPTION SCHEME

SECURITY STRUCTURE OF CLOUD STORAGE BASED ON HOMOMORPHIC ENC...

引用

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

作者： Jian Li Sicong Chen Danjie Song School of Computer Beijing University of Posts and Telecommunications Network and Data Security Key Laboratory of Sichuan Province University of Electronic Science and Technology of China

According to the demerits of the traditional cloud storage that there exists superuser, encryption and decryption would take up many client’s sources, and the retrieval spends much time and is complex, the paper proposed a security structure of cloud storage based on homomorphic encryption scheme. The structure will reduce the use of client’s sources, and is convenient for moving to mobile devices;the homomorphic encryption scheme makes retrieval more efficient;users’ data would be more secure because they could not be achieved by superusers in the side of sever;users can operate cloud virtual disk as convenient as local disk. These merits of the structure not only could ensure the data storage’s security, but also promote highly the popularization of cloud storage.

关键词： Cloud storage Storage security Homomorphic encryption

来源：评论

学校读者我要写书评

暂无评论

Revisiting Multiple Pattern Matching Algorithms for Multi-Core Architecture

引用

Journal of Computer Science & technology 2011年第5期26卷 866-874页

作者：谭光明刘萍卜东波刘燕兵 Key Laboratory of Computer System and Architecture Institute of Computing TechnologyChinese Academy of Sciences Key Laboratory of Network Technology Institute of Computing TechnologyChinese Academy of Sciences

Due to the huge size of patterns to be searched,multiple pattern searching remains a challenge to several newly-arising applications like network intrusion *** this paper,we present an attempt to design efficient multiple pattern searching algorithms on multi-core *** observe an important feature which indicates that the multiple pattern matching time mainly depends on the number and minimal length of *** multi-core algorithm proposed in this paper leverages this feature to decompose pattern set so that the parallel execution time is *** formulate the problem as an optimal decomposition and scheduling of a pattern set,then propose a heuristic algorithm,which takes advantage of dynamic programming and greedy algorithmic techniques,to solve the optimization *** results suggest that our decomposition approach can increase the searching speed by more than 200% on a 4-core AMD Barcelona system.

关键词： parallel algorithm multi-core multiple pattern matching

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：