检索结果-南通市图书馆

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, {2. 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 10003., 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 {2. 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 Center for information {3. Technology, {2. 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 10003., 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 {2. 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.

维普期刊数据库

Improved multi-pass fast correlation attacks with applications

在线全文

学校读者我要写书评

暂无评论

Science china(information {2.) 2011年第8期54卷 1635-1644页

作者： ZHANG Bin & FENG DengGuo State key laboratory of {2. {3.,institute of software,chinese academy of sciences,beijing 100190,china 1. State key laboratory of {2. {3. Institute of Software Chinese Academy of Sciences Beijing 100190 China

In this paper we propose two new algorithms for multi-pass fast correlation attacks on stream *** first algorithm aims at fast symbol-wise decoding in the circumstances that the noise is not very high and we have little resource for *** second algorithm deals with the practical decoding problem in the high noise and limited keystream *** new algorithms are applicable to arbitrary form LFSR and compare favorably to the previously known algorithms in the scenarios under *** applications,we demonstrate new key recovery attacks on one-level Bluetooth E0 and LILI-12.,*** 2.3. -bit keystream and 2.2.-byte memory,our attack against one-level E0 needs 2.3..1 *** 2.2.-bit keystream and 2.2..5 -byte memory,our attack on LILI-12. has time complexity 2.70.6 operations.

关键词： stream cipher fast correlation attacks linear feedback shift register (LFSR) Bluetooth E0 LILI-12.

security model and modular design of fair authentication key exchange protocols

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(information {2.) 2010年第2期53卷 278-287页

作者： FENG DengGuo & CHEN WeiDong State key laboratory of {2. {3., institute of software, chinese academy of sciences, beijing 100190, china 1. State key laboratory of {2. {3. Institute of Software Chinese Academy of Sciences Beijing 100190 China

It is traditionally assumed that the legal two parties in authentication key exchange (AKE) communications are both credible. However, in more and more network applications nowadays, it is often required that such protocols be run under the circumstances where ones do not trust in each other. Therefore, in this paper we propose the idea of fair authentication key exchange (FAKE), which has not only the basic properties of AKE protocols, but also some new properties: the "session proof" embedded in the input of protocols by the customer; and if not revealed, the protocols have the deniability, otherwise the transcript of protocol is binding for the identifications. Such a method is capable of solving the contradiction between protecting privacy and the dissension on network service. Then the {2. model of FAKE protocols is formulated systematically and a flaw of the {2. model of current signature schemes proposed by Kudla is also corrected. Finally, a kind of FAKE protocol based on current signature schemes is designed and the mBJM-AK {2., conditional deniability and fairness of FAKE protocols are proved in the random oracle model.

关键词： authentication key exchange protocols deniability fairness concurrent signature provable security

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 {3., the {2. academy of sciences, beijing 100080, china 2.Engineering Research Center for information security Technology, the {2. academy of sciences, beijing 100080, china 3.Graduate School of the {2. academy of sciences, beijing 100080, 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

维普期刊数据库

On constant-round zero-knowledge proofs of knowledge for NP-relations

在线全文

学校读者我要写书评

暂无评论

Science china(information {2.) 2010年第4期53卷 788-799页

作者： LI HongDa1*, XU HaiXia1, LI Bao1 & FENG DengGuo2.1State key laboratory of {2. security, Graduate University of chinese academy of sciences, beijing 100049, china 2.tate key laboratory of {2. security, institute of software of chinese academy of sciences, beijing 100080, china 1. State key laboratory of {2. {3. Graduate University of Chinese Academy of Sciences Beijing 100049 China2. State Key Laboratory of Information Security Institute of Software of Chinese Academy of Sciences Beijing 100080 China

This paper considers the existence of constant-round zero-knowledge proofs of knowledge for NP under standard assumptions. By introducing a new interactive proof model, we construct a 3.round zero-knowledge proof of knowledge system for the NP-relation under the assumption that factoring is intractable. Our construction not only shows the existence of constant-round zero-knowledge proofs of knowledge, but also gives a positive answer to the open problem of the existence of 3.round zero-knowledge proofs for NP.

关键词： zero-knowledge proof proof of knowledge constant-round NP-relation

A two-round honest-verifier zero-knowledge protocol

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(information {2.) 2010年第5期53卷 954-963页

作者： LIU HanWu 1,2.& LIN DongDai 1 1 The State key laboratory of {2. security, institute of software, chinese academy of sciences, beijing 100190, china 2.Graduate University of the chinese academy of sciences, beijing 100049, china 1. The State key laboratory of {2. {3. Institute of Software Chinese Academy of Sciences Beijing 100190 China2. Graduate University of the Chinese Academy of Sciences Beijing 100049 China

Since the concept of zero-knowledge protocols was introduced, it has attracted a lot of attention and in turn showed significant effect on the development of cryptography, complexity theory and other areas. The round complexity of a zero-knowledge protocol is a very important efficiency consideration, and it is required to be as small as possible. Generally, it is desirable to have zero-knowledge protocols with constant numbers of rounds. Goldreich and Oren proved that only languages in BPP have one-round and two-round zero-knowledge protocols. Moreover, they also showed that only languages in BPP have one-round honest-verifier zero-knowledge protocols. The notion of honest-verifier zero-knowledge protocols is highly non-trivial and fascinating itself, and has many other uses. Thus, the problem as to whether there exist two-round honest-verifier zero-knowledge protocols becomes an important open problem. In this paper, we introduce a new simulation technique and present a two-round honest-verifier zero-knowledge protocol for any language in N P under a standard complexity assumption based on this technique.

关键词： proof system argument system zero-knowledge witness indistinguishability black-box one-way permutation commitment scheme zap

CMQV+:An authenticated key exchange protocol from CMQV

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(information {2.) 2012年第7期55卷 1666-1674页

作者： LI Hui 1,2.& WU ChuanKun 1 1 State key laboratory of {2. security,institute of software,chinese academy of sciences,beijing 100190,china 2.Graduate University of chinese academy of sciences,beijing 100049,china 1. State key laboratory of {2. {3. Institute of Software Chinese Academy of Sciences Beijing 100190 China2. Graduate University of Chinese Academy of Sciences Beijing 100049 China

Ustaoglu presents a secure and efficient key exchange protocol named CMQV,based on the design rationales of HMQV and *** with the latter two protocols,on one hand,CMQV achieves high performance of HMQV,and on the other,it is proven secure in eCK model as NAXOS ***,CMQV enjoys the security proof under gap Diffie-Hellman assumption as indicated by its *** this paper,we propose a variant of CMQV,called CMQV+,which is proven secure under a weaker assumption (*** Diffie-Hellman assumption) in eCK model with random oracles while maintaining the high-performance feature of CMQV as much as possible.

关键词： key exchange eCK model trapdoor-test technique provable security CDH assumption

Dynamic tree-based authenticated group key exchange protocol

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(information {2.) 2010年第8期53卷 1591-1602页

作者： LI Hui 1,2., WU ChuanKun 1 & TENG JiKai 1,2.1 State key {3. of {2. security, institute of software, chinese academy of sciences, beijing 100190, china 2.Graduate University of chinese academy of sciences, beijing 100049, china 1. State key laboratory of {2. {3. Institute of Software Chinese Academy of Sciences Beijing 100190 China2. Graduate University of Chinese Academy of Sciences Beijing 100049 China

Authenticated group key exchange protocols allow a group of users over a public network to establish a shared secret key for the subsequent cryptographic goals. In this paper, we extend BD-II scheme into a dynamic setting, and propose a tree-based authenticated key exchange protocol which is more suitable for dynamic groups in such as ad hoc networks. Our protocol is proven secure in random-oracle model. Additionally, we analyze the costs of our protocols in both communication and computation terms, and compare its performance with three well-known protocols.

关键词： tree-based group key exchange dynamic provable security