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

Cryptanalysis of a fuzzy identity based encryption scheme in the standard model

Informatica (Netherlands) 2012年第2期23卷 299-314页

作者： Wang, Xu An Yang, Xiaoyuan Zhang, Minqing Yu, Yong Key Laboratory of Information and Network Security Engineering University of Chinese Armed Police Force Xi'an 710086 China School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 610054 China

Fuzzy identity based encryption (FIBE), proposed by Sahai and Waters, is a new kind of identity based encryption. It allows users with identity w can decrypt ciphertext for w' if and only if w is close enough to w'. Recently, Ren et al. proposed a new FIBE scheme and claimed it is fully CCA2 secure in the standard model with a tight reduction. However, in this paper we will show that their scheme is not correct. Furthermore, the key generation process of their scheme cannot resist the collusion attack, which is a basic security requirement for FIBE. At last, we propose a new fully secure FIBE scheme based on the Sahai-Waters FIBE scheme and prove its security by using the "dual system encryption" technique. © 2012 Vilnius University.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

SAR RANGE AMBIGUITY SUPPRESSION VIA SPARSE REGULARIZATION

SAR RANGE AMBIGUITY SUPPRESSION VIA SPARSE REGULARIZATION

引用

IEEE International Geoscience and Remote Sensing Symposium

作者： Jian Fang Zongben Xu Chenglong Jiang Bingchen Zhang Wen Hong Ministry of Education Key Lab for Intelligent Networks and Network Security & Xi'an Jiaotong University Science and Technology on Microwave Imaging Laboratory & Institute of Electronics Chinese Academy of Sciences (IECAS)

ISBN: (纸本)9781467311601

Range ambiguity in synthetic aperture radar (SAR) imaging primarily arises from scattered energy of bright targets out-side the interested region. So to reduce the ambiguity, we need to identify these targets additionally, which yields an ill-posed problem. To find a feasible solution where the range ambiguity can be sufficiently reduced, we propose in this paper a new method using compressed sensing, a theory which tells when sparse signal can be reconstruct from undetermined linear system, by observing that the recognizable targets are approximately sparse in the ambiguous range zones. Therefore, it is possible to reconstruct the main region and identify the ambiguous targets simultaneously. The simulation results demonstrate the validation of the proposed method.

关键词： Range Ambiguity Suppression Compressed Sensing L_q Regularization

来源：评论

学校读者我要写书评

暂无评论

A Parallel NURBS-based Isogeometric Analysis Framework on Multi-core CPUs

A Parallel NURBS-based Isogeometric Analysis Framework on Mu...

引用

2012年全国理论计算机科学学术年会(NCTCS2012)

作者： Licai Guo Zhangjin Huang School of Computer Science and Technology University of Science and Technology of China PR China USTC-SICT Joint Laboratory on Network and Key Laboratory of Software in Computing and Communication Anhui Province PR China USTC-SICT Joint Laboratory on Network and Communication PR China School of Computer Science and Technology University of Science and Technology of China PR China

parallel framework for NURBS-based isogeometric analysis on multi-core cpus is presented in this *** framework is composed of two parts:(1) construction of the stiffness matrix and right hand side vector; (2) a parall...

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Mixed Deterministic Model for Coreference Resolution 12

A Mixed Deterministic Model for Coreference Resolution

引用

Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning

作者： Bo Yuan Qingcai Chen Yang Xiang Xiaolong Wang Liping Ge Zengjian Liu Meng Liao Xianbo Si Intelligent Computing Research Center Key Laboratory of Network Oriented Intelligent Computation Computer Science and technology Department Harbin Institute of Technology Shenzhen graduate School Shenzhen Guangdong 518055 China

ISBN: (纸本)9781627484046

This paper presents a mixed deterministic model for coreference resolution in the CoNLL-2012 shared task. We separate the two main stages of our model, mention detection and coreference resolution, into several sub-tasks which are solved by machine learning method and deterministic rules based on multi-filters, such as lexical, syntactic, semantic, gender and number information. We participate in the closed track for English and Chinese, and also submit an open result for Chinese using tools to generate the required features. Finally, we reach the average F1 scores 58.68, 60.69 and 61.02 on the English closed task, Chinese closed and open tasks.

关键词： Coreference Resolution deterministic English English language Chinese Chinese philosophy Chinese art

来源：评论

学校读者我要写书评

暂无评论

Alliance-Authentication Protocol in Clouds computing Environment

引用

