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

International Conference on computer and Information Technology (CIT)

作者： Hui Lin Jia Hu Jiajia Liu Li Xu Yulei Wu Fujian Provincial Key Laboratory of Network Security and Cryptology Fujian Normal University Fuzhou China Department of Mathematics and Computer Science Liverpool Hope University Liverpool UK School of cyber engineering Xidian university Xian China Fujian Normal University Fuzhou Fujian CN College of Engineering University of Exeter Exeter UK

ISBN: (纸本)9781509001552

Data veracity ensures that the data used are trusted, authentic and protected from unauthorized access and modification. In order to implement the veracity of big data, specific trust models and approaches must be designed and developed. In this paper, a category based context aware and recommendation incentive based reputation mechanism (CCRM) is proposed to defend against the internal attacks to enhance the big data veracity in mobile cloud computing (MCC). Simulation results and performance analysis demonstrate the superior performance of the CCRM in terms of the utility of the recommender, the reputation decrease speed and update accuracy, compared to the existing reputation mechanisms under internal collusion attacks and bad mouthing attacks in MCC.

关键词： Big data security Mobile communication Data models Cloud computing Context-aware services Sensors

来源：评论

学校读者我要写书评

暂无评论

Data dispersal for large storage systems

Data dispersal for large storage systems

引用

International Conference on Machine Tool Technology and Mechatronics engineering, ICMTTME 2014

作者： Zhang, Ling Zhu, Shuai Shuai Computer Teaching and Research Group Xi’an FanYi University Xi’an China Key Laboratory of Network and Information Security of APF Engineering University of APF Xi’an China

ISBN: (纸本)9783038352464

Data dispersal mechanism is a group of basic working protocols for oceans of data processing and it plays an important role in enhancing system error correction and avoiding storage device failure. The data recovery availability of the client is the main design goal of data dispersal algorithms. The system storage and computing costs are also important factors for a data dispersal algorithm. In this paper, we discussed how to disperse data with the special properties as well as with acceptable system costs. We developed a universal approach to measure storage node availability based on state variables. After analyzed the existing data processing algorithms, we presented a new hybrid data dispersal algorithm using the above approach in detail evaluation. Two redundancy policies are adapted to storage node with different node availability. According to our analysis, this algorithm has its advantages in system storing and communication bandwidth costs. © (2014) Trans Tech Publications, Switzerland.

关键词： Virtual storage

来源：评论

学校读者我要写书评

暂无评论

An Energy-saving Algorithm for Wireless Sensor networks Based on network Coding and Compressed Sensing

引用

中国通信 2014年第S1期11卷 171-178页

作者： QIN Tuanfa MENG Yunfan LI Liangliang WAN Haibin ZHANG Dongmei School of Computer and Electronic Information Guangxi University Nanning 530004 China Guangxi Key Laboratory of Multimedia Communications and Network Technology Guangxi University Nanning 530004 China Information Security Center Beijing University of Posts and Telecommunications Beijing 100876 China National Engineering Laboratory for Disaster Backup and Recovery Beijing 100876 China

An energy-saving algorithm for wireless sensor networks based on network coding and compressed sensing (CS-NCES) is proposed in this paper. Along with considering the correlations of data spatial and temporal, the algorithm utilizes the similarities between the encoding matrix of network coding and the measurement matrix of compressed sensing. The source node firstly encodes the data, then compresses the coding data by compressed sensing over finite fields. Compared with the network coding scheme, simulation results show that CS-NCES reduces the energy consumption about 25.3%-34.5% and improves the efficiency of data reconstruction about 1.56%-5.98%. The proposed algorithm can not only enhance the usability of network coding in wireless sensor networks, but also improve the network performance.

关键词： wireless sensor networks network coding compressed sensing deterministic matrix network energy-efficiency

来源：评论

学校读者我要写书评

暂无评论

An optimized strategy for data service response with template-based caching and compression

An optimized strategy for data service response with templat...

引用

2013 International Conference on Service-Oriented Computing,ICSOC 2013

作者： Peng, Zhang Kefu, Xu Yan, Li Li, Guo Institute of Information Engineering Chinese Academy of Sciences Beijing China National Engineering Laboratory for Information Security Technologies Beijing China National Computer Network Emergency Response Technical Team Beijing China

ISBN: (纸本)9783319068589

