检索结果-南通市图书馆

Black-box testing based on colorful taint analysis

在线全文

学校读者我要写书评

暂无评论

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

作者： CHEN Kai1,2,3,FENG DengGuo1,SU PuRui1&ZHANG YingJun1,2,3 1State Key Laboratory of information security,Institute of Software,Chinese Academy of Science,beijing 1.01.0,China 2State Key Laboratory of information security,Graduate University of Chinese Academy of Sciences,beijing 100049,China 3.ational engineering research center of information security,beijing 1.01.0,China 1. State Key Laboratory of information security 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

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 center 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 Chinese Academy of Sciences, beijing 100039, China 1. engineering research center for information security Technology Institute of Software Chinese Academy of Sciences 100080 Beijing China 2. beijing Zhongke Ansheng Corporation of information 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.

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 center for information security Technology, Institute of Software, Chinese Academy of Sciences, beijing 100080, China 2. beijing Zhongke Ansheng Corporation of information Technology, beijing 100080, China 3. Graduate School of the Chinese Academy of Sciences, beijing 100039, China 1. engineering research center for information security Technology Institute of Software Chinese Academy of Sciences Beijing 100080 China 2. beijing Zhongke Ansheng Corporation of information 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 property-based attestation protocol for TCM

在线全文

学校读者我要写书评

暂无评论

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

作者： FENG DengGuo1,2 & QIN Yu1,2 1State Key Laboratory of information security, Institute of Software, Chinese Academy of Science, beijing 1.01.0, China 2National engineering research center of information security, beijing 1.01.0, China 1. State Key Laboratory of information security 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

Identifying heavy hitters in high-speed network monitoring

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

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

作者： ZHANG Yu1, FANG BinXing1,2 & ZHANG YongZheng2 1research center 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, beijing 1.01.0, China 1. research center 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

Secure network coding in the presence of eavesdroppers

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(information Sciences) 2010年第3期53卷 648-658页

作者： LUO MingXing1,2,3, YANG YiXian1,2,3, WANG LiCheng1,2,3 & NIU XinXin1,2,3 1information security center, State Key Laboratory of Networking and Switching Technology, beijing University of Posts and Telecommunications, beijing 100876, China 2Key Laboratory of Network and information Attack and Defence Technology of MOE, beijing University of Posts and Telecommunications, beijing 100876, China 3.ational engineering Laboratory for Disaster Backup and Recovery, beijing University of Posts and Telecommunications, beijing 100876, China 1. information security center State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China2. Key Laboratory of Network and Information Attack and Defence Technology of MOE Beijing University of Posts and Telecommunications Beijing 100876 China3. National Engineering Laboratory for Disaster Backup and Recovery Beijing University of Posts and Telecommunications Beijing 100876 China

Our concern, in the paper, is to construct information-theoretic secure network coding in the presence of eavesdroppers. Based on the generalized attack model and all-or-nothing transformation, the security of network coding in the generalized combination network can be characterized by the network capacity and the min-cut bound of wiretapping set from the source. Furthermore, it can be extended to any directed acyclic networks with single source. Compared with the traditional results, we construct information-theoretic secure network coding without additional encryptions and giving up any capacity.

关键词： all-or-nothing transformation secure network coding eavesdropping

A novel quantum information hiding protocol based on entanglement swapping of high-level Bell states

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Physics B 2015年第5期24卷 231-238页

作者：徐淑奖陈秀波王连海钮心忻杨义先 Shandong Provincial Key Laboratory of Computer Networks Shandong Computer Science Center (National Supercomputer Center in Jinan) information security center State Key Laboratory of Networking and Switching TechnologyBeijing University of Posts and Telecommunications State Key Laboratory of information security Institute of Information Engineering Chinese Academy of Sciences

Using entanglement swapping of high-level Bell states, we first derive a covert layer between the secret message and the possible output results of the entanglement swapping between any two generalized Bell states, and then propose a novel high-efficiency quantum information hiding protocol based on the covert layer. In the proposed scheme, a covert channel can be built up under the cover of a high-level quantum secure direct communication （QSDC） channel for securely transmitting secret messages without consuming any auxiliary quantum state or any extra communication resource. It is shown that this protocol not only has a high embedding efficiency but also achieves a good imperceptibility as well as a high security.

关键词： quantum information hiding quantum covert'channel entanglement swapping high-level Bell states

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 DECORRELATED FAST CIPHER

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Electronics(China) 2000年第1期17卷 94-96页

作者： Wu Wenling Li Bao Feng Denguo Qing Sihan(engineering research center for information security Technology,Chinese Academy of Sciences, beijing 100080)

Decorrelated Fast Cipher(DFC) is a candidate for the Advanced Encryption Standard (AES). It is shown that the cryptographic properties of the confusion permutation of DFC are weak in this paper. With the same F-function of DFC, a Feistel cipher VDFC which has no resistance against differential cryptanalysis is constructed. This demonstrates the importance of the key addition into DFC sufficiently. As a result, DFC may not be qualified candidate for the AES.

关键词： Round function Permutation Differential cryptanalysis Nonlinearity