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

Accountable authority key policy attribute-based encryption

Science China(Information Sciences) 2012年第7期55卷 1631-1638页

作者： WANG YongTao 1,2 ,CHEN KeFei 1,3 ,LONG Yu 1,4 & LIU ZhaoHui 2 1 Department of Computer Science and Engineering,shanghai Jiao Tong University,shanghai 200240,China 2 China Information Technology Security Evaluation Center,Beijing 100085,China 3 shanghai key laboratory of scalable computing and systems,shanghai Jiao Tong University,shanghai,200240,China 4 State key laboratory of Information Security,Graduate school of Chinese Academy of Sciences,100039,China 1. Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240 China2. China Information Technology Security Evaluation Center Beijing 100085 China3. Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai 200240 China4. State Key Laboratory of Information Security Graduate School of Chinese Academy of Sciences Beijing 100039 China

We present an accountable authority key policy attribute-based encryption (A-KPABE) *** this paper,we extend Goyal's work to key policy attribute-based encryption *** first generalize the notion of accountable authority in key policy attribute-based encryption scenario,and then give a *** addition,our scheme is shown to be secure in the standard model under the modified Bilinear Decisional Diffie-Hellman (mBDDH) assumption.

关键词： accountable authority key policy attribute-based encryption standard model access structure

来源：评论

学校读者我要写书评

暂无评论

On the Security of Double-Block-Length Hash Functions with Rate 1

引用

电子学报(英文版) 2012年第3期21卷 566-570页

作者： GONG Zheng LUO Yiyuan LAI Xuejia CHEN Kefei School of Computer Science South China Normal University Guangzhou 510631 China Department of Computer Science Shanghai Jiaotong University Shanghai 200240 China Shanghai Key Laboratory of Scalable Computing and Systems Shanghai China

The security of double-block-length hash functions with rate 1, which are based on a block cipher with a block length of n bits and a key length of 2n bits, was analyzed by Satoh et al. and Hirose. In this paper, we re- consider the security of this general class of hash functions (named FDBL-II for brevity). The new counter-examples and attacks are presented on FDBL-II, which reveal some flaws in the necessary conditions proposed by Satoh et al. and Hirose. Moreover, our analysis shows that all rate-1 hash functions in FDBL-II fail to be optimally (second) preimage resistant. Finally, the necessary conditions are revised for ensuring that a subclass of hash functions in FDBL-II can be optimally secure against collision attacks.

关键词：安全性分析密钥长度 Hash函数安全散列函数汇率碰撞攻击块密码比特

来源：评论

学校读者我要写书评

暂无评论

High Availability through Output Continuity

High Availability through Output Continuity

引用

IEEE International Conference on Cluster computing Workshops and Posters (CLUSTER WORKSHOPS)

作者： Wei Ye Yaozu Dong Ruhui Ma Alei Liang Haibing Guan Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiaotong University Shanghai China Intel China Software Center Shanghai China

Virtual machine (VM) based state machine approaches, i.e. VM replication, provide high availability without source code modifications, unfortunately, existing VM replication approaches suffer from excessive replication overheads. On the other hand, machine state replication is an overly strong (and therefore less efficient) requirement for high availability in the networked client-server system. In this paper, we propose a generic and highly efficient high availability solution through output continuity. Output continuity considers a backup server as a valid replica as long as the responses generated so far are the same between the backup and primary servers, the server state is propagated from the primary server to the backup server if and only if the previous outputs from the backup and primary servers are different.

关键词： Servers Availability Mathematical model Semantics Equations Hardware

来源：评论

学校读者我要写书评

暂无评论

The sharing at roadside: Vehicular content distribution using parked vehicles

The sharing at roadside: Vehicular content distribution usin...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Nianbo Liu Ming Liu Guihai Chen Jiannong Cao School of Computer Science and Engineering University of Electronic Science and Technology Chengdu China Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai China Department of Computing Hong Kong Polytechnic University Hong Kong China

ISBN: (纸本)9781467307734;9781467307758