China Communications 2012年第7期9卷 42-54页

作者： Zhang Qikun Li Yuanzhang Song Danjie Tan Yuan School of Computer Science and Technology Beijing Institute of Technology Beijing 100081 P. R. China Network and Data Security Key Laboratory of Sichuan Province University of Electronic Science and Technology ofChina Chengdu 610054 P. R. China School of Computer Beijing University of Posts and Telecommunications Beijing 100876 P. R. China

security has been regarded as one of the hardest problems in the development of cloud computing. This paper proposes an AllianceAuthentication protocol among Hybrid Clouds that include multiple private clouds and/or public clouds. Mu tual authentication protocol among entities in the IntraCloud and InterCloud is proposed. Blind signature and bilinear mapping of automorphism groups are adopted to achieve the InterCloud Alli anceAuthentication, which overcome the complexi ty of certificate transmission and the problem of communication bottlenecks that happen in tradi tional certificatebased scheme. Blind key, instead of private key, is adopted for register, which avoids

关键词： Alliance-Authentication direct product decomposition bilinear mapping cloud computing

来源：评论

学校读者我要写书评

暂无评论

Leaf image recognition using Fourier transform based on ordered sequence

Leaf image recognition using Fourier transform based on orde...

引用

8th International Conference on Intelligent computing technology, ICIC 2012

作者： Yang, Li-Wei Wang, Xiao-Feng Department of Automation University of Science and Technology of China Hefei Anhui 230027 China Intelligent Computing Laboratory Hefei Institute of Intelligent Machines Chinese Academy of Sciences P.O. Box 1130 Hefei Anhui 230031 China Key Lab. of Network and Intelligent Information Processing Hefei University Hefei Anhui 230601 China

ISBN: (纸本)9783642315879

There are a number of leaf recognition methods, but most of them are based on Euclidean space. In this paper, we will introduce a new description of feature for the leaf image recognition, which represents the leaf contour with the ordered sequence. For a leaf image, points on the contour represent the most important information of the leaf. Thus, by extracting serial points of the leaf contour, the unique corresponding ordered sequence can be obtained for a contour. Then, we can compute the amplitude-frequency feature by performing the Discrete Fourier transform on the ordered sequence. Since the low-frequency part of the Fourier transform represents the global information and the high-frequency part the local details, we can adopt the amplitude-frequency feature for leaf image recognition. Experimental results on the famous Swedish library and ICL library show that the proposed feature is effective for leaf image recognition. © 2012 Springer-Verlag.

关键词： Image recognition

来源：评论

学校读者我要写书评

暂无评论

In-Field Testing of NAND Flash Storage: Why and How?

In-Field Testing of NAND Flash Storage: Why and How?

引用

Asian Test Symposium (ATS)

作者： Yu Hu Xinli Gu Xiaowei Li State Key Laboratory of Computer Architecture Institute of Computing Technology CAS Beijing China North America Network Division Huawei Technologies Company Limited Santa Clara USA

NAND Flash memories have rapidly emerged as a storage class memory such as SSD (Solid State Disk), CF (Compact Flash) Card, SD (Secure Digital Memory) Card. Due to its distinct operation mechanisms, NAND Flash memory suffers from erase/program endurance, data retention and program/read disturbance problems. Specifically, erase and program operation keeps in developing bad blocks during the lifetime of memory chips. Bad blocks are blocks that contain faulty bits but the ECC (Error Correction Code) algorithm cannot correct them. Although wear leveling tries to balance the erase/program operations on different blocks so that all blocks can wear out at a similar pace, new bad blocks still inevitably *** propose an in-field testing technique which takes some pages in a block as predictors. Due to wear out faster than the other pages, the predictors will become bad before the other pages in the block become bad. The further questions are (1) how to detect those wearing fast pages so as to use them as predictors, (2) how many predictors are needed to achieve a satisfactory prediction accuracy, (3) misprediction will result in what negative impact on performance and endurance.

关键词： Flash memory Error correction codes Laboratories Computer architecture North America Computers

来源：评论

学校读者我要写书评

暂无评论

Identity-based proxy cryptosystems with revocability and hierarchical confidentialities

Identity-based proxy cryptosystems with revocability and hie...

引用

作者： Wang, Lihua Wang, Licheng Mambo, Masahiro Okamoto, Eiji Network Security Research Institute Koganei-shi 184-8795 Japan State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China Faculty of Electrical and Computer Engineering Institute of Science and Engineering Kanazawa University Kanazawa-shi 920-1192 Japan School of Systems and Information Engineering University of Tsukuba Tsukuba-shi 305-8573 Japan

