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

A Survey of Game Theory in Wireless Sensor Networks security

Journal of Networks 2011年第3期6卷 521-532页

作者： Shen, Shigen Yue, Guangxue Cao, Qiying Yu, Fei College of Information Science and Technology Donghua University Shanghai China College of Mathematics and Information Engineering Jiaxing University Jiaxing China College of Computer and Communication Hunan University Changsha China Department of Computer Science and Technology Huaihua University Huaihua China Jiangsu Provincial Key Laboratory for Computer Information Processing Technology Soochow University Soochow China

Wireless Sensor Networks (WSNs) are becoming an integral part of our lives. There are not widespread applications of WSNs without ensuring WSNs security. Due to the limited capabilities of sensor nodes in terms of computation, communication, and energy, providing security to WSNs is challenging. In fact, the process of implementing WSNs security is adaptive and dynamic, which evolves continually. The essence of attack-defend in WSNs security can be expressed by mutual strategies of interdependence while game theory can be used for the purpose of accounting for interactions among strategies of rational decision makers. Therefore, studying WSNs security with game theory has higher scientificity and rationality. This paper presents a survey of security approaches based on game theory in WSNs. According to different applications, a taxonomy is proposed, which divides current existing typical game-theoretic approaches for WSNs security into four categories: preventing Denial of Services (DoS) attacks, intrusion detection, strengthening security, and coexistence with malicious sensor nodes. The main ideas of each approach are overviewed while advantages and disadvantages of various approaches are discussed. Then, this paper overviews related work and highlights the difference from other surveys, and points out some future research areas for ensuring WSNs security based on game theory, including Base Station (BS) credibility, Intrusion Detection system (IDS) efficiency, WSNs mobility, WSNs Quality of Service (QoS), real-world applicability, energy consumption, sensor nodes learning, and expanding game theory applications and different games. Thus, a global view of WSNs security approaches based on game theory is provided. To our best knowledge of knowing, it is the first paper centrally focusing on game theory in WSNs security. It will make the researchers a better understanding of game-theoretic solutions to WSNs security and further research directions. © 2011 ACADEMY PU

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Compatibility of photographed images with touch-based fingerprint verification software

Compatibility of photographed images with touch-based finger...

引用

IEEE Conference on Industrial Electronics and Applications (ICIEA)

作者： Fengling Han Jiankun Hu Mohammed Alkhathami Kai Xi State Key Laboratory of Power Transmission Equipment & System Security and New Technology Chongqing University China School of Computer Science & IT Royal Melbourne Institute of Technology Melbourne VIC Australia School of Engineering and Information Technology University of New South Wales Canberra ACT Australia

In this paper, the compatibility of fingerprint images captured with mobile cameras (touch-less) with existing touch-based commercial fingerprint verification software VeriFinger SDK is investigated. The touch-less fingerprint images taken with mobile cameras are different with the fingerprint images captured from touch-based scanners. The research in this paper shows that the commercial fingerprint verification software VeriFinger SDK can load the photographed fingerprint images, and can extract minutiae from the photographed images. Furthermore, the minutiae matching of a sample against a reference have been successfully performed based on the photographed fingerprint images using VeriFinger SDK. This research result will make the mobile fingerprint verification more interoperable which has significant contribution to the security of m-commerce applications.

关键词： Fingerprint recognition Mobile communication Image matching Cameras Fingers Software Mobile handsets

来源：评论

学校读者我要写书评

暂无评论

Multi-User Private keyword Search for Cloud Computing

Multi-User Private Keyword Search for Cloud Computing

引用

IEEE International Conference on Cloud Computing technology and science (CloudCom)

作者： Yanjiang Yang Haibing Lu Jian Weng Institute for Infocomm Research Singapore Department of Operations Management and Information Systems The Leavey School of Business Santa Clara University USA State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications China Department of Computer Science and Emergency Technology Research Center of Risk Department of Computer Science and Emergency Technology Research Center of Risk Evaluation and Prewarning on Public Network Security Jinan University Guangzhou China State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences China

Enterprises outsourcing their databases to the cloud and authorizing multiple users for access represents a typical use scenario of cloud storage services. In such a case of database outsourcing, data encryption is a good approach enabling the data owner to retain its control over the outsourced data. Searchable encryption is a cryptographic primitive allowing for private keyword based search over the encrypted database. The above setting of enterprise outsourcing database to the cloud requires multi-user searchable encryption, whereas virtually all of the existing schemes consider the single-user setting. To bridge this gap, we are motivated to propose a practical multi-user searchable encryption scheme, which has a number of advantages over the known approaches. The associated model and security requirements are also formulated. We further discuss to extend our scheme in several ways so as to achieve different search capabilities.

