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

Accountable authority identity-based encryption with public traceability 1

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

作者： Lai, Junzuo Deng, Robert H. Zhao, Yunlei Weng, Jian School of Information Systems Singapore Management University Singapore Singapore Software School Fudan University China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences China Department of Computer Science Emergency Technology Research Center of Risk Evaluation and Prewarning on Public Network Security Jinan University China Shanghai Key Laboratory of Integrate Administration Technologies for Information Security China

ISBN: (数字)9783642360954

ISBN: (纸本)9783642360947

At Crypto'07, Goyal introduced the notion of accountable authority identity-based encryption (A-IBE) in order to mitigate the inherent key escrow problem in identity-based encryption, and proposed two concrete constructions. In an A-IBE system, if the private key generator (PKG) distributes a decryption key or produces an unauthorized decryption box for a user maliciously, it runs the risk of being caught and sued in the court of law with the help of a tracing algorithm. Subsequent efforts focused on constructions of A-IBE schemes with enhanced security. In these A-IBE constructions, the tracing algorithm needs to take a user's decryption key as input. If the user lost his key or is deliberately uncooperative in court, then we cannot implicate the PKG or the user. An interesting open problem left by Goyal et al. at CCS'08 is to consider the possibility of tracing a decryption box using only a public tracing key, or with the assistance of a tracing authority. In this paper, we address this problem positively. We first extend the original model of A-IBE to accommodate public traceability, and then propose an A-IBE scheme in the new model. To the best of our knowledge, the proposed scheme is the first A-IBE with public traceability. © 2013 Springer-Verlag.

关键词： Accountable Authority Identity Based Encryption Public Traceability

来源：评论

学校读者我要写书评

暂无评论

On the spatial-Temporal Reachability of DTNs

On the spatial-Temporal Reachability of DTNs

引用

2nd CCF Internet Conference of China, ICoC 2013

作者： Zhang, Cheng Xia, Chunhe Wang, Haiquan Li, Xiaojian Beijing Key Laboratory of Network Technology Beihang University Beijing China State Key Laboratory of Virtual Reality Technology and Systems Beihang University Beijing China College of Software Beihang University Beijing China College of Computer Science and Information Technology Guangxi Normal University Guilin China

ISBN: (纸本)9783642539589

As traditional "Connectivity" concept from the Internet ignores the possibility of opportunistic contacts in DTNs, this paper brings time dimension into consideration, proposes Spatial-Temporal Path, Spatial-Temporal Reachability and K-Reachability in order to better describe the whole communication process and "Eventual Transportability" of DTN. Analytical and simulation results are given to show the correctness of our approach. Furthermore, Spatial-Temporal Reachability and K-Reachability, which tell a network's robustness in a quantitative fashion, are proved to be suitable for analyzing efficiency and routing performance of DTNs. © Springer-Verlag Berlin Heidelberg 2013.

关键词： Connectivity DTN Spatial-Temporal Reachability

来源：评论

学校读者我要写书评

暂无评论

A computer network defense policy refinement method

A computer network defense policy refinement method

引用

2nd CCF Internet Conference of China, ICoC 2013

作者： Wei, Zhao Lv, Yanli Xia, Chunhe Luo, Yang Wei, Qing Key Laboratory of Beijing Network Technology School of Computer Science and Engineering Beihang University Beijing China Information Center of Ministry of Science and Technology The Ministry of Science Technology of the People's Republic of China Beijing China

ISBN: (纸本)9783642539589

The existing methods of policy refinement in computer network defense (CND) can only support the refinement of access control policy, but not the policies of protection, detection, response, and recovery. To solve this problem, we constructed a computer network defense policy refinement model and its formalism specification. An algorithm of defense policy refinement is designed. At last, the effectiveness of our methods was verified through one experiment cases of the composition policies with intrusion detection, vulnerabilities detection, and access control. © Springer-Verlag Berlin Heidelberg 2013.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

ENERGY EFFICIENT DISTRIBUTED STEGANOGRAPHY FOR SECURE COMMUNICATION IN WIRELESS MULTIMEDIA SENSOR networkS

引用

Journal of Electronics(China) 2013年第1期30卷 9-16页

