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

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

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to “A variable-length model for masquerade detection” [J. Syst. Softw. 85 (2012) 2470–2478]

引用

Journal of Systems and Software 2013年第3期86卷 868-868页

作者： Xi Xiao Xinguang Tian Qibin Zhai Shutao Xia Graduate School at Shenzhen Tsinghua University 518055 Shenzhen China State Key Laboratory of Information Security Graduate University of Chinese Academy of Sciences 100049 Beijing China Key Laboratory of Network Science and Technology Institute of Computing Technology Chinese Academy of Sciences 100190 Beijing China

来源：评论

学校读者我要写书评

暂无评论

A secure message delivery scheme with path tracking for delay tolerant networks

A secure message delivery scheme with path tracking for dela...

引用

2012 1st IEEE International Conference on Communications in China, ICCC 2012

作者： Jia, Zhongtian Raffay, Muhammad Ali Li, Lixiang Lin, Xiaodong Yang, Yixian 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 Faculty of Business and Information Technology University of Ontario Institute of Technology Oshawa ON L1H 7K4 Canada

ISBN: (纸本)9781467328159

In delay tolerant networks (DTNs), message delivery is operated in an opportunistic way through store-carry and forward relaying, and every DTN node is in anticipation of cooperation for data forwarding from others. Unfortunately, there always exist some selfish nodes that are reluctant to contribute to this cooperative data forwarding procedure so as to save their valuable storage buffer, limited computation power and precious energy. In order to stimulate nodes' willingness to participate in data forwarding, a number of incentive schemes have been proposed recently. However, most existing incentive schemes simply ignore efforts of nodes involved in message delivery if messages delivered fail to reach their destinations. Due to the nature of DTN, such as intermittent connectivity, it is not unusual to have unreliable message delivery, which results in unrewarded or wasted efforts for participating nodes and may discourage them from participating in future data forwarding. Therefore, it is crucial to recognize contribution of every node involved in a data forwarding procedure even the message it helps to forward doesn't successfully reach its destination. However, how to track all delivery paths so as to give every intermediate node some incentive for their cooperative efforts of data forwarding is still an open research problem. To address this problem, we propose a secure message forwarding scheme with path tracking. The proposed method is end-to-end secure with data source and identity authentication. In addition, it can thwart some well known attacks including edge inserting attack, sibling inserting attack and free riding attack. © 2012 IEEE.

关键词： Delay tolerant networks

来源：评论

学校读者我要写书评

暂无评论

A secure message delivery scheme with path tracking for delay tolerant networks

A secure message delivery scheme with path tracking for dela...

引用

IEEE International Conference on Communications in China (ICCC)

作者： Zhongtian Jia Muhammad Ali Raffay Lixiang Li Xiaodong Lin Yixian Yang Information Security Center Beijing University of Posts and Telecommunications China Shandong Provincial Key Laboratory of Network based Intelligent Computing University of Jinan Jinan China Faculty of Business and Information Technology Institute of Technology University of Ontario Oshawa ONT Canada

关键词： Nickel Public key Protocols Relays Joining processes

来源：评论

学校读者我要写书评

暂无评论

Analysis on Token-Controlled Public Key Encryption

Analysis on Token-Controlled Public Key Encryption

引用

International Conference on Mobile Ad-hoc and Sensor networks, MSN

作者： Changlu Lin Yong Li Sriramkrishnan Srinivasan Li Lu Key Laboratory of Network Security and Cryptology Fujian Normal University Fuzhou China Key Laboratory of Communication & Information Systems Beijing Municipal Commission of Education Beijing Jiaotong University Beijing China Department of Computing University of Surrey Guildford UK School of Computer Science University of Electronic Science and Technology Chengdu China

ISBN: (纸本)9781467358088

In this paper, we analyze on the use of token-controlled public key encryption (TCE)schemes. We argue that for many of the applications in some possibilities of application in financial or legal scenarios, for example, the millionaire's will problem, the `private-opening' commitment, the scheduled payment problem, and the sealed-bid auctions and electronic lotteries problem, in the literature, the use of token-controlled public key encryption on its own, leads to inadequate solutions. We suggest that when considering applications of TCE, it is advisable to pay close attention to the lack of authentication and incorporate defences against the problems highlighted in this paper.

关键词： Public key encryption Token-controlled public key encryption Authentication security and privacy Public key encryption Authentication Trichloroethylene

来源：评论

学校读者我要写书评

暂无评论

Anomaly detection of user behavior based on DTMC with states of variable-length sequences

引用

The Journal of China Universities of Posts and Telecommunications 2011年第6期18卷 106-115页

作者： XIAO Xi XIA Shu-tao TIAN Xin-guang ZHAI Qi-bin Graduate School at Shenzhen Tsinghua University Shenzhen 518055 China State Key Laboratory of Information Security Graduate University of Chinese Academy of Sciences Beijing 100049 China Key Laboratory of Network Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