In Vehicular Ad Hoc Networks (VANETs), content distribution directly relies on the fleeting and dynamic contacts between moving vehicles, which often leads to prolonged downloading delay and terrible user experience. Deploying Wifi-based Access Points (APs) could relieve this problem, but it often requires a large amount of investment, especially at the city scale. In this paper, we propose the idea of ParkCast, which doesn't need investment, but leverages roadside parking to distribute contents in urban VANETs. With wireless device and rechargable battery, parked vehicles can communicate with any vehicles driving through them. Owing to the extensive parking in cities, available resources and contact opportunities for sharing are largely increased. To each road, parked vehicles at roadside are grouped into a line cluster as far as possible, which is locally coordinated for node selection and data transmission. Such a collaborative design paradigm exploits the sequential contacts between moving vehicles and parked ones, implements sequential file transfer, reduces unnecessary messages and collisions, and then expedites content distribution greatly. We investigate ParkCast through theoretic analysis and realistic survey and simulation. The results prove that our scheme achieve high performance in distribution of contents with different sizes, especially in sparse traffic conditions.

关键词： Vehicles Magnetic heads Roads Delay Network coding Collaboration Cities and towns

来源：评论

学校读者我要写书评

暂无评论

A PSO-inspired multi-robot search algorithm independent of global information

A PSO-inspired multi-robot search algorithm independent of g...

引用

IEEE Symposium on Swarm Intelligence

作者： Zhu, Qian Liang, Alei Guan, Haibing School of Software Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai China Department of Computer Science Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai China

ISBN: (纸本)9781612840529

This paper presents an algorithm that coordinates mobile robots to find the desired targets without depending on precise global information. We compare the abstract solution space in PSO and physical environment that robots will explore. According to similarities and differences between them, we introduce a PSO-inspired search algorithm to guide robots to complete the search mission. Moreover, a novel method based on Cartesian geometry for unifying relative coordinate systems will be adopted to improve system's robustness and efficiency. © 2011 IEEE.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

An improved content-based data dissemination in human contact-based network

An improved content-based data dissemination in human contac...

引用

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

作者： Jiang, Chao Peng, Tao Liang, Alei Guan, Haibing School of Software Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai China Department of Computer Science Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai China

ISBN: (纸本)9780769546100

Limited wireless communication devices carried by individuals make up human contact-based network. Such network often suffers from intermittent connectivity. This fact decreases successful ratio of information spreading and prolongs data delivery process. To get good performance on delivery ratio and transmission delay, providing effective data dissemination algorithm among large-scale human contact-based network is very important. In this paper, we develop an Improved Content-based Data Dissemination algorithm, which efficiently resolves data dissemination as data sources and interested receivers are agnostic of each other. In our algorithm, nodes exchange information according to respective interests with each other, simultaneously, exploit gathered history neighbor interests to dynamically adjust the probability of requesting messages not of interest to themselves and make distributed decisions on whether storing messages or not to benefit other nodes. Compared with the Epidemic algorithm and Opportunistic Content-Based Dissemination algorithm, simulation results have confirmed that our algorithm obtains the highest delivery ratio and almost the lowest transmission delay, as the buffer size and bandwidth are restricted. © 2011 IEEE.

关键词： content-based data dissemination distributed end-to-end path

来源：评论

学校读者我要写书评

暂无评论

An algorithm for self-organized aggregation of swarm robotics using timer

An algorithm for self-organized aggregation of swarm robotic...

引用

IEEE Symposium on Swarm Intelligence

作者： Yan, Xinan Liang, Alei Guan, Haibing School of Software Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai China Department of Computer Science Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai China

ISBN: (纸本)9781612840529

Aggregation is a basic collective behavior in biology, and is a prerequisite for many applications of swarm robotics. This paper proposes a new distributed algorithm for aggregation of swarm robotics under the constraints of no central control, no information about positions, and only local interaction among robots. Our control strategy contains two states, Search and Wait, for individual robot, as in the model of probabilistic finite state automata (PFSA). The main difference from PFSA is the way of how individual robot decides to leave from an aggregate. In our approach, each robot in an aggregate has a timer as its lifetime in the aggregate instead of having a leaving probability in PFSA. Further, to make all robots aggregate together, the key idea of our algorithm is that robots in small aggregate have shorter lifetime than those in large aggregate. The lifetime of individual robot in an aggregate is approximated as the lifetime of the aggregate, by making all the timers of the robots in the same aggregate have the same time settings, where the time is proportional to aggregate size and is updated only with the increase of aggregate size. By choosing linear function as the time setting of the timer, experiments based on simulator have been done. The results show that our algorithm is successful and scalable for large scale of robots, and indicate that the performance of the aggregation of all robots is improved by decreasing the lifetime of uncompleted aggregate in high robot density or increasing it in low robot density. © 2011 IEEE.