作者： Lin Qiaomin Wang Ruchuan Ye Ning Wang Zhongqin College of Computer Nanjing University of Posts and Telecommunications Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Key Lab of Broadband Wireless Communication and Sensor Network Technology (Nanjing University of Posts and Telecommunications) Ministry of Education Department of Information Science Nanjing College for Population Management

A secure communication mechanism is necessary in the applications of Wireless Multimedia Sensor networks (WMSNs), which is more vulnerable to security attacks due to the presence of multimedia data. Additionally, given the limited technological resources (in term of energy, computation, bandwidth, and storage) of sensor nodes, security and privacy policies have to be combined with energy-aware algorithms and distributed processing of multimedia contents in WMSNs. To solve these problems in this paper, an energy efficient distributed steganography scheme, which combines steganography technique with the concept of distributed computing, is proposed for secure communication in WMSNs. The simulation results show that the proposed method can achieve considerable energy efficiency while assuring the communication security simultaneously.

关键词： Discrete Wavelet Transform （DWT） Distributed steganography Energy efficiency Perfect hash Wireless Multimedia Sensor networks （WMSNs）

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of optimal relay selective cooperation in railway network

Performance analysis of optimal relay selective cooperation ...

引用

5th IET International Conference on Wireless, Mobile and Multimedia networks, ICWMMN 2013

作者： You, Jia Zhong, Zhangdui Yang, Shan Liu, Yang Wang, Gongpu State Key Laboratory of Rail Traffic Control and Safety Beijing Jiaotong University Beijing China School of Computer and Information Technology Beijing Jiaotong University Beijing China Network Technology Research Institute China United Network Communications Co. Ltd. China

ISBN: (纸本)9781849197267

In the railway network, the fact that signal amplitude suffers loss resulted from signal traversing through the carriage which named by carriage pass loss, highly influences the reliability of the wireless communication system. In this paper, we propose an optimal relay selective cooperation (ORSC) scheme without the acknowledgment from the destination as if it succeeds in decoding or not. The main purpose of this paper is to evaluate the performance of ORSC transmission schemes. Specifically, the closed-form outage probabilities for ORSC transmission scheme are derived. By comparing obtained outage probability of ORSC with the non-cooperation transmission scheme, we find the ORSC transmission has better performance, better reliability and significantly eliminates the impact of the carriage passing loss.

关键词： Reliability analysis

来源：评论

学校读者我要写书评

暂无评论

Frequent itemset mining over stream data: Overview

Frequent itemset mining over stream data: Overview

引用

IET International Conference on information and Communications Technologies, IETICT 2013

作者： Qu, Z.G. Niu, X.X. Deng, J. McArdle, C. Wang, X.J. Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology Nanjing 210044 China School of Computer and Software Nanjing University of Information Science and Technology Nanjing 210044 China School of Electronic Engineering Dublin City University Dublin Ireland Key Laboratory of Network and Information Attack and Defence Technology of MOE Beijing University of Posts and Telecommunications Beijing 100876 China

ISBN: (纸本)9781849196536

During the past decade, stream data mining has been attracting widespread attentions of the experts and the researchers all over the world and a large number of interesting research results have been achieved. Among them, frequent itemset mining is one of main research branches of stream data mining with a fundamental and significant position. In order to further advance and develop the research of frequent itemset mining, this paper summarizes its main challenges and corresponding algorithm features. Based on them, current related results are divided into two categories: data-based algorithms and task-based algorithms. According to its taxonomy, the related methods belonging to the different categories and sub-categories are comprehensively introduced for better understanding. Finally, a brief conclusion is given.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Dynamic bandwidth allocation&guarantee for virtualized networks in cloud

Dynamic bandwidth allocation&guarantee for virtualized netwo...

引用

9th International Conference on information, Communications and Signal Processing, ICICS 2013

作者： Luo, Xuan Zhang, Pengfei Ye, Tong Jin, Yaohui Wang, Jianping Network and Information Center Shanghai Jiaotong University China State Key Laboratory of Advanced Optical Communication Systems and Networks Shanghai Jiaotong University China Department of Computer Science City University of Hong Kong Hong Kong

ISBN: (纸本)9781479904341