In anomaly detection, a challenge is how to model a user＇s dynamic behavior. Many previous works represent the user behavior based on fixed-length models. To overcome their shortcoming, we propose a novel method based on discrete-time Markov chains （DTMC） with states of variable-length sequences. The method firstly generates multiple shell command streams of different lengths and combines them into the library of general sequences. Then the states are defined according to variable-length behavioral patterns of a valid user, which improves the precision and adaptability of user profiling. Subsequently the transition probability matrix is created. In order to reduce computational complexity, the classification values are determined only by the transition probabilities, then smoothed with sliding windows, and finally used to discriminate between normal and abnormal behavior. Two empirical evaluations on datasets from Purdue University and AT＆T Shannon Lab show that the proposed method can achieve higher detection accuracy and require less memory than the other traditional methods.

关键词： intrusion detection anomaly detection shell command discrete-time Markov chain （DTMC）

来源：评论

学校读者我要写书评

暂无评论

An architecture description language based on dynamic description logics for self-healing systems

引用

International Journal of Advancements in computing technology 2012年第18期4卷 89-96页

作者： Wang, Zhuxiao Peng, Hui Guo, Jing Wu, Kehe Cui, Wenchao Wang, Xiaofeng School of Control and Computer Engineering State Key Laboratory of Alternate Electrical Power System with Renewable Energy Sources North China Electric Power University Beijing 102206 China Education Technology Center Beijing International Studies University Beijing 100024 China National Computer Network Emergency Response Technical Team/Coordination Center of China Beijing 100029 China School of Control and Computer Engineering Institute of Electric Information Security Engineering Research Center of Power Information North China Electric Power University Beijing 102206 China Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

As biological systems exhibit adaptation, healing and robustness in the face of changing environmental behavior, this paradigm has actuated research dealing with the concept of self-healing systems, which attempt to heal themselves in the sense of recovering from malicious attacks and rectifying of system faults. The goal of self-healing systems is to provide survivable systems that require high dependability, robustness, adaptability, and availability. Such systems maintain one or more models, whether external or internal, at run time as a basis for identifying problems and resolving them. This article describes an architectural description language, called ADML, which is being developed as a new formal language and/or conceptual model for representing evolving software architectures. The ADML embraces dynamic change as a fundamental consideration, supports a broad class of adaptive changes at the architectural level, and offers a uniform way to represent and reason about both static and dynamic aspects of self-healing systems. Because the ADML is based on the Dynamic Description Logic DDL(SHON (D)), which can represent both dynamic semantics and static semantics under a unified logical framework, architectural ontology entailment for the ADML languages can be reduced to knowledge base satisfiability in DDL(SHON (D)), and dynamic description logic algorithms and implementations can be used to provide reasoning services for ADML. In this article, we present the syntax of ADML, explain its underlying semantics using the Dynamic Description Logic DDL(SHON (D)), and exemplify our approach by applying it to the domain of load balancing a wireless remote-access system;the preliminary results certify the potential of the approach.

关键词： Formal languages

来源：评论

学校读者我要写书评

暂无评论

Attribute-Based Signature with Policy-and-Endorsement Mechanism

引用

Journal of Computer Science & technology 2010年第6期25卷 1293-1304页

作者：王怀习朱岩冯荣权 Stephen S.Yau LMAM School of Mathematical SciencesPeking University Electronic Engineering Institute Institute of Computer Science and Technology Peking University Key Laboratory of Network and Software Security Assurance (Peking University) Ministry of Education Information Assurance Center and School of Computing Informatics and Decision Systems Engineering Arizona State University

In this paper a new signature scheme,called Policy-Endorsing Attribute-Based Signature,is developed to correspond with the existing Ciphertext-Policy Attribute-Based *** signature provides a policy-and-endorsement *** this mechanism a single user,whose attributes satisfy the predicate,endorses the *** signature allows the signer to announce his endorsement using an access policy without having to reveal the identity of the *** security of this signature,selfless anonymity and existential unforgeability,is based on the Strong Diffie-Hellman assumption and the Decision Linear assumption in bilinear map groups.

关键词： cryptography fine-grained access control attribute-based signature policy-and-endorsement selfless anonymity existential unforgeability

来源：评论

学校读者我要写书评

暂无评论

Information system security function validating using model checking

Information system security function validating using model ...

引用

2010 2nd International Conference on Computer Engineering and technology, ICCET 2010

作者： Ma, Jianli Xu, Guoai Yang, Yixian Ji, Yong Information Security Center State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China Key Laboratory of Network and Information Attack Defense Technology of MOE Beijing University of Posts and Telecommunications Beijing China China Electronics System Engineering Computing station Beijing China

ISBN: (纸本)9781424463503

Information systems will be encountered more and more security threats due to the development of computer attack method and technology. Generally, different security policies are used to protect the sensitive information in these systems. There has been a lot of study on security policy conformance and completeness verification and validation. However, there have few researches to validate whether the system behaviors satisfy the security policies. A model checking based information system security function validation method is proposed to validate the conformance between the system security solutions and the security policies in this paper. The system behaviors and the security policies are modeled separately, and the consistency between them is validated using the model checker SPIN. © 2010 IEEE.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：