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

International Conference on Collaborative computing: Networking, Applications and Worksharing (CollaborateCom)

作者： Yan Zhu Hongxin Hu Gail-Joon Ahn Yujing Han Shimin Chen Beijing Key Laboratory of Internet Security Technology Peking University Beijing China Laboratory of Security Engineering for Future Computing (SEFCOM) Arizona State University Tempe AZ USA Justitutc of Computer Science and Technology Peking University Beijing China

A hybrid cloud is a cloud computing environment in which an organization provides and manages some internal resources and the others provided externally. However, this new environment could bring irretrievable losses to the clients due to a lack of integrity verification mechanism for distributed data outsourcing. In this paper, we address the construction of a collaborative integrity verification mechanism in hybrid clouds to support the scalable service and data migration, in which we consider the existence of multiple cloud service providers to collaboratively store and maintain the clients' data. We propose a collaborative provable data possession scheme adopting the techniques of homomorphic verifiable responses and hash index hierarchy. In addition, we articulate the performance optimization mechanisms for our scheme and prove the security of our scheme based on multi-prover zero-knowledge proof system, which can satisfy the properties of completeness, knowledge soundness, and zero-knowledge. Our experiments also show that our proposed solution only incurs a small constant amount of communications overhead.

关键词： Indexes Usability

来源：评论

学校读者我要写书评

暂无评论

Provably secure role-based encryption with revocation mechanism

Provably secure role-based encryption with revocation mechan...

引用

作者： Zhu, Yan Hu, Hong-Xin Ahn, Gail-Joon Wang, Huai-Xi Wang, Shan-Biao Institute of Computer Science and Technology Peking University Beijing 100871 China Beijing Key Laboratory of Internet Security Technology Peking University Beijing 100871 China School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe AZ 85287 United States 4School of Mathematical Sciences Peking University Beijing 100871 China

Role-Based Encryption (RBE) realizes access control mechanisms over encrypted data according to the widely adopted hierarchical RBAC model. In this paper, we present a practical RBE scheme with revocation mechanism based on partial-order key hierarchy with respect to the public key infrastructure, in which each user is assigned with a unique private-key to support user identification, and each role corresponds to a public group-key that is used to encrypt data. Based on this key hierarchy structure, our RBE scheme allows a sender to directly specify a role for encrypting data, which can be decrypted by all senior roles, as well as to revoke any subgroup of users and roles. We give a full proof of security of our scheme against hierarchical collusion attacks. In contrast to the existing solutions for encrypted file systems, our scheme not only supports dynamic joining and revoking users, but also has shorter ciphertexts and constant-size decryption keys. © 2011 Springer Science+Business Media, LLC & Science Press, China.

关键词： Access control

来源：评论

学校读者我要写书评

暂无评论

Enabling fast prediction for ensemble models on data streams 11

Enabling fast prediction for ensemble models on data streams

引用

17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2011

作者： Zhang, Peng Li, Jun Wang, Peng Gao, Byron J. Zhu, Xingquan Guo, Li Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China National Engineering Laboratory for Information Content Security Beijing China Department of Computer Science Texas State University San Marcos TX 78666-4616 United States QCIS Faculty of Eng. and IT University of Technology Sydney NSW 2007 Australia

ISBN: (纸本)9781450308137

Ensemble learning has become a common tool for data stream classification, being able to handle large volumes of stream data and concept drifting. Previous studies focus on building accurate prediction models from stream data. However, a linear scan of a large number of base classifiers in the ensemble during prediction incurs significant costs in response time, preventing ensemble learning from being practical for many real world time-critical data stream applications, such as Web traffic stream monitoring, spam detection, and intrusion detection. In these applications, data streams usually arrive at a speed of GB/second, and it is necessary to classify each stream record in a timely manner. To address this problem, we propose a novel Ensemble-tree (E-tree for short) indexing structure to organize all base classifiers in an ensemble for fast prediction. On one hand, E-trees treat ensembles as spatial databases and employ an R-tree like height-balanced structure to reduce the expected prediction time from linear to sub-linear complexity. On the other hand, E-trees can automatically update themselves by continuously integrating new classifiers and discarding outdated ones, well adapting to new trends and patterns underneath data streams. Experiments on both synthetic and real-world data streams demonstrate the performance of our approach. Copyright 2011 ACM.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Buffer and Switch: An Efficient Road-to-Road Routing Scheme for VANETs

Buffer and Switch: An Efficient Road-to-Road Routing Scheme ...

引用

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Chao Song Ming Liu Yonggang Wen Jiannong Cao Guihai Chen School of Computer Science and Engineering University of Electronic Science and Technology Chengdu China School of Computer Engineering Nanyang Technological University Singapore Internet and Mobile Computing Laboratory Department of Computing Hong Kong Polytechnic University Hong Kong China School of Computer Science and Engineering Shanghai Jiaotong University Shanghai China

