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

Chosen-ciphertext secure bidirectional proxy broadcast re-encryption schemes

International Journal of Information and Communication Technology 2016年第4期8卷 405-419页

作者： Sun, Jin Hu, Yupu Department of Application Mathematics Xi'an University of Technology Xi'an710048 China Key Lab. of Computer Network and Information Security Xidian University Xi'an710071 China

A proxy re-encryption (PRE) scheme supports the delegation of decryption rights via a proxy, who makes the ciphertexts decryptable by the delegatee. However, how to structure a chosen-ciphertext secure proxy re-encryption scheme without pair is still an open question. In this paper, by adjusting the Schnorr signature scheme and giving the accessional ciphertext components, a bidirectional (which the proxy is able to transform ciphertexts in both directions) proxy broadcast re-encryption schemes (PBRE) was proposed without pair, and the reduction of scheme's security is the computational Diffie-Hellman (CDH) assumption. The proof of security shows that the proposed scheme is chosen-ciphertext attack secure in the random oracle model. Copyright © 2016 Inderscience Enterprises Ltd.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

AUV dead-reckoning navigation based on neural network using a single accelerometer 11

AUV dead-reckoning navigation based on neural network using ...

引用

11th ACM International Conference on Underwater networks and Systems, WUWNet 2016

作者： Xie, Yan-Xin Liu, Jun Hu, Cheng-Quan Cui, Jun-Hong Xu, Hongli State Key Laboratory of Robotics CAS No. 114 Nanta Street Shenhe District Shenyang China College of Computer Science and Technology Jilin University Changchun China Underwater Sensor Network Lab. University of Connecticut StorrsCT06269 United States Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China

ISBN: (纸本)9781450346375

The accuracy of the Autonomous Underwater Vehicles (AUVs) navigation system determines whether they can safely operate and return. Traditional Dead-reckoning (DR) relies on the inertial sensors such as gyroscope and accelerometer. A major challenge for DR navigation is from measurement error of the inertial sensors (gyroscope, accelerometer, etc.), especially when the AUV is near or at the ocean surface. The AUV's motion is affected by ocean waves, and its pitch angle changes rapidly with the waves. This rapid change and the measurement errors will cause great noise to the direction measured by gyroscopes, and then lead to a large error to the DR navigation. To address this problem, a novel DR method based on neural network (DR-N) is proposed to explore the time-varying relationship between acceleration measurement and orientation measurement, which leverages acoustic localization and neural network estimate timely pitch angle through the explored time-varying relationship. This method enables AUV's DR navigation with a single acceleration, without relying on both acceleration and gyroscope. Most importantly, we can improve the accuracy of AUV navigation through avoiding DR errors caused by gyroscope noise at the sea surface. Simulations show DR-N significantly improves navigation accuracy.

关键词： Accelerometers

来源：评论

学校读者我要写书评

暂无评论

The design and implementation of network attack and defense platform based on cloud desktop

引用

Journal of Physics: Conference Series 2017年第1期887卷

作者： Zining Yan Yunhan Wang Shijiao Shao Boquan Li Embedded System Lab. College of Computer Science and Technology Harbin China Institute of Information Engineering Chinese Academy of Sciences School of Cyber Security University of Chinese Academy of Sciences Key Laboratory of Network Assessment of Technology Chinese Academy of Sciences Beijing China

This paper discusses the cloud desktop technology, virtualization technology and penetration testing technology used in the network attack and defense training platform, and introduces the design and implementation process of the network attack and defense training platform. This paper focuses on the cloud desktop construction scheme based on B/S structure, and aims to enhance the flexibility and convenience of network attack and defense training platform.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A simulator for swarm AUVs acoustic communication networking 11

A simulator for swarm AUVs acoustic communication networking

引用

11th ACM International Conference on Underwater networks and Systems, WUWNet 2016

作者： Li, Guannan Liu, Jun Wang, Xue Xu, Hongli Cui, Jun-Hong Shenyang Institute of Automation CAS University of Chinese Academy of Sciences No. 114 Nanta Street Shenhe District Shenyang China College of Computer Science and Technology Jilin University State Key Laboratory of Robotics Key Laboratory of System Control and Information Processing Ministry of Education of China Changchun China Shenyang Institute of Automation CAS Northeast University No. 114 Nanta Street Shenhe District Shenyang China Shenyang Institute of Automation CAS No. 114 Nanta Street Shenhe District Shenyang China College of Computer Science and Technology Jilin University Changchun China Underwater Sensor Network Lab. University of Connecticut StorrsCT06269 United States

