检索结果-南通市图书馆

Identifying heavy hitters in high-speed network monitoring

Science China(information {1.) 2010年第3期53卷 659-676页

作者： ZHANG Yu1, FANG BinXing1,2 & ZHANG YongZheng2 1research {1. of Computer Network and information security technology, Harbin institute of technology, Harbin 150001, China 2research center of information security, institute of computing technology, chinese academy of sciences,{1.}, China 1. research {1. of Computer Network and information security technology Harbin Institute of Technology Harbin 150001 China2. Research Center of Information Security Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

Identifying heavy hitters in a network traffic stream is important for a variety of network applications ranging from traffic engineering to anomaly detection such as detection of denial-of-service attacks. Existing methods generally examine newly arriving items in the stream, perform a small number of operations using a small amount of memory, and still provide guarantees on the identifying accuracy. In high-speed network monitoring, the update speed per item is extremely critical. However, so far as we know, there are no identifying algorithms which can provide constant update time (O(1.) in a weighted data stream. In this paper, we present an algorithm named Weighted Lossy Counting (WLC) which is able to identify heavy hitters in a high-speed weighted data stream with constant update time. WLC employs a novel efficient partially ordered data structure which is able to provide a fast per-item update speed while keeping the memory cost relatively low. We compare WLC with state-of-the-art algorithms for finding heavy hitters in real traffic traces. The experimental results show that WLC performs well in accuracy (recall, precision and average relative error) as other algorithms; moreover it has a much higher update speed at the cost of relatively larger memory space used. A theoretical worst-case memory bound of WLC is also derived in this paper; however, experiments with long real traffic traces show that WLC requires much less space than the theoretical bound in practice.

关键词： network traffic monitoring heavy hitter weighted data streams

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Mechanism and Defense on Malicious Code

引用

Wuhan University Journal of Natural sciences 2005年第1期10卷 83-88页

作者： WEN Wei-ping 1.2,3, QING Si-han 1.2,31. institute of Software, the{1., beijing 1.0080, China 2.Engineering research center for information security technology, the{1., beijing 1.0080, China 3.Graduate School of the{1., beijing 1.0080, China institute of Software the Chinese Academy of Sciences Beijing 100080 China

With the explosive growth of network applications, the threat of the malicious code against network security becomes increasingly serious. In this paper we explore the mechanism of the malicious code by giving an attack model of the malicious code, and discuss the critical techniques of implementation and prevention against the malicious code. The remaining problems and emerging trends in this area are also addressed in the paper.

关键词： malicious code attacking model mechanism defense system security network security

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Formal analysis and design of multi-party fair exchange protocols

引用

Science in China(Series F) 2006年第2期49卷 155-174页

作者： QING Sihan1.2,3 & LI Gaicheng1.3 1. Engineering research {1. for information security technology, institute of Software, chinese academy of sciences, beijing 1.0080, China 2. beijing Zhongke Ansheng Corporation of information technology, beijing 1.0080, China 3. Graduate School of the chinese academy of sciences, beijing 1.0039, China 1. Engineering research {1. for information security technology Institute of Software Chinese Academy of Sciences Beijing 100080 China 2. beijing Zhongke Ansheng Corporation of {1. technology Beijing 100080 China 3. Graduate School of the chinese academy of sciences Beijing 100039 China

Based on the origin of message items and channel combination between transacting parties, and events and relations among events, this paper presents a concise, precise, and hierarchical model for general fair exchange protocols, formally specifies various security requirements which are able to reflect inherent requirements for fair exchange protocols more rigorously, and partition these security requirements with fine granularity. This work helps analyze, debug, and design multi-party fair exchange protocols more effectively and elaborately,

关键词： fair exchange logical protocol formal model security requirement.

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A formal model of fair exchange protocols

引用

Science in China(Series F) 2005年第4期48卷 499-512页

作者： QING Sihan1,2,3 & LI Gaicheng1,2,3 1. Engineering research {1. for information security technology, institute of Software, chinese Aca- demy of sciences, beijing 100080, China 2. beijing Zhongke Ansheng Corporation of information technology, beijing 100080, China 3. Graduate School of the{1.}, beijing 100039, China 1. Engineering research {1. for information security technology Institute of Software Chinese Academy of Sciences 100080 Beijing China 2. beijing Zhongke Ansheng Corporation of {1. technology 100080 Beijing China 3. Graduate School of the chinese academy of sciences 100039 Beijing China

Based on the study of existing fair exchange protocols, this paper sets up an accurate formal model by stepwise refinement. In the process of refinement an unreliable channel is employed to simulate an attack behavior. The model provides a novel formal definition of exchanged items, and presents the formal goals for fairness, accountability, etc., reflecting the inherent requirements for fair exchange protocols across-the-board. In order to check, prove, and design fair exchange protocols effectively and efficiently, the model puts forward a novel property of abuse-freeness which applies to all fair exchange protocols, gives a formal definition for trust strand of the third party, and presents general criteria of designing a secure and effective fair exchange protocol. Taking a typical fair exchange protocol as an example, this paper presents the analysis steps of fair exchange protocols appealing to our model. An unknown attack is uncovered. The analysis reveals the process of a complete attack, discovering deeper reasons for causing an attack. Finally, we modify the flawed protocol and the revised protocol ensures the desirable properties.

关键词： events local causal relation local temporal relation global relation exchanged item security goals.

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A property-based attestation protocol for TCM

引用

Science China(information {1.) 2010年第3期53卷 454-464页

作者： FENG DengGuo1.2 & QIN Yu1.2 1.tate Key Laboratory of information {1., institute of Software, chinese academy of Science, beijing 1.01.0, China 2National Engineering research center of information {1., beijing 1.01.0, China 1. State Key Laboratory of information {1. Institute of Software Chinese Academy of Science Beijing 100190 China2. National Engineering Research Center of Information Security Beijing 100190 China

This paper presents a property attestation protocol for the security chip TCM (trusted cryptographic module) via analyzing the problems of the current property attestation, which is built on the property attestation model with the online trust third party. In the protocol the prover utilizes the zero-knowledge proof by the attribute certificates, configuration commitment and TCM signature, and attests its configuration and status which are compliant with the declarative security property. The protocol is characterized by shorter signature length and lower computations. The security of the protocol is proved at the random oracle model. The protocol can help extend application and improve standard for security chip TCM, and it also has practical value and immediate significance.

关键词： trust computing trust cryptographic module (TCM) property attestation signature of knowl- edge configuration commitment

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Black-box testing based on colorful taint analysis

引用

Science China(information {1.) 2012年第1期55卷 171-183页

作者： CHEN Kai1,2,3,FENG DengGuo1,SU PuRui1&ZHANG YingJun1,2,3 1State Key Laboratory of information {1.,institute of Software,chinese academy of Science,beijing 1.01.0,China 2State Key Laboratory of information {1.,Graduate University of chinese academy of sciences,beijing 100049,China 3National Engineering {1.} {1.} of information {1.,beijing 1.01.0,China 1. State Key Laboratory of information {1. Institute of Software Chinese Academy of Science Beijing 100190 China2. State Key Laboratory of Information Security Graduate University of Chinese Academy of Sciences Beijing 100049 China3. National Engineering Research Center of Information Security Beijing 100190 China

Software vulnerability detection is one of the most important methods for guaranteeing software *** main classes of methods can detect vulnerabilities in binary files:white-box testing and black-box *** former needs to construct and solve path constraints to detect *** has two main drawbacks:path exploding and complexity of *** latter often aimlessly exhausts various inputs to test binary *** paper combines both testing methods to detect vulnerabilities in binary *** analyzing the input elements that aect check condition corresponding to a certain check point,we can generate one class of inputs that get to the check point to increase fuzzing *** analyzing the relationship between guard conditions and check condition,the redundant check points are *** taint analysis method(CTAM)is proposed to compute guard conditions,which is more ecient than traditional taint analysis method(TTAM).We implemented a prototype and made several experiments on *** results showed that our method could increase the eciency of black-box testing.

关键词： software testing vulnerability detection dynamic testing black-box testing colorful taint analysis

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Analysis of moment invariants under general linear transformation

引用

Science China(information {1.) 2010年第7期53卷 1305-1311页

作者： DIAO LuHong1. LI Hua2, ZHANG Sen1.& LIU Lei1.1.ollege of Applied sciences, {1. University of technology, {1. 1.01.4, China 2National center of Intelligent computing, institute of computing technology, chinese academy of Science, {1. 1.0080, China 1. College of Applied sciences Beijing University of Technology Beijing 100124 China2. National Center of Intelligent Computing Institute of Computing Technology Chinese Academy of Science Beijing 100080 China

This paper presents the necessary and sufficient condition of moment invariants under general linear transformation. Based on this condition, arbitrary order and dimensional moment invariant sets can be constructed. D... 详细信息

关键词： moment invariants independence linear transformation

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

A novel logic-based automatic approach to constructing compliant security policies

引用

Science China(information {1.) 2012年第1期55卷 149-164页

作者： BAO YiBao1,2,4,YIN LiHua1,FANG BinXing 1,3&GUO Li 1 1institute of {1. technology,chinese academy of sciences,beijing 1.01.0,China 2institute of Electronic technology,{1.} Engineering University,Zhengzhou 450004,China 3beijing University of Posts and Telecommunications,beijing 1.01.0,China 4Graduate University,the chinese academy of Science,beijing 100049,China 1. institute of computing technology Chinese Academy of Sciences Beijing 100190 China2. Institute of Electronic Technology Information Engineering University Zhengzhou 450004 China4. Graduate University the Chinese Academy of Science Beijing 100049 China3. Beijing University of Posts and Telecommunications Beijing 100190 China

It is significant to automatically detect and resolve the incompliance in security *** existing works in this field focus on compliance verification,and few of them provide approaches to automatically correct the incompliant security *** paper proposes a novel approach to automatically transform a given security policy into a compliant *** security policy Π and delegation policy M declared by logic programs,the approach automatically rewrites Π into a new one ΠM which is compliant with M and is readable by the *** prove that the algorithm is sound and complete under noninterference ***,we show that the security policy query evaluation algorithm with conflict and unsettlement resolution still works very well on Π*** approach is automatic,so it doesn't require a administrator with excess *** this sense,our proposal can help us to save much manpower resource in security management and improves the security assurance abilities.

关键词： security policy rewriting logic program compliance

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Multiparty simultaneous quantum identity authentication with secret sharing

引用

Science China(Physics,Mechanics & Astronomy) 2008年第3期51卷 321-327页

作者： YANG YuGuang1,2,WEN QiaoYan3 & ZHANG Xing4,5 1 College of Computer Science and technology,{1. University of technology,{1. 100022,China 2 State Key Laboratory of information security (Graduate University of the chinese academy of sciences),{1. 100049,China 3 School of Science,{1. University of Posts and Telecommunications,{1. 100876,China 4 {1.} of Electronic technology,information Engineering University,Zhengzhou 450004,China 5 Trusted {1.} Laboratory,{1. University of technology,{1. 100022,China College of Computer Science technology Beijing University of Technology Beijing 100022 China State Key Laboratory of information {1. [Graduate University of the chinese academy of sciences] Beijing 100049 China School of Science Beijing University of Posts Telecommunications Beijing 100876 China institute of Electronic {1. Information Engineering University Zhengzhou 450004 China Trusted computing Laboratory Beijing University of Technology Beijing 100022 China

Two multiparty simultaneous quantum identity authentication (MSQIA) protocols based on secret sharing are presented. All the users can be authenticated by a trusted third party (TTP) simultaneously. In the first protocol,the TTP shares a random key K with all the users using quantum secret sharing. The ith share acts as the authentication key of the ith user. When it is necessary to perform MSQIA,the TTP generates a random number R secretly and sends a sequence of single photons encoded with K and R to all the users. According to his share,each user performs the corresponding unitary operations on the single photon sequence sequentially. At last,the TTP can judge whether the impersonator exists. The sec-ond protocol is a modified version with a circular structure. The two protocols can be efficiently used for MSQIA in a network. They are feasible with current technol-ogy.

关键词： quantum identity authentication secret sharing quantum cryptography

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Accountable authority key policy attribute-based encryption

引用

Science China(information {1.) 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 {1. security Evaluation center,beijing 1.0085,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,1.0039,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

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：