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

2014 IEEE 5th International Conference on Software Engineering and Service Science

作者： Xinhong Hei Jinlong Zhang Bin Wang Haiyan Jin Nasser Giacaman Department of Electrical and Computer Engineering The University of Auckland Auckland New Zealand School of Computer Science and Engineering Xi’an University of Technology Shaanxi Key Laboratory for Network Computing and Security Technology

In order to reduce the complexity of traditional multithreaded parallel programming,this paper explores a new task-based parallel programming using the *** Task Parallel Library（TPL）.Firstly,this paper proposes a custom data partitioning optimization method to achieve an efficient data parallelism,and applies it to the matrix *** result of the application supports the custom data partitioning optimization *** we develop a task parallel application:Image Blender,and this application explains the efficiency and pitfall aspects associated with task ***,the paper analyzes the performance of our *** results show that TPL can dramatically alleviate programmer burden and boost the performance of programs with its taskbased parallel programming mechanism.

关键词： Parallel programming Task-based TPL Data parallelism Task parallelism

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Attribute-based encryption based access control scheme with constant-size ciphertext in cloud computing

引用

Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (Engineering and technology Edition) 2014年第3期44卷 788-794页

作者： Li, Qi Ma, Jian-Feng Xiong, Jin-Bo Zhang, Tao Liu, Xi-Meng School of Computer Science and Technology Xidian University Xi'an 710071 China Shaanxi Key Laboratory of Network and System Security Xidian University Xi'an 710071 China School of Telecommunications Engineering Xidian University Xi'an 710071 China

Based on Attribute-Based Encryption (ABE), a variety of access control schemes have been constructed in cloud computing. However, in these schemes, the ciphertext overhead goes linearly with the number of attributes used in encryption. To address this concern, a CCP-ABE (Constant-size Ciphertext Policy ABE) based access control scheme is proposed. The original data is encrypted by a symmetric key;then symmetric key is encrypted under an AND-gate access policy. Only the user who possesses a set of attributes that satisfy the policy can recover the symmetric key. The security of the proposed scheme is proved based on security of the CPA (Chosen Plaintext Attack) secure CCP-ABE scheme. Moreover, a method of constructing CCA (Chosen Ciphertext attack) secure CCP-ABE schemes is introduced. Performance analysis indicates that the ciphertext overhead over the number of attributes included in ciphertext is constant-size rather than linearity.

关键词： Access control

来源：评论

学校读者我要写书评

暂无评论

The cross-layer design of wireless mesh networks based on multimedia services

引用

Journal of Computational Information Systems 2013年第11期9卷 4495-4504页

作者： Sun, Qindong Zhang, Benliang Yang, Min Wang, Qian Key Lab. for Network Computing and Security of Shaanxi Province Xi'an University of Technology Xi'an 710048 China

In this paper, we have introduced a cross-layer design model which is based on multimedia services in order to favor the QoS demand in wireless mesh networks. By means of this model the relevant parameters in each layer of the whole network protocol stacks have been considered. Parameters Link consumption and packet error rate in the wireless transmission have been optimal controlled to enhance the throughput of wireless and optimize the overall performance of wireless mesh network. The experimental results show that compared with the general model, the average throughput of the multimedia transmission has increased more than 35% based on the cross-layer model proposed in this paper. Consequently the overall performance of the network has been optimized. © 2013 by Binary Information Press.

关键词： MESH networking

来源：评论

学校读者我要写书评

暂无评论

A User-Based Document Management Mechanism in Cloud

A User-Based Document Management Mechanism in Cloud

引用

International Conference on Computational Intelligence and security

作者： Guozhen Shi Mang Su Fenghua Li Jiapeng Lou Qiong Huang Department of Information Security Beijing Electronic Science and Technology Institute Beijing China State Key Laboratory of Integrated Services Network Xidian University Xi'an Shaanxi China State Key Laboratory of Information Security Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781479974351

The document plays an important role in the development of cloud computing. The user obtains and shares information by the electronic document. It is rich in content and various in representations. But the challenge to security is also brought. For the secure requirement for document in cloud, firstly, we will propose a novel user-based document secure management mechanism which introduces the re-encryption. The re-encrypted key will be generated according the access control conditions, so that the encryption of document creation will be combined with access control. Secondly, we will present the corresponding protocols and the implementation of the mechanism. Finally, the analysis of properties will be made.

关键词： Encryption Cloud computing Access control Servers Protocols

来源：评论

学校读者我要写书评

暂无评论

Adaptively secure key-policy ABE scheme with fast decryption

引用

Tongxin Xuebao/Journal on Communications 2014年 35卷 26-32页