Data service is a specialization of Web service, and end-users can synthesize cross-organizational data by composing data services. As composite schemes overlap each other, some primitive data services could be called repeatedly by composite data services, so that the response delay and server load are aggravated. In this paper, an optimized strategy for data service response with template-based caching and compression is proposed. Firstly, the strategy uses the message template to extract the application-relevant values from SOAP messages. Secondly, the strategy holds the objects from application-relevant values rather than XML representations to decrease the overhead of SOAP message parsing. Thirdly, the strategy uses the XMill compression algorithm to decrease the volume of data transmitted. Extensive experiments based on Spring-WS-Test benchmark demonstrate the strategy is an effective approach to reduce response latency and server load compared to non-caching tehcnniques. © Springer International Publishing Switzerland 2014.

关键词： Data compression

来源：评论

学校读者我要写书评

暂无评论

A novel proxy re-encryption with keyword search 3

A novel proxy re-encryption with keyword search

引用

3rd International Conference on Information Technology and Management Innovation, ICITMI 2014

作者： Meng, Xian Yong Chen, Zhong Meng, Xiang Yu Zhuhai College of Jilin University Zhuhai China School of Electronics Engineering and Computer Science Peking University Beijing China Key Laboratory of Network and Software Security Assurance Ministry of Education Beijing China

ISBN: (纸本)9783038352396

In this paper, a novel proxy re-encryption (PRE) scheme with keyword search is proposed, where only the ciphertext containing the keyword set by the delegator can be transformed by the semi-trusted proxy and then decrypted by delegatee. In the proposed scheme, the semi-trusted proxy can convert the ciphertext encrypted under the delegator’s public key into the ciphertext encrypted under the delegatee’s public key. In addition, only the delegatee’s email gateway with a trapdoor can test whether or not a given cipheretext containing some keyword, but can learn nothing else about the sensitive data of email. We proposed an identity-based proxy re-encryption with keyword search scheme, where the delegator and the delegatee extract keys from a trusted party called the key generator center (KGC), who generates public-private key pair for delegator and delegatee based on their identities. Meanwhile, the identity-based proxy re-encryption with keyword search scheme satisfies the properties of PRE including unidirectionality, multi-use and transparency. Additionally, the proposed scheme is efficient in terms of both computation and communication, and can realize security privacy preserving in cloud computing environments. © 2014 Trans Tech Publications, Switzerland.

关键词： Sensitive data

来源：评论

学校读者我要写书评

暂无评论

One forward-secure signature scheme using bilinear maps and its applications

One forward-secure signature scheme using bilinear maps and ...

引用

作者： Yu, Jia Kong, Fanyu Cheng, Xiangguo Hao, Rong Li, Guowen College of Information Engineering Qingdao University 266071 Qingdao China Shandong Provincial Key Laboratory of Computer Network 250014 Jinan China Institute of Network Security Shandong University 250100 Jinan China Key Lab of Cryptographic Technology and Information Security Ministry of Education Jinan 250100 China School of Computer Science and Technology Shandong Jianzhu University 250100 Jinan China

Forward-secure signatures are proposed to deal with the key exposure problem. Compared to regular signatures, forward-secure signatures have a special update algorithm that can evolve the new private key in each time period. Therefore, it can protect the security of signatures previous to the time period of key exposure. The efficiency is an important issue of forward-secure signatures. In this paper, we construct a new forward-secure signature scheme using bilinear maps. In this scheme, all performance parameters have complexities of log magnitude in terms of the total time periods. In addition, our scheme needs very few (only triple) pairing operations in the verifying algorithm, which is very important because the pairing operation is very time-consuming. This scheme is proved to be forward secure in the random oracle model assuming the CDH problem is hard. Finally, we give some applications of this scheme including constructing an intrusion-resilient signature scheme and constructing a forward-secure threshold signature scheme. © 2014 Elsevier Inc. All rights reserved.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

security analysis on "Strongly secure certificateless key-insulated signature secure in the standard model"

Security analysis on "Strongly secure certificateless key-in...

引用

International Conference on Intelligent Information Hiding and Multimedia Signal Processing

作者： Feng Wang Li Xu Jeng-Shyang Pan College of Mathematics and Physics Fujian University of Technology Fuzhou Fujian 350118 China Fujian Provincial Key Laboratory of Network Security and Cryptology School of Mathematics and Computer Science Fujian Normal University Fuzhou Fujian 350117 Fujian Provincial Key Laboratory of Network Security and Cryptology School of Mathematics and Computer Science Fujian Normal University Fuzhou Fujian 350117 China College of Information Science and Engineering Fujian University of Technology Fuzhou Fujian 350118China

ISBN: (纸本)9781509001897

