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

Pitfalls in an ECC-based lightweight authentication protocol for low-cost RFID

Journal of information Hiding and Multimedia Signal Processing 2014年第4期5卷 642-648页

作者： Chen, Chien-Ming Chen, Shuai-Min Zhen, Xinying Yan, Lijun Wang, Huaxiong Sun, Hung-Min Innovative Information Industry Research Center School of Computer Science and Technology Shenzhen Graduate School Harbin Institute of Technology Shenzhen518055 China Shenzhen Key Laboratory of Internet Information Collaboration Shenzhen518055 China Department of Computer Science National Tsing Hua University Hisnchu30013 Taiwan Division of Mathematical Sciences School of Physical and Mathematical Sciences Nanyang Technological University Singapore

RFID technology has become popular in many applications;however, most of the RFID products lack security related functionality due to the hardware limitation of the low-cost RFID tags. In 2009, Chien and Laih proposed an RFID authentication protocol based on error correction codes (ECC) to secure RFID systems with untraceability, which is one of the most critical privacy issues on RFID. In this paper, we demonstrate that their scheme is insecure against two kinds of tracing attacks. We also analyze the success probability of our attacks. © 2014.

关键词： Radio frequency identification (RFID)

来源：评论

学校读者我要写书评

暂无评论

Depth enhanced saliency detection method 14

Depth enhanced saliency detection method

引用

6th International Conference on Internet Multimedia Computing and Service, ICIMCS 2014

作者： Cheng, Yupeng Fu, Huazhu Wei, Xingxing Xiao, Jiangjian Cao, Xiaochun School of Computer Science and Technology Tianjin University China School of Computer Engineering Nanyang Technological University Singapore State Key Laboratory of Information Security Chinese Academy of Sciences China Ningbo Industrial Technology Research Institute Chinese Academy of Sciences China

ISBN: (纸本)9781450328104

Human vision system understands the environment from 3D perception. However, most existing saliency detection algorithms detect the salient foreground based on 2D image information. In this paper, we propose a saliency detection method using the additional depth information. In our method, saliency cues are provided to follow the laws of the visually salient stimuli in both color and depth spaces. Simultaneously, the 'center bias' is also extended to 'spatial' bias to represent the nature advantage in 3D image. In addition, We build a dataset to test our method and the experiments demonstrate that the depth information is useful for extracting the salient object from the complex scenes. Copyright 2014 ACM.

关键词： Statistical tests

来源：评论

学校读者我要写书评

暂无评论

Improvement of a remote data possession checking protocol from algebraic signatures

Improvement of a remote data possession checking protocol fr...

引用

10th International Conference on information security Practice and Experience, ISPEC 2014

作者： Yu, Yong Ni, Jianbing Ren, Jian Wu, Wei Chen, Lanxiang Xia, Qi School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 611731 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100093 China Department of Electrical and Computer Engineering Michigan State University MI 4882 United States School of Mathematics and Computer Science Fujian Normal University Fuzhou 350007 China

ISBN: (纸本)9783319063195

Cloud storage allows cloud users to enjoy the on-demand and high quality data storage services without the burden of local data storage and maintenance. However, the cloud servers are not necessarily fully trusted. As a consequence, whether the data stored on the cloud are intact becomes a major concern. To solve this challenging problem, recently, Chen proposed a remote data possession checking (RDPC) protocol using algebraic signatures. It achieves many desirable features such as high efficiency, small challenges and responses, non-block verification. In this paper, we find that the protocol is vulnerable to replay attack and deletion attack launched by a dishonest server. Specifically, the server can either fool the user to believe that the data is well maintained but actually only a proof of the challenge is stored, or can generate a valid response in the integrity checking process after deleting the entire file of the user. We then propose an improved scheme to fix the security flaws of the original protocol without losing the desirable features of the original protocol. © 2014 Springer International Publishing.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

ESYN: Efficient synchronization clustering algorithm based on dynamic synchronization model

引用

Tongxin Xuebao/Journal on Communications 2014年 35卷 86-93页

作者： Dong, Xue-Wen Yang, Chao Sheng, Li-Jie Ma, Jian-Feng Shaanxi Key Laboratory of Network and System Security Xidian University Xi'an710071 China School of Computer Science and Technology Xidian University Xi'an710071 China