作者： Li, Qi Ma, Jian-Feng Xiong, Jin-Bo Liu, Xi-Meng School of Computer Science and Technology Xidian University Xi'an710071 China Shaanxi Key Laboratory of Network and System Security Xidian University Xi'an710071 China Science and Technology on Communication Information Security Control Laboratory Jiaxing314033 China Faculty of Software Fujian Normal University Fuzhou350108 China School of Telecommunication Engineering Xidian University Xi'an710071 China

In the existing adaptively secure ABE (attribute-based encryption) schemes, the decryption cost goes linearly with the number of attributes that are used in decryption. An adaptively secure key-policy ABE (FKP-ABE) scheme with fast decryption is proposed, where constant size of computation overhead is implemented in decryption. This scheme is constructed on composite order bilinear groups and supports any monotonic access structure that can be expressed by LSSS (linear secret sharing schemes). The proposed scheme is proved to be adaptively secure in the standard model. ©, 2014, Editorial Board of Journal on Communications. All right reserved.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Forgeability of Wang-Zhu-Feng-Yau’s Attribute-Based Signature with Policy-and-Endorsement Mechanism

引用

Journal of Computer Science & technology 2013年第4期28卷 743-748页

作者：葛爱军黄欣沂陈成马传贵张锐 State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Information Science and Technology Institute State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Fujian Provincial Key Laboratory of Network Security and Cryptology School of Mathematics and Computer ScienceFujian Normal University Institute of Software Chinese Academy of Sciences

Recently, Wang et al. presented a new construction of attribute-based signature with policy-and-endorsement mechanism. The existential unforgeability of their scheme was claimed to be based on the strong Diffie-Hellman assumption in the random oracle model. Unfortunately, by carefully revisiting the design and security proof of Wang et alfs scheme, we show that their scheme cannot provide unforgeability, namely, a forger, whose attributes do not satisfy a given signing predicate, can also generate valid signatures. We also point out the flaws in Wang et al.＇s proof.

关键词： attribute-based signature existential unforgeability policy-and-endorsement

来源：评论

学校读者我要写书评

暂无评论

25th Annual Computational Neuroscience Meeting CNS-2016, Seogwipo City, South Korea, July 2-7, 2016 Abstracts

引用

BMC NEUROSCIENCE 2016年第1期17卷 1-112页

作者： [Anonymous] Computational Neurobiology Laboratory The Salk Institute for Biological Studies San Diego USA UNIC CNRS Gif sur Yvette France The European Institute for Theoretical Neuroscience (EITN) Paris France ATR Computational Neuroscience Laboratories Kyoto Japan Krembil Research Institute University Health Network Toronto Canada Department of Physiology University of Toronto Toronto Canada Department of Medicine (Neurology) University of Toronto Toronto Canada Department of Physics University of New Hampshire Durham USA Department of Neurophysiology Nencki Institute of Experimental Biology Warsaw Poland Department of Theory Wigner Research Centre for Physics of the Hungarian Academy of Sciences Budapest Hungary Department of Mathematical Sciences KAIST Daejoen Republic of Korea Department of Mathematics University of Houston Houston USA Department of Biochemistry & Cell Biology and Institute of Biosciences and Bioengineering Rice University Houston USA Department of Biology and Biochemistry University of Houston Houston USA Grupo de Neurocomputación Biológica Dpto. de Ingeniería Informática Escuela Politécnica Superior Universidad Autónoma de Madrid Madrid Spain Department of Biological Sciences University of Southern California Los Angeles USA Center for Neuroscience Korea Institute of Science and Technology Seoul South Korea Department of Neurology Albert Einstein College of Medicine Bronx USA Center for Neuroscience KIST Seoul South Korea Department of Neuroscience University of Science and Technology Daejon South Korea Systems Neuroscience Group QIMR Berghofer Medical Research Institute Herston Australia Department of Psychology Yonsei University Seoul South Korea Department of Psychiatry Kyung Hee University Hospital at Gangdong Seoul South Korea Department of Psychiatry Veterans Administration Boston Healthcare System and Harvard Medical School Brockton USA Department of Electrical and Electronic Engineering The University of Melbourne Parkvil