Among all SLAs(Service Level Agreements) about network resources in the cloud, a critical problem would be achieving bandwidth guarantee under all communication environment (e.g., when misbehaved VMs exist) while keeping acceptable bandwidth utility and system scalability. In this paper, we present an architecture of dynamic bandwidth allocation and guarantee on resource fairness, to provide network performance isolation and protocol independent bandwidth guarantees. In this paper, we first discuss the business model of bandwidth guarantee for Infrastructure-as-a-Service (IaaS) cloud, and a bandwidth allocation algorithm based on redefined fairness model is proposed and realized under the novel architecture, and finally experiment shows satisfying results under various communication scenarios. © 2013 IEEE.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

A color digital watermarking in nonsampled contourlet domain using generic algorithm

A color digital watermarking in nonsampled contourlet domain...

引用

5th IEEE International Conference on Intelligent networking and Collaborative Systems, INCoS 2013

作者： Luo, Peng Wei, Ping Liu, Yi-Qun Key Laboratory of Network and Information Security of APF Department of Electronic Technology Engineering University of APF Xi'an 710086 China Laboratory-Center of Computer Department of Information Engineering Engineering University of APF China Xi'an 710086 China Department of Electronic Technology Engineering University of Armed Police Force Xi'an 710086 China

ISBN: (纸本)9780769549880

A novel watermarking approach for copyright protection of color images based on the nonsubsampled contour let transform (NSCT). We employ the genetic algorithm optimization principles and HVS masking technique to obtain high robustness and transparency with respect to the existing algorithms. In our scheme, the embedding factor is controlled locally according to the result of Generic Algorithm (GA) cycle. The simulation results show that the proposed algorithm yields a watermark which is invisible to human eyes and robust to a wide variety of common attacks. © 2013 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

A Centrality Estimation Method Based on Hidden Markov Model in Social Delay Tolerant networks

A Centrality Estimation Method Based on Hidden Markov Model ...

引用

2013 22nd Wireless and Optical Communication Conference

作者： Yongfeng Huang Yongqiang Dong Sanfeng Zhang Guoxin Wu School of Computer Science and Engineering Southeast University Key Laboratory of Computer Network and Information Integration(Southeast University) Ministry of Education

ISBN: (纸本)9781467356985

Complex network analysis method has recently been proposed to solve the problem of contact prediction in Delay Tolerant networks(DTNs).Centrality Estimation remains as an important issue in such *** schemes such as single window and cumulative window centrality estimation,however,can not predict the node contact capability accurately due to the fact that the messages always have a specific lifetime associated with *** this paper we proposes a new centrality estimation method based on simplified Hidden Markov Model(HMM) to address this *** historical and current centrality information is used to compute the comparative centrality of two encountering nodes before the expiration of a *** results based on real traces show that our approach outperforms the existing schemes in terms of estimation accuracy,leading to significant improvement on delivery efficiency.

关键词： Centrality,Hidden Markov Model,Delay Tolerant networks,Routing,Complex network analysis

来源：评论

学校读者我要写书评

暂无评论

An extension of distributed dynamic description logics for the representation of heterogeneous mappings

Journal of Software

引用

Journal of Software 2013年第1期8卷 243-250页

作者： Wang, Zhuxiao Guo, Jing Chen, Fei Wu, Kehe Wang, Peng School of Control and Computer Engineering State Key Laboratory of Alternate Electrical Power System with Renewable Energy Sources North China Electric Power University 102206 Beijing China National Computer Network Emergency Response Technical Team Coordination Center of China 100029 Beijing China School of Control and Computer Engineering North China Electric Power University 102206 Beijing China Institute of Information Engineering Chinese Academy of Sciences 100195 Beijing China

As a family of dynamic description logics, DDL(X) is constructed by embracing actions into the description logic X, where X represents well-studied description logics ranging from the ALC to the SHOIQ. To efficiently support automated interoperability between ontology-based information systems in distributed environments, we have to design an expressive mapping language to semantically understand resources from remote and heterogeneous systems. Distributed Dynamic Description Logics D3L(X) is a natural generalization of the DDL(X) framework, which is designed to model the distributed dynamically-changing knowledge repositories interconnected by semantic mappings and to accomplish reasoning in distributed, heterogeneous environments. In this paper, we propose an extension of Distributed Dynamic Description Logics D3L(X) and investigate the reasoning mechanisms in D3L(X). © 2013 ACADEMY PUBLISHER.

关键词： Interoperability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：