Vehicular Ad Hoc Networks (VANETs) are getting increasing attention from academic researchers and automotive industries. Timely and cost-efficient multi-hop data delivery among vehicles is essential for VANETs, and various routing protocols are envisioned for infrastructure-less vehicle-to vehicle (V2V) communications. Due to the road-constrained data delivery and highly dynamic topology of vehicle nodes, it's better to construct routing based on the road-to-road pattern than the traditional node-to-node routing pattern in MANETs. However, the challenging issue for the road-to-road routing in VANETs is the opportunistic forwarding at intersections. Therefore, we propose a novel routing scheme, called Buffer and Switch (BAS). In BAS, each road buffers the data packets with multiple duplicates propagation in order to provide more opportunities for packet switching at intersections. Different from conventional protocols in VANETs, the propagation of duplicates in BAS is bidirectional along the routing path. Moreover, BAS's cost is much lower than other flooding-based protocols due to its spatio-temporally controlled duplicates propagation. We conduct the extensive simulations to evaluate the performance of BAS based on the road map of a real city collected from Google Earth. The simulation results show that BAS can outperform the existing protocols, especially when the network resources are limited.

关键词： Roads Vehicles Routing Delay Protocols Packet switching Mobile computing

来源：评论

学校读者我要写书评

暂无评论

Strong security Enabled Certificateless Aggregate Signatures Applicable to Mobile Computation

Strong Security Enabled Certificateless Aggregate Signatures...

引用

International Conference on Intelligent Networking and Collaborative Systems (INCOS)

作者： Hu Xiong Qianhong Wu Zhong Chen Key Laboratory of Network and Software Security Assurance of the Ministry of Education Institute of Software School of Electronics Engineering and Computer Science Peking University Beijing China Department of Computer Engineering and Mathematics UNESCO Chair in Data Pr Universitat Rovira i Virgili Tarragona Spain Key Laboratory of AeroSpace Information Security and Trusted Computing Ministry of Education School of Computer Wuhan University of China China

An aggregate signature scheme allows a public algorithm to aggregate n signatures of n distinct messages from n signers into a single signature. By validating the single resulting signature, one can be convinced that the messages have been endorsed by all the signers. Certificateless aggregate signatures allow the signers to authenticate messages without suffering from the complex certificate management in the traditional public key cryptography or the key escrow problem in identity-based cryptography. In this paper, we present a new efficient certificate less aggregate signature scheme. Compared with up-to-date certificate less aggregate signatures, our scheme is equipped with a number of attracting features: (1) it is shown to be secure under the standard computational Diffie-Hellman assumption in the random oracle model, (2) the security is proven in the strongest security model so far, (3) the signers do not need to be synchronized, and (4) its performance is comparable to the most efficient up-to-date schemes. These features are desirable in a mobile networking and computing environment where the storage/computation capacity of the end devices are limited, and due to the wireless connection and distributed feature, the computing devices are easy to be attacked and hard to be synchronized.

关键词： Aggregates Games Generators Synchronization Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

An improved radius of gyration similarity measure between generalized fuzzy numbers and its application to multisource data fusion

引用

Journal of computers 2011年第8期6卷 1732-1739页

作者： Yong, Deng Dong, Sun Wen, Jiang Jianling, Xu College of computer and information sciences Southwest University Chongqing 400715 China Hangzhou Key Lab of E-Business and Information Security Hangzhou Normal University Hanzhou Zhejiang 310036 China School of Electronics and Information Technology Shanghai Jiao Tong University Shanghai 200240 China Key Laboratory of Intelligent Computing Information Processing of Ministry of Education Xiangtan University Xiangtan Hunan 411105 China Department of Electronics Engineering Northwestern Polytechnical University Xían 710072 China Grain Economics Institute Nanjing University of Finance and Economics Nanjing 210003 China

The degree of similarity between fuzzy numbers plays an important role in fuzzy information fusion. In this paper, improved ROG-based similarity measure developed from the current ROG method is presented. It is shown that the new method can overcome some shortcomings of the existing similarity measures. Based on the proposed similarity measure, a more flexible and intelligent algorithm is developed to deal with multisensor data fusion problems. A numerical example is used to illustrate the efficiency of the proposed method. © 2011 ACADEMY PUBLISHER.

关键词： Numerical methods

来源：评论

学校读者我要写书评

暂无评论

A light-weighted misused key detection in wireless sensor networks

A light-weighted misused key detection in wireless sensor ne...

引用

2010 International Conference on Computational Science and Its Applications, ICCSA 2010

作者： Han, Young-Ju Park, Min-Woo Kim, Jong-Myoung Chung, Tai-Myoung Internet Management Technology Laboratory Department of Electrical and Computer Engineering Sungkyunkwan University 300 Cheoncheon-dong Jangan-gu Suwon-si Gyeonggi-do 440-746 Korea Republic of Incidents Analysis Team Korea Internet Security Agency Korea Republic of

ISBN: (纸本)3642121780

