检索结果-南通市图书馆

security model and modular design of fair authentication key exchange protocols

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china(information sciences) 2010年第2期53卷 278-287页

作者： FENG DengGuo & CHEN WeiDong state key laboratory of information security, institute of software, chinese academy of sciences, beijing 100190, china 1. state key laboratory of information security 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 security model of FAKE protocols is formulated systematically and a flaw of the security 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 security, conditional deniability and fairness of FAKE protocols are proved in the random oracle model.

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

Nondegenerative ML-sequences over ring Z/(2~e)

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

chinese science Bulletin 1999年第17期44卷 1557-1561页

作者： YANG Junhui and ZHAI Qibininstitute of software , chinese academy of sciences , beijing 100080, china state key laboratory of information security , beijing 100080, china chinese Acad Sci Inst Software Beijing 100080 Peoples R China state key Lab Informat Secur Beijing 100080 Peoples R China

The so-called quasi-period of an ML-sequence has been introduced. It is noted that an ML-sequence may degenerate in the sense that it has the quasi-period shorter than its period, and the problem of constructing the n... 详细信息

关键词： nondegenerate ML-sequence quasi-period.

Research on applying physical chaos generator to spacecraft information security

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

science china(Technological sciences) 2009年第5期52卷 1463-1470页

作者： ZHAO HePing state key laboratory of information security,Graduate University of chinese academy of sciences,beijing 100049,china china academy of Space Technology,beijing 100094,china state key laboratory of information security Graduate University of Chinese Academy of Sciences Beijing 100049 China china academy of Space Technology Beijing 100094 China

The effectiveness of a short-length message extension method based on physical chaos generator was analyzed and the entropy of the extended message was calculated in this *** analysis demon-strated that with the mentioned method the entropy of short-length messages,which are repeatedly used in spacecraft data systems,is obviously increased,and the security of transmission is enhanced as *** paper also presented an improvement of the protocol for secret key agreement presented by *** and *** of depending on characteristics of communication channel,this method takes advantage of the random data produced by physical chaos generator to preset the initial parameters of the procedure on both sides of communication,so that the procedure and quantity of cipher key can be precisely *** method can be used to cipher key management of se-cure communication between long life-span spacecraft and ground system.

关键词： physical chaos generator spacecraft information security message extension cipher key management

维普期刊数据库

Privilege Flow Oriented Intrusion Detection Based on Hidden Semi-MarkovModel

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural sciences 2005年第1期10卷 137-141页

作者： ZHONG An-ming 1, JIA Chun-fu 1,21.College of information Technology and sciences, Nankai University, Tianjin 300071,china 2.state key laboratory of information security, institute of software of chinese academy of science, beijing 1.0039,china College of information Technology and sciences Nankai University Tianjin 300071 China

A privilege flow oriented intrusion detection method based on HSMM (Hidden semi-Markov Model) is discussed. The privilege flow model and HSMM are incorporated in the implementation of an anomaly detection IDS (Intrusion Detection System). Using the dataset of DARPA 1998, our experiment results reveal good detection performance and acceptable computation cost.

关键词： key words intrusion detection privilege flow model HSMM

维普期刊数据库

A two-round honest-verifier zero-knowledge protocol

在线全文

学校读者我要写书评

暂无评论

science china(information sciences) 2010年第5期53卷 954-963页

作者： LIU HanWu 1,2 & LIN DongDai 1 1 The state key laboratory of information 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 information security 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 sciences) 2012年第7期55卷 1666-1674页

作者： LI Hui 1,2 & WU ChuanKun 1 1 state key laboratory of information 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 information security 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

A formula on linear complexity of highest coordinate sequences from maximal periodic sequences over Galois rings

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Progress in Natural science:Materials International 2006年第9期16卷 998-1001页

作者： HU Lei and SUN Nigang (state key laboratory of information security, Graduate School of chinese academy of sciences, beijing 100049, china) [a]state key laboratory of information security Graduate School of Chinese Academy of Sciences Beijing China

Using a polynomial expression of the highest coordinate map, we deduce an exact formula on the linear complexity of the highest coordinate sequence derived from a maximal periodic sequence over an arbitrary Galois ring of characteristic p2 , where p is a prime. This generalizes the known result of Udaya and Siddiqi for the case that the Galois ring is Z4.

关键词： Galois ring highest coordinate sequence linear complexity.

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

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china(information sciences) 2010年第4期53卷 788-799页

作者： LI HongDa1*, XU HaiXia1, LI Bao1 & FENG DengGuo2 1state key laboratory of information security, Graduate University of chinese academy of sciences, beijing 100049, china 2state key laboratory of information security, institute of software of chinese academy of sciences, beijing 100080, china 1. state key laboratory of information security 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 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 100190, china 2National Engineering Research Center of information security, beijing 100190, 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