Proxy cryptosystems are classified into proxy decryption systems and proxy re-encryption systems on the basis of a proxy's role. In this paper, we propose an ID-based proxy cryptosystem with revocability and hierarchical confidentialities. In our scheme, on receiving a ciphertext, the proxy has the rights to perform the following three tasks according to the message confidentiality levels of the sender's intention: (1) to decrypt the ciphertext on behalf of the original decryptor;(2) to re-encrypt the ciphertext such that another user who is designated by the original decryptor can learn the message;(3) to do nothing except for forwarding the ciphertext to the original decryptor. Our scheme supports revocability in the sense that it allows proxy's decryption and re-encryption rights to be revoked even during the valid period of the proxy key without changing the original decryptor's public information. We prove that our proposal is indistinguishable against chosen identity and plaintext attacks in the standard model. We also show how to convert it into a system against chosen identity and ciphertext attacks by using the Fujisaki-Okamoto transformation. © 2012 The Institute of Electronics, Information and Communication Engineers.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

A bilateral secure threshold signature scheme with distinguished signing authorities

引用

International Journal of Advancements in computing technology 2012年第8期4卷 100-107页

作者： Lize, Gu Feng, Wang Yousheng, Zhou Shi-hui, Zheng Information Security Center State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China Mathematic Department of Dezhou University Dezhou 253023 China Chongqing University of Posts and Telecommunications Chongqing 400065 China Key Laboratory of network and information attack and defence technology of MOE Beijing University of Posts and Telecommunications Beijing 100876 China

Forward secure threshold signature plays an important role in distributed signature. In order to enhance the security and efficient of the forward secure threshold signature, a new forward secure threshold signature is proposed. The proposed scheme achieves not only the forward security but also the backward security for the threshold signature. The disclosure of group secret key or individual secret keys can not threat the signature security of all time period. Instead of signing the whole document, the group members only sign a smaller part by themselves in the scheme. The size of a group signature is equivalent to that of any individual signature. Such an approach achieves the justification of labor-division and responsibility-sharing inherent in the group works. Moreover, the bandwidth of data transmission for group signature construction can be further reduced. Analysis shows that the proposed scheme is more secure and efficient.

关键词： Distinguished Signing Authorities Forward security Group-oriented Threshold Signature

来源：评论

学校读者我要写书评

暂无评论

A secure message transaction protocol for delay tolerant networks

引用

Journal of Communications 2012年第SPL.ISS. 8期7卷 622-633页

作者： Jia, Zhongtian Li, Lixiang Yu, Zhuoran Li, Shudong Yang, Yixian School of Information Science and Engineering Shandong Provincial Key Laboratory of Network Based Intelligent Computing University of Jinan Jinan 250022 China Information Security Center Beijing University of Posts and Telecommunications Beijing 100876 China School of Science Beijing University of Posts and Telecommunications Beijing 100876 China

Delay/disruption tolerant network adopts a storecarry-and-forward mechanism, of which all the participants are assumed to cooperate with one another in message delivery, to overcome the challenges of the intermittent connection and the time-varying network topology. Unfortunately, there are always some nodes deviating from the rules in order to save their own precious resources. To address the selfishness and the security problems, we propose a secure message transaction protocol for delay tolerant networks, in which the messages are encrypted by the source nodes and authorized by the TTP before they are propagated in the networks. The signatures are aggregated sequentially by the source node and the subsequent forwarders. The aggregated signatures record the message delivery paths. By checking the signatures aggregated so far, the intermediate nodes can be sure of the message authenticity and decide whether to deliver the messages to the next hops or not. Thus, the free riding attacks and path forging attacks are prevented. Furthermore, the payment mechanism of the proposed scheme makes the participants have no incentive to launch the collusion attacks in the path disclosure. In addition, the hash binary tree is harnessed to decrease the number of authorization times when fragmentation is invoked at the source, and the relationship between the delivery overhead and the authorization times is presented. In the proposed scheme, the cipher computation and bundle envelopment can be performed off-line, without the information of next hops, while the DTN nodes are driving freely without any DTN connections. Performance analysis and simulation results prove that this off-line computing design is efficient in terms of delivery ratio and delivery speed. © 2012 ACADEMY PUBLISHER.

关键词： Delay tolerant networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：