关键词： Encryption Indexes keyword search Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Homomorphic Linear Authentication Schemes for Proofs of Retrievability

Homomorphic Linear Authentication Schemes for Proofs of Retr...

引用

International Conference on Intelligent Networking and Collaborative systems (INCOS)

作者： Shengli Liu Kefei Chen Department of Computer Science and Engineering Shanghai Jiaotong University Shanghai China State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Beijing China

In a proof of retrievability (POR) system, interactive POR protocols are executed between a storage server and clients, so that clients can be convinced that their data is available at the storage server, ready to be retrieved when needed. In an interactive POR protocol, clients initiate challenges to the server, and the server feedbacks responses to clients with input of the stored data. Retrievability means that it should be possible for a client to extract the his/her data from the server's valid responses. An essential step-stone leading to retrievability is server's unforgeability of valid responses, i.e, any server coming up valid responses to a client's challenges is actually storing the client's data with overwhelming probability. Unforgeability can be achieved with authentication schemes like MAC, Digital Signature, etc. With homomorphic linear authentication schemes, the authenticators can be aggregated into one tag for the challenges, hence reducing the communication complexity. In this paper, we explore some new homomorphic linear authenticator schemes in POR to provide unforgeability. Compared with the recent work of Shacham and Waters, our scheme enjoys the same shortest responses, but reduces the local storage from O(s) to O(1).

关键词： Games Authentication Servers Protocols Data mining Vectors

来源：评论

学校读者我要写书评

暂无评论

Proving Computational Geometry Algorithms in TLA+2

Proving Computational Geometry Algorithms in TLA+2

引用

Theoretical Aspects of Software Engineering (TASE)

作者： Hui Kong Hehua Zhang Xiaoyu Song Ming Gu Jiaguang Sun Key Laboratory for Information System Security Ministry of Education China DepartmentCST Tsinghua Unviersity Beijing China Tsinghua National Laboratory for Information Science and Technology China School of Software Tsinghua University Beijing China DepartmentECE Portland State University OR USA

Geometric algorithms are widely used in many scientific fields like computer vision, computer graphics. To guarantee the correctness of these algorithms, it's important to apply formal method to them. In this paper, we propose an approach to proving the correctness of geometric algorithms. The main contribution of the paper is that a set of proof decomposition rules is proposed which can help improve the automation of the proof of geometric algorithms. We choose TLA+2, a structural specification and proof language, as our experiment environment. The case study on a classical convex hull algorithm shows the usability of the method.

关键词： Silicon Computational geometry Arrays Automation Educational institutions Software algorithms Software

来源：评论

学校读者我要写书评

暂无评论

Parallel Spatial Hashing for Collision Detection of Deformable Surfaces

Parallel Spatial Hashing for Collision Detection of Deformab...

引用

IEEE International Conference on computer-Aided Design and computer Graphics

作者： Wenshan Fan Bin Wang Jianliang Zhou Jiaguang Sun Tsinghua University Beijing Beijing CN Key Laboratory for Information System Security Ministry of Education of China China School of Software Tsinghua University China Tsinghua National Laboratory for Information Science and Technology China Beijing AeroSpace Control Center China

We present a fast collision detection method for deformable surfaces with parallel spatial hashing on GPU architecture. The efficient update and access of the uniform grid are exploited to accelerate the performance in our method. To deal with the inflexible memory system, which makes the building of stream data a challenging task on GPU, we propose to subdivide the whole workload into irregular segments and design an efficient evaluation algorithm, which employs parallel scan and stream compaction, to build the stream data in parallel. The load balancing is a key aspect that needs to be considered in the SIMD parallelism. We break the heavy and irregular collision computation down into lightweight part and heavyweight part, ensuring the later perfectly run in load balancing manner with each concurrent thread processes just a single collision. In practice, our approach can perform collision detection in tens of milliseconds on a PC with NVIDIAGTX 260 graphics card on benchmarks composed of millions of triangles. The results highlight our speedups over prior CPU-based and GPU-based algorithms.

关键词： Graphics processing unit Computational modeling Arrays Benchmark testing Compaction Deformable models Buildings

来源：评论

学校读者我要写书评

暂无评论

A no-reference image quality evaluation based on power spectrum

A no-reference image quality evaluation based on power spect...

引用

3DTV Conference