关键词： Swarm intelligence

来源：评论

学校读者我要写书评

暂无评论

Combining static and dynamic analysis to discover software vulnerabilities

Combining static and dynamic analysis to discover software v...

引用

2011 5th International Conference on Innovative Mobile and Internet Services in Ubiquitous computing, IMIS 2011

作者： Zhang, Ruoyu Huang, Shiqiu Qi, Zhengwei Guan, Haibin School of Software Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University China School of Electronic Information and Electrical Engineering Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University China

ISBN: (纸本)9780769543727

Dynamic taint analysis has been proved to be very effective in solving security problems recently, especially in software vulnerability detection and malicious behavior prevention. Unfortunately, most of current researches in this field focus on the runtime protection, and are incapable to discover the potential threat in the software. This paper describes a novel approach to overcome the limitation of traditional dynamic taint analysis by integrating static analysis into the system and presents framework SDCF. The framework translates the binary into assembly code and tracks the data flow. Then with static method, the system can get the important information which can't be gained at runtime, such as unexecuted part of the code. When this information is acquired, they will be provided to the client tools. The practicability of the framework is validated by implementing and evaluating a tool built on SDCF. The result of the experiments shows that our system is able to detect latent software vulnerabilities efficiently. © 2011 IEEE.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

Performance of a multi-channel MAC protocol implemented in multi-robot system

Performance of a multi-channel MAC protocol implemented in m...

引用

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

作者： Zhang, Feng Liang, Alei Guan, Haibing School of Software Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai China Department of Computer Science Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai China

ISBN: (纸本)9780769546100

In the wireless network, the throughput decreases rapidly with increasing the number of nodes while using single-channel communication simultaneously. Using multi-channel schemes is a solution of boosting throughput. In this paper, we present a protocol implementation, utilizing multiple channels in an autonomous multi-robot system which consists of several simple physical robots, in order to improve throughput. Each robot equipped with a single 802.15.4 radio transceiver which provides 16 channels for use. Our schemes employ a common control-channel and data channels. A simple approach based on RTS / CTS message at control-channel is used to dynamically allocate channels for robots in such distributed network. Some practical experiments were done to check whether control channel congestion can occur when the proposed protocols implemented in our robot systems. As a result, the proposed multi-channel protocol can provide a relatively stable and higher throughput than that obtained by using the CSMA with a single-channel, with increasing the number of simultaneous sending robots. © 2011 IEEE.

关键词： Multipurpose robots

来源：评论

学校读者我要写书评

暂无评论

DsVD: An effective low-overhead dynamic software vulnerability discoverer

DsVD: An effective low-overhead dynamic software vulnerabili...

引用

International Workshop on Assurance in Distributed systems and Networks

作者： Wang, Zhuo Tang, Zhushou Zhou, Kan Zhang, Ruoyu Qi, Zhengwei Guan, Haibin School of Software Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai China School of Electronic Information and Electrical Engineering Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai China

ISBN: (纸本)9780769543499

Dynamic taint analysis based software vulnerability and malware detection is an effective method to detect a wide range of vulnerabilities. Unfortunately, existing systems suffer from requirement of source code, high overhead or shortage of discovery rules, which limit their usage. This paper proposes a low-overhead vulnerability discovery system called DsVD (Dynamic software Vulnerabilities Discoverer). DsVD works on X86 executables and does not need any hardware change. A new taint state called controlled-taint is introduced to detect more types of vulnerabilities. Our experiments show that DsVD can effectively detect various software vulnerabilities. DsVD incurs very low overhead, only 3.1 times on average for SPECINT2006 benchmarks. With some optimizations such as Irrelevant API Filter and Basic Block Handling, it can reduce runtime overhead by a factor of 4-11 times.

关键词： Dynamic Taint Analysis software Security Vulnerability Discovery software safety computer software computer programs Taints Vulnerability Computer hardware

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：