A1 Functional advantages of cell-type heterogeneity in neural circuits Tatyana O. Sharpee A2 Mesoscopic modeling of propagating waves in visual cortex Alain Destexhe A3 Dynamics and biomarkers of mental disorders Mitsuo Kawato F1 Precise recruitment of spiking output at theta frequencies requires dendritic h-channels in multi-compartment models of oriens-lacunosum/moleculare hippocampal interneurons Vladislav Sekulić, Frances K. Skinner F2 Kernel methods in reconstruction of current sources from extracellular potentials for single cells and the whole brains Daniel K. Wójcik, Chaitanya Chintaluri, Dorottya Cserpán, Zoltán Somogyvári F3 The synchronized periods depend on intracellular transcriptional repression mechanisms in circadian clocks. Jae Kyoung Kim, Zachary P. Kilpatrick, Matthew R. Bennett, Kresimir Josić O1 Assessing irregularity and coordination of spiking-bursting rhythms in central pattern generators Irene Elices, David Arroyo, Rafael Levi, Francisco B. Rodriguez, Pablo Varona O2 Regulation of top-down processing by cortically-projecting parvalbumin positive neurons in basal forebrain Eunjin Hwang, Bowon Kim, Hio-Been Han, Tae Kim, James T. McKenna, Ritchie E. Brown, Robert W. McCarley, Jee Hyun Choi O3 Modeling auditory stream segregation, build-up and bistability James Rankin, Pamela Osborn Popp, John Rinzel O4 Strong competition between tonotopic neural ensembles explains pitch-related dynamics of auditory cortex evoked fields Alejandro Tabas, André Rupp, Emili Balaguer-Ballester O5 A simple model of retinal response to multi-electrode stimulation Matias I. Maturana, David B. Grayden, Shaun L. Cloherty, Tatiana Kameneva, Michael R. Ibbotson, Hamish Meffin O6 Noise correlations in V4 area correlate with behavioral performance in visual discrimination task Veronika Koren, Timm Lochmann, Valentin Dragoi, Klaus Obermayer O7 Input-location dependent gain modulation in cerebellar nucleus neurons Maria Psarrou, Maria Schilstra, Neil Davey, Benjamin Torben-Ni

关键词：

来源：评论

学校读者我要写书评

暂无评论

DMAT: A new network and computer attack classification

引用

Journal of Engineering Science and technology Review 2013年第5期6卷 101-106页

作者： Jiang, Wei Tian, Zhi-Hong Cui, Xiang College of Computer Science Beijing University of Technology Beijing 100124 China School of Computer National University of Defense Technology Changsha 410073 China Key Laboratory of Information and Network Security Ministry of Public Security Shanghai 201204 China School of Computer Science and Technology Harbin Institute of Technology Haerbin 150001 China The Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China

With the rapid development of computer network and information technology, the Internet has been suffering from a variety of security attacks over the past few years. Attacks have become both numerous and complex, and the defender can not understand. In order to understand and defend against cyber attacks, it is necessary to understand the kind of attack. In this paper, we study computer and network attacks, and introduce a classification of them and propose a cyber attack classification called DMAT (Defense-oriented Multidimensional Attack Taxonomy). We use nine categories to describe the characteristic of the attack, which are attack target, attack impact, attack purpose, attack cost, attack exploiting, attack source, attack automation, attack loss and defense. The ninth category in the DMAT, classification by defense, is used to provide the defender with instructions of how to defense an attack. Compared to the existing taxonomies, our taxonomy efficiently classifies complex attacks and guide the defender to defense the possible attack. © 2013 Kavala Institute of technology. All rights reserved.

关键词： network security

来源：评论

学校读者我要写书评

暂无评论

Efficient public key cryptosystem resilient to key leakage chosen ciphertext attacks 1

引用

Cryptographers' Track at the RSA Conference 2013, CT-RSA 2013

作者： Liu, Shengli Weng, Jian Zhao, Yunlei Dept. of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240 China Department of Computer Science Emergency Technology Research Center of Risk Evaluation and Prewarning on Public Network Security Jinan University China Software School Fudan University Shanghai 201203 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100093 China Shanghai Key Laboratory of Scalable Computing and Systems Shanghai China

ISBN: (数字)9783642360954

ISBN: (纸本)9783642360947

Leakage-resilient public key encryption (PKE) schemes are designed to resist "memory attacks", i.e., the adversary recovers the cryptographic key in the memory adaptively, but subject to constraint that the total amount of leaked information about the key is bounded by some parameter λ. Among all the IND-CCA2 leakage-resilient PKE proposals, the leakage-resilient version of the Cramer-Shoup cryptosystem (CS-PKE), referred to as the KL-CS-PKE scheme proposed by Naor and Segev in Crypto09, is the most practical one. But, the key leakage parameter λ and plaintext length m of KL-CS-PKE are subject to λ + m ≤ log q - ω(log κ), where κ is security parameter and q is the prime order of the group on which the scheme is based. Such a dependence between λ and m is undesirable. For example, when λ (resp., m) approaches to log q, m (resp., λ) approaches to 0. In this paper, we designed a new variant of CS-PKE that is resilient to key leakage chosen ciphertext attacks. Our proposal is λ ≤ log q - ω(log κ) leakage-resilient, and the leakage parameter λ is independent of the plaintext space that has the constant size q (exactly the same as that in CS-PKE). The performance of our proposal is almost as efficient as the original CS-PKE. As far as we know, this is the first leakage-resilient CS-type cryptosystem whose plaintext length is independent of the key leakage parameter, and is also the most efficient IND-CCA2 PKE scheme resilient to up to log q - ω(log κ) leakage. © 2013 Springer-Verlag.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：