In wireless sensor networks, sensor nodes are generally distributed in hostile environments so the security services such as confidentiality, authentication and integrity are very important. The basis of these security services is the key management. The majority of key managements use the random key pre-distribution mechanism based on the probability model. Thus, an adversary can easily get the keys between any two non-compromised nodes by compromising some number of nodes. If the adversary gets the keys, he can modify or insert messages into the communication channels. These kinds of attacks are very critical because the adversary may mislead the operation of the networks or the application. Recently, Liu and Dong proposed a method to detect the keys which is misused by an adversary. They suggested the additional protection for non-compromised sensor nodes even if an attacker has learned the shared key between them. To detect a misused key, the traffic overhead is inevitable but their method has some inefficient aspects by performing a unidirectional misused key detection and generating unnecessary traffic. In this paper, we enhance the misused key detecting mechanism by detecting a misused key bidirectionally and removing the unnecessary traffic while the security functionality of the Liu and Dong's scheme is preserved. Our simulation shows that the energy consumption of our scheme is 36% more efficient than that of the Liu and Dong's scheme on average. © 2010 Springer-Verlag Berlin Heidelberg.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

A translation framework for virtual execution environment on CPU/GPU architecture

A translation framework for virtual execution environment on...

引用

International Symposium on Parallel Architectures, Algorithms, and Programming

作者： Dong, Guoxing Chen, Kai Zhu, Erzhou Zhang, Yichao Qi, Zhengwei Guan, Haibing School of Software Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai 200240 China School of Information Security Engineering Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai 200240 China Department of Computer Science and Engineering Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai 200240 China

ISBN: (纸本)9780769543123

GPUs are many-core processors with tremendous computational power. However, as automatic parallelization has not been realized yet, developing high-performance parallel code for GPUs is still very challenging. The paper presents a novel translation framework designed for virtual execution environment based on CPU/GPU architecture. It addresses two major challenges of taking advantage of general purpose computation on graphics processing units (GPGPU) to improve performance: no rewriting the existing source code and resolving binary compatibility issues between different GPUs. The translation framework uses semi-automatic parallelization technology to port existing code to explicitly parallel programming models. It not only offers a mapping strategy from X86 platform to CUDA programming model, but also synchronizes the execution between the CPU and the GPUs. The input to our translation framework is parallelizable part of the program within binary code. With an additional information related to the parallelizable part, the translation framework transforms the sequential code into PTX code and execute it on GPUs. Experimental results on several programs from CUDA SDK Code Samples and Parboil Benchmark Suite show that our translation framework could achieve very high performance, even up to several tens of times speedup over the X86 native version. © 2010 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Efficient online trace building using code replication

Efficient online trace building using code replication

引用

International Conference on Grid and Cloud computing

作者： Deng, Haipeng Chen, Kai Liu, Bo He, Yunchao Zhou, Kan Yang, Yindong Liang, Alei Guan, Haibing School of Software Shanghai Jiao Tong University China Department of Computer Science and Engineering Shanghai Jiao Tong University China School of Information Security Engineering Shanghai Jiao Tong University China Shanghai Key Laboratory of Scalable Computing and Systems China

ISBN: (纸本)9780769543130

Hot trace building plays an important role in enhancing the performance of dynamic binary translators, since in most cases 10% of code takes 90% of execution time of the whole program. Hot traces can promote the code position to make better the locality of the code;therefore programs can achieve a better performance. Thus how to build qualified and long hot traces is the key point. Considering the situation when one single basic block is needed by more than two hot traces, code replication can help build hot traces with cost of expansion of code size. In this paper, a code replication method to help with building hot traces as well as code positioning is presented, and experiments have been done to evaluate the details of changes that code replication brings to the system, like trace fragment length, memory size expansion, etc. With this method, a performance promotion by 0.5%-3.5% against the original trace building method has been achieved. © 2010 IEEE.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Performance tuning towards a KVM-based low latency virtualization system

Performance tuning towards a KVM-based low latency virtualiz...

引用

2nd International Conference on Information engineering and computer Science, ICIECS 2010

作者： Zuo, Baojing Chen, Kai Liang, Alei Guan, Haibing Zhang, Jun Ma, Ruhui Yang, Hongbo School of Software Shanghai Jiao Tong University Shanghai 200240 China School of Information Security Engineering Shanghai Jiao Tong University Shanghai 200240 China Department of Computer Science and Engineering Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai 200240 China

ISBN: (纸本)9781424479412

Utilizing virtualization technology to combine real-time operating system (RTOS) and off-the-shelf time-sharing general purpose operating system (GPOS) is attracting much more interest recently. Such combination has the potential to provide a large application base, and to guarantee timely deterministic response to real-time applications, yet there is no convincible experimental result about its real-time property. In this paper, we analyze the interrupt latency of RTOS running on Linux KVM based on some preliminary tunings, and find out System Management Interrupt (SMI) is the main factor which makes the maximum latency unideal, so we propose a method to limit the worst-case interrupt latency in an acceptable interval. Furthermore, we also find out that boosting priority may result in wastes of CPU resources when RTOS is not executing real-time tasks, so we design a co-scheduling mechanism to improve the CPU throughput of the GPOS system. ©2010 IEEE.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：