Certificateless signature eliminates the need of certificates in traditional public key signature and solves the inherent key escrow problem in identity-based signature. Therefore, it is an important secure requirement to solve key escrow problem in certificateless signature scheme, i.e., certificateless signature scheme should to resist the malicious but passive KGC attack. Key-insulated signature reduces the endangerment of private key leakage. Recently, Chen et al. propose a certificateless key-insulated signature scheme, and give the security proof in the standard model. In this paper, we give a security analysis of Chen et al.'s scheme. Our analysis reveals that Chen et al.'s scheme is vulnerable to the malicious-but-passive KGC attack.

关键词： Certificateless signature key-insulated signature malicious-but-passive KGC attack

来源：评论

学校读者我要写书评

暂无评论

A Provably secure Certificate based ring signature without pairing

引用

International Journal of network security 2014年第4期16卷 278-285页

作者： Qin, Zhiguang Xiong, Hu Li, Fagen School of Computer Science and Engineering University of Electronic Science and Technology of China No. 4 North Jianshe Road Chenghua District chengdu Sichuan 610054 China Key Lab of Network Security and Cryptology Fujian Normal University No. 8 Shangsan Road Cangshan District Fuzhou Fujian 350007 China State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences No. 19 Yuquan Road Shijingshan District Beijing 100190 China

In Eurocrypt 2003, Gentry introduced the notion of certificate-based encryption. The merit of certificate-based encryption lies in implicit certificate and no private key escrow. This feature is desirable especially for the efficiency and the real spontaneity of ring signature, which involve a large number of public keys in each execution. In this paper, we propose an efficient certificate-based ring signature scheme which does not require any pairing computation. Furthermore, this scheme is proven secure under the Discrete Logarithm assumption in the random oracle model. To the best of authors' knowledge, this is the first construction of certificate-based ring signature scheme in the literature that has such kind of feature.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

An identity-based conditional proxy re-encryption in cloud computing environments

An identity-based conditional proxy re-encryption in cloud c...

引用

作者： Meng, Xian Yong Chen, Zhong Meng, Xiang Yu Sun, Bing Zhuhai College of Jilin University Zhuhai China School of Electronics Engineering and Computer Science Peking University Beijing China Key Laboratory of Network and Software Security Assurance Ministry of Education Beijing China Information Institute Guangdong Ocean University Zhanjiang China

ISBN: (纸本)9783038351399

In this paper, an identity-based conditional proxy re-encryption (PRE) scheme is proposed, where a delegator provides a re-encryption key satisfying one condition to a semi-trusted proxy who can convert a ciphertext encrypted under the delegator's public key into one that can be decrypted using the delegatee's private key. We address the identity-based proxy re-encryption scheme, where the delegator and the delegatee request keys from a trusted party known as a key generator center (KGC), who generates private keys for delegator and delegatee based on their identities. Meanwhile, the identity-based conditional proxy re-encryption scheme satisfies the properties of PRE including unidirectionality, non-interactivity and multi-hop. Additionally, the identity-based conditional proxy re-encryption scheme is efficient in terms of both the communication cost and the computing cost, and can realize security secret sharing in cloud computing environments. © (2014) Trans Tech Publications, Switzerland.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Independent component analysis based on information bottleneck

Abstract and Applied Analysis

引用

Abstract and Applied Analysis 2015年第1期2015卷

作者： Ke, Qiao Zhang, Jiangshe Srivastava, H.M. Wei, Wei Chen, Guang-Sheng School of Mathematics and Statistics Xi'An Jiaotong University Xi'an 710049 China Department of Mathematics and Statistics University of Victoria Victoria V8W3R4 BC Canada School of Computer Science and Engineering Xi'An University of Technology Shaanxi Key Laboratory for Network Computing and Security Technology Xi'an 710048 China Department of Construction and Information Engineering Guangxi Modern Vocational Technology College Hechi Guangxi 547000 China

The paper is mainly used to provide the equivalence of two algorithms of independent component analysis (ICA) based on the information bottleneck (IB). In the viewpoint of information theory, we attempt to explain the two classical algorithms of ICA by information bottleneck. Furthermore, via the numerical experiments with the synthetic data, sonic data, and image, ICA is proved to be an edificatory way to solve BSS successfully relying on the information theory. Finally, two realistic numerical experiments are conducted via FastICA in order to illustrate the efficiency and practicality of the algorithm as well as the drawbacks in the process of the recovery images the mixing images. © 2015 Qiao Ke et al.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：