Clustering is an important research field in data mining. Based on dynamical synchronization model, an efficient synchronization clustering algorithm ESYN is proposed. Firstly, based on local structure information of a non-vector network, a new concept vertex similarity is brought up to describe the link density between vertices. Secondly, the network is vectoried by OPTICS algorithm and turned into one-dimensional coordination sequence. Finally, global coupling analysis is applied to generalized Kuramoto synchronization model, synchronization radius is increased and the optimal clustering result is automatically selected. The experimental results on a large number of synthetic and real-world networks show that proposed algorithm achieves high accuracy. ©, 2014, Editorial Board of Journal on Communications. All right reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Dominant Skyline Query Processing over Multiple Time Series

引用

Journal of computer science & technology 2013年第4期28卷 625-635页

作者：汪浩王朝坤徐亚军宁苑池 Department of Computer Science and Technology Tsinghua University Tsinghua National Laboratory for Information Science and Technology Key Laboratory for Information System Security Ministry of Education School of Software Tsinghua University

Multiple time series （MTS）, which describes an object in multi-dimensions, is based on single time series and has been proved to be useful. In this paper, a new analytical method called α/β-Dominant-Skyline on MTS and a formal definition of the α/β-dominant skyline MTS are given. Also, three algorithms, called NL, BC and MFB, are proposed to address the α/β-dominant skyline queries over MTS. Finally experimental results on both synthetic and real data verify the correctness and effectiveness of the proposed method and algorithms.

关键词： multiple time series α/β-dominant skyline skyline query processing

来源：评论

学校读者我要写书评

暂无评论

Mechanism of heuristic strategy based partition algorithm for massive semantic data flow

引用

Xitong Gongcheng Lilun yu Shijian/system Engineering Theory and Practice 2014年 34卷 248-254页

作者： Chen, Feng-Jiao Fu, Hai-Dong Wu, Gang Gu, Jin-Guang Department of Computer Science and Technology Wuhan University of Science and Technology Wuhan430065 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System Wuhan430065 China

The dramatic growth of massive semantic data has brought about great challenges to the distributed storage for large data. The core technology of distributed storage is graph partitioning. This paper discussed the partition mechanism for graph data flow and the strategy of partitioning heuristic function, and the partitioning algorithm and implementation process of graph data flow for the RDF file. The experiment verified the validity of the partitioning algorithm for graph data flow by comparing with METIS (a multi-level graph partitioning algorithm) and hash partitioning methods, using several true RDF datasets.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

STSHC: Secure and trusted scheme for Hadoop cluster

引用

International Journal of High Performance systems Architecture 2014年第1期5卷 63-69页

作者： Zhou, Quan Wu, Daixian Tang, Chunming Rong, Chunming Key Laboratory of Mathematics and Interdisciplinary Sciences of Guangdong Higher Education Institutes Guangzhou University 510006 Guangzhou China College of Computer and Information Science and College of Software Southwest University 400715 Chongqing China School of Mathematics and Information Science Guangzhou University 510006 Guangzhou China Department of Science and Technology University of Stavanger 4036 Stavanger Norway

Hadoop is a distributed big data storage and processing framework hugely adopted in different sectors from online media, education, government and social media to handle the enormous growth of information in their respective domains. However, the core architecture of the solution is based on a trusted cluster. It lacks native methods for protecting sensitive data that cross over enterprises and are exposed or accessed illegally. In the paper, this work aims to construct a secure and trusted scheme for Hadoop cluster (STSHC). Firstly, we review the architecture of Hadoop cluster, and discuss the security risks and security requirements. And then we propose a secure and trusted architecture framework for Hadoop cluster with trusted computing base (TCB). Moreover, some protocols, which are the key management, the node trusted management protocol, the client access management protocol, the node access management protocol and job executing management protocol, are designed in detail. Finally, the security analysis shows that the scheme can efficiently meet the security requirement of Hadoop cluster. © Copyright 2014 Inderscience Enterprises Ltd.

关键词： Sensitive data

来源：评论

学校读者我要写书评

暂无评论

Matching heterogeneous events with patterns

Matching heterogeneous events with patterns

引用

International Conference on Data Engineering

作者： Xiaochen Zhu Shaoxu Song Jianmin Wang Philip S. Yu Jiaguang Sun Key Laboratory for Information System Security Tsinghua University Beijing China Department of Computer Science University of Illinois at Chicago USA