作者： Yan Zhang Ping An Qiuwen Zhang Liquan Shen Zhaoyang Zhang School of Communication and Information Engineering Shanghai University China Department of Computer Science and Technology Anhui University of Finance and Economics China Key Laboratory of Advanced Displays and System Application Ministry of Education China

ISBN: (纸本)9781612841618

No-reference quality evaluation is more difficult because it does not refer to any image. However, in some cases, like virtual view images, can not find the reference image, no-reference method had to be used. With the free viewpoint video technology development and application, measuring the performance of the multiview video system is essential and virtual view image quality evaluation is one of the key technologies in the system. The characteristic of virtual view image quality evaluation is that most of the virtual view images haven't reference images and can't be assessed using general measures such as PSNR of full-reference. Therefore, this paper proposed a no-reference image quality evaluation method based on image power spectrum. Experimental results show that the proposed method is consistent with PSNR.

关键词： PSNR Image quality Three dimensional displays Transform coding Mathematical model Speckle

来源：评论

学校读者我要写书评

暂无评论

Improved multi-view depth estimation for view synthesis in 3D video coding

Improved multi-view depth estimation for view synthesis in 3...

引用

3DTV Conference

作者： Qiuwen Zhang Ping An Yan Zhang Liquan Shen Zhaoyang Zhang School of Communication and Information Engineering Shanghai University China Key Laboratory of Advanced Displays and System Application Ministry of Education China Department of Computer Science and Technology Anhui University of Finance and Economics China

ISBN: (纸本)9781612841618

Multi-view depth estimation is an important part in the virtual view synthesis and depth map coding within the 3DV/FTV applications. However, existing depth estimation methods generally have difficulty to generate good depth results around object edges or in areas with less texture. To solve this problem, we propose an improved algorithm to obtain a smooth and accurate depth map for view synthesis in 3D video coding. The proposed method aims to preserve details in the depth map and simultaneously smooth depths in object boundary occluded area, less texture and discontinuity regions, to avoid blurring in the synthesized views. Experimental results show a significant improvement of the initial input depth maps and coding efficiency, as well as a reduction of view synthesis artifacts.

关键词： Estimation Pixel Three dimensional displays Encoding Rendering (computer graphics) Image coding Transform coding

来源：评论

学校读者我要写书评

暂无评论

Any 2⊗n subspace is locally distinguishable

引用

Physical Review A 2011年第1期84卷 012304-012304页

作者： Nengkun Yu Runyao Duan Mingsheng Ying State Key Laboratory of Intelligent Technology and Systems Department of Computer Science and Technology Tsinghua University Beijing 100084 China Centre for Quantum Computation and Intelligent Systems (QCIS) Faculty of Engineering and Information Technology University of Technology Sydney NSW 2007 Australia

A subspace of a multipartite Hilbert space is said to be locally indistinguishable if any orthonormal basis of this subspace cannot be perfectly distinguished by local operations and classical communication. Previously it was shown that any m⊗n bipartite system with m>2 and n>2 has a locally indistinguishable subspace. However, it has been an open problem since 2005 whether there is a locally indistinguishable bipartite subspace with a qubit subsystem. We settle this problem in negative by showing that any 2⊗n bipartite subspace contains a basis that is locally distinguishable. As an interesting application, we show that any quantum channel with two Kraus operators has optimal environment-assisted classical capacity.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient rendering distortion estimation for depth map compression

Efficient rendering distortion estimation for depth map comp...

引用

IEEE International Conference on Image Processing

作者： Qiuwen Zhang Ping An Yan Zhang Zhaoyang Zhang School of Communication and Information Engineering Shanghai University China Key Laboratory of Advanced Displays and System Application Ministry of Education China Department of Computer Science and Technology Anhui University of Finance and Economics China

A depth map represents three-dimensional (3D) scene information and is used to synthesize virtual views in 3D video. Since the quality of synthesized virtual views highly depends on the quality of depth map, efficient depth compression is crucial to realize the 3D video system. However compressing depth map using existing video coding techniques yields unacceptable distortions while rendering virtual views. To solve this problem, we propose an efficient depth map compression method for the view rendering, a novel distortion metric base on view rendering distortions instead of distortion of depth map itself. First, we derive relationships between distortions in coded depth map and rendered view. Then, a region based video characteristics distortion model is proposed for precisely estimation distortion in view synthesis. Finally, experimental results have shown that 1.8 dB coding gain in terms of PSNR and subjective quality improvement of synthesized views are achieved by the proposed method.

关键词： Image coding Rendering (computer graphics) Three dimensional displays Cameras Geometry Encoding Estimation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：