ISBN: (纸本)9781450346375

This paper presents a simulator for swarm operations designed to verify algorithms for a swarm of autonomous underwater robots (AUVs), specifically for constructing an underwater communication network with AUVs carrying acoustic communication devices. This simulator consists of three nodes: a virtual vehicle node (VV), a virtual environment node (VE), and a visual showing node (VS). The modular design treats AUV models as a combination of virtual equipment. An expert acoustic communication simulator is embedded in this simulator, to simulate scenarios with dynamic acoustic communication nodes. The several simulations we have performed demonstrate that this simulator is easy to use and can be further improved.

关键词： Simulators

来源：评论

学校读者我要写书评

暂无评论

Hyper-compact virtual estimators for big network data based on register sharing

Hyper-compact virtual estimators for big network data based ...

引用

ACM SIGMETRICS International Conference on Measurement and Modeling of computer Systems, SIGMETRICS 2015

作者： Xiao, Qingjun Chen, Shigang Chen, Min Ling, Yibei Department of Computer and Information Science and Engineering University of Florida GainesvilleFL United States Key Lab. of Computer Network and Information Integration Southeast University Ministry of Education China Telcordia Technologies and Applied Research Ericsson United States

ISBN: (纸本)9781450334860

Cardinality estimation over big network data consisting of numerous flows is a fundamental problem with many practical applications. Traditionally the research on this problem focused on using a small amount of memory to estimate each flow's cardinality from a large range (up to 109). However, although the memory needed for each flow has been greatly compressed, when there is an extremely large number of flows, the overall memory demand can still be very high, exceeding the availab.lity under some important scenarios, such as implementing online measurement modules in network processors using only on-chip cache memory. In this paper, instead of allocating a separated data structure (called estimator) for each flow, we take a different path by viewing all the flows together as a whole: Each flow is allocated with a virtual estimator, and these virtual estimators share a common memory space. We discover that sharing at the register (multi-bit) level is superior than sharing at the bit level. We propose a framework of virtual estimators that allows us to apply the idea of sharing to an array of cardinality estimation solutions, achieving far better memory efficiency than the best existing work. Our experiment shows that the new solution can work in a tight memory space of less than 1 bit per flow or even one tenth of a bit per flow-a quest that has never been realized before. © Copyright 2015 ACM.

关键词： Cache memory

来源：评论

学校读者我要写书评

暂无评论

Modeling parameter interactions in ranking SVM 15

Modeling parameter interactions in ranking SVM

引用

24th ACM International Conference on Information and Knowledge Management, CIKM 2015

作者： Zhang, Yaogong Xu, Jun Lan, Yanyan Guo, Jiafeng Xie, Maoqiang Huang, Yalou Cheng, Xueqi College of Computer and Control Engineering Nankai University China CAS Key Lab. of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China College of Software Nankai University China

ISBN: (纸本)9781450337946

Ranking SVM, which formalizes the problem of learning a ranking model as that of learning a binary SVM on preference pairs of documents, is a state-of-the-art ranking model in information retrieval. The dual form solution of Ranking SVM model can be written as a linear combination of the preference pairs, i.e., w = Σ(i,j)αij(xi - xj), where αij denotes the Lagrange parameters associated with each pair (i,j). It is obvious that there exist significant interactions over the document pairs because two preference pairs could share a same document as their items. Thus it is natural to ask if there also exist interactions over the model parameters αij, which we may leverage to propose better ranking model. This paper aims to answer the question. Firstly, we found that there exists a low-rank structure over the Ranking SVM model parameters αij, which indicates that the interactions do exist. Then, based on the discovery, we made a modification on the original Ranking SVM model by explicitly applying a low-rank constraint to the parameters. Specifically, each parameter αij is decomposed as a product of two low-dimensional vectors, i.e., αij = (υi,υj), where vectors vi and vj correspond to document i and j, respectively. The learning process, thus, becomes to optimize the modified dual form objective function with respect to the low-dimensional vectors. Experimental results on three LETOR datasets show that our method, referred to as Factorized Ranking SVM, can outperform state-of-the-art baselines including the conventional Ranking SVM. © 2015 ACM.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Fully secure predicate-based broadcast encryption

引用

Journal of Computational Information Systems 2014年第2期10卷 611-618页

作者： Sun, Jin Hu, Yupu Wang, Shangping Department of Application Mathematics in Xi'an University of Technology Xi'an 710054 China Key Lab. of Computer Network and Information Security Xidian University Xi'an 710071 China