A large amount of heterogeneous event data are increasingly generated, e.g., in online systems for Web services or operational systems in enterprises. Owing to the difference between event data and traditional relational data, the matching of heterogeneous events is highly non-trivial. While event names are often opaque (e.g., merely with obscure IDs), the existing structure-based matching techniques for relational data also fail to perform owing to the poor discriminative power of dependency relationships between events. We note that interesting patterns exist in the occurrence of events, which may serve as discriminative features in event matching. In this paper, we formalize the problem of matching events with patterns. A generic pattern based matching framework is proposed, which is compatible with the existing structure based techniques. To improve the matching efficiency, we devise several bounds of matching scores for pruning. Since the exploration of patterns is costly and incrementally, our proposed techniques support matching in a pay-as-you-go style, i.e., incrementally update the matching results with the increase of available patterns. Finally, extensive experiments on both real and synthetic data demonstrate the effectiveness of our pattern based matching compared with approaches adapted from existing techniques, and the efficiency improved by the bounding/pruning methods.

关键词： Pattern matching Upper bound Educational institutions Business Optimal matching Frequency conversion information systems

来源：评论

学校读者我要写书评

暂无评论

A secure self-destruction scheme with IBE for the internet content privacy

引用

Jisuanji Xuebao/Chinese Journal of computers 2014年第1期37卷 139-150页

作者： Xiong, Jin-Bo Yao, Zhi-Qiang Ma, Jian-Feng Li, Feng-Hua Liu, Xi-Meng Faculty of Software Fujian Normal University Fuzhou 350108 China School of Computer Science and Technology Xidian University Xi'an 710071 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100093 China Shaanxi Key Laboratory of Network and System Security Xidian University Xi'an 710071 China

With the rapid emerging of novelty Web services and cloud services, privacy information and documents of users become increasingly easy to be exposed in the Internet. To tackle the issue of lifecycle security of the privacy information and documents in the Internet, in this paper, we propose the idea of combining the three security methods of multilevel security, identity-based encryption (IBE), and distributed hash table (DHT) network. And we further propose an IBE-based secure self-destruction (ISS) scheme to protect the confidentiality and privacy of the Internet content by self-destruction after a predefined time. In our proposed ISS security scheme, the Internet content is first partitioned into many segments with diverse security levels, and each segment is encrypted with a symmetric key to obtain primitive ciphertext. By applying the methods of association and extraction, the primitive ciphertext is turned to associated ciphertext, which is then divided into extracted ciphertext and encapsulated ciphertext. The latter is encapsulated into the Internet content self-destructing object (CDO), which is stored into the storage services provider. Furthermore, to protect the privacy security when the CDO expired, the symmetric key is encrypted using the IBE algorithm based on the identity of the authorized user. The combination of this key's ciphertext and the extracted ciphertext, by means of Lagrange polynomial processing, generates mixture ciphertext shares. Then those shares are distributed into nodes within the DHT network and will be automatically discarded over the deadline when the primitive ciphertext and the symmtric key are unrecoverable. Consequently, the ISS scheme achieves the aim of secure self-destruction. Comprehensive analysis shows that the ISS scheme is able to satisfy all the design demands and is more secure than existing schemes. The ISS scheme can resist against not only the traditional cryptanalysis and brute-force attack, but also the Sybil

关键词： Access control

来源：评论

学校读者我要写书评

暂无评论

Research of the issues based on trusted cloud security

Research of the issues based on trusted cloud security

引用

4th International Conference on Materials science and information technology, MSIT 2014

作者： Huang, Yi Ma, Xin Qiang Liu, You Yuan Li, Dan Ning Key Laboratory of Machine Vision and Intelligent Information System Chongqing University of Arts and Sciences Chongqing 402160 China Guizhou Academy of Science Guiyang 550001 China School of Computer Science and Technology Guizhou University Guiyang 550025 China

ISBN: (纸本)9783038351733

Cloud computing represents one of the most significant shifts in information technology many of us are likely to see in our lifetimes. It offers an innovative business model for organizations to adopt IT services without upfront investment. Cloud computing moves the application software and databases to large data centers, where the management of the data and services may not be fully trustworthy. security is one of the major issues which hamper the growth of cloud. The security for cloud computing is emerging area for study and this paper provide technical components of cloud computing and security idea in terms of cloud computing based on analysis of cloud security treats. © (2014) Trans Tech Publications, Switzerland.

关键词： Access control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：