According to the broadcast encryption scheme with wide applications in the real world, a fully secure predicate-based broadcast encryption was proposed by combining with Waters dual system encryption, predicate encryption and the orthogonality property of composite-order bilinear groups. Based on the standard model, the scheme can achieve constant-size key and ciphertext, and guarantee the security of the plaintext M as well as the security of the attribute vectors. The scheme is proved by using the three static assumptions. Furthermore, the analysis results indicated that the scheme of this paper is fully secure and can satisfy the higher efficiency and practice requirement. Copyright © 2014 Binary Information Press.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Specifying safety and liveness of semi-algebraic transition systems

引用

Journal of Computational Information Systems 2015年第2期11卷 457-465页

作者： Fu, Jun Wu, Jinzhao Tan, Hongyan Zhou, Ning School of Computer and Information Technology Beijing Jiaotong University Beijing China Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis Guangxi University for Nationalities Nanning China High Performance Network Lab. Institute of Acoustics Chinese Academy of Sciences Beijing China School of Electronic and Information Engineering Lanzhou Jiaotong University Lanzhou China

We present an approach to specification of properties of semi-algebraic transition systems which are introduced as mathematical structures for modeling complex physical systems. We extend dynamic logic to the semi-algebraic dynamic logic (SDL) which enlarges abstract modalities to polynomial expressions with inequalities and boolean connectives. In SDL, semi-algebraic transition systems are modeled as semi-algebraic programs. The semantics of SDL is constructed by interpreting the transition relation of semi-algebraic programs and the satisfaction of formulas with semi-algebraic sets. Hence, safety and liveness properties of semi-algebraic transition systems are well formulised as SDL formulas. Finally, our method of specifying complex systems is illustrated with three typical examples. 1553-9105/Copyright © 2015 Binary Information Press

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Directed test suite augmentation via exploiting program dependency 6

Directed test suite augmentation via exploiting program depe...

引用

6th International Workshop on Constraints in Software Testing, Verification, and Analysis, CSTVA 2014

作者： Wang, Haijun Guan, Xiaohong Zheng, Qinghua Liu, Ting Shen, Chao Yang, Zijiang MOE Key Lab. for Intelligent Networks and Network Security Xi'an Jiaotong University Xi'an China College of Computer and Technology Xi'an University of Technology Xi'an China Western Michigan University KalamazooMI United States

ISBN: (纸本)9781450328470

Regression testing is a practice to discover faults introduced in the program modification. However, the existing test suite is usually designed at an early stage of software development and is therefore insensitive to subsequent program changes. Although symbolic execution such as JPF-SE is able to produce test cases for the modified program by exhaustively exploring program paths, it is not tailored for testing program changes and is not scalab.e. In this paper, we propose an efficient approach called Directed Test Suite Augmentation (DTSA) to automatically generate test cases that can reach the changed statements, produce different program states after executing the changed statements, and propagate the different states to the output of the program. The key insight of DTSA is to reorder the generated test cases tailored for testing program changes compared with JPF-SE. We implemented a prototype of our approach and the experiment results show that DTSA requires about 60.1% and 45.6% fewer Dynamic Symbolic Execution (DSE) runs to generate the desired test case than JPF-SE and another test suite augmentation tool eXpress, respectively.

关键词： Software testing

来源：评论

学校读者我要写书评

暂无评论

Reducing test cases with causality partitions 26

Reducing test cases with causality partitions

引用

26th International Conference on Software Engineering and Knowledge Engineering, SEKE 2014

作者： Wang, Haijun Guan, Xiaohong Zheng, Qinghua Liu, Ting Li, Xiangyang Yu, Lechen Yang, Zijiang MOE Key Lab. for Intelligent Networks and Network Security Xi'an Jiaotong University Xi'an China College of Computer and Technology Xi'an University of Technology Xi'an China Western Michigan University KalamazooMI United States

Automatic test case generation using symbolic execution suffers from the problem of path explosion: the number of paths to be explored may grow exponentially with the scale of a program. We believe that different paths may exhibit some similar program behaviors, thus it is unnecessary to explore all of the paths to generate test cases. In this paper, a novel model of program causality is proposed to extract all kinds of influences among statements of a program, which consists of four types of program dependencies. Then, a heuristic approach based on program causality is developed to selectively explore program paths in symbolic execution. We have implemented a prototype of our approach within the symbolic execution engine of Java Pathfinder. Experiments on six public benchmarks show that our approach can significantly reduce the number of explored paths and the symbolic execution time so that to improve the performance of test case generation. Copyright © 2014 by Knowledge Systems Institute Graduate School.

关键词： Causality partition Symbolic execution Test case generation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：