检索结果-南通市图书馆

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 {2. of {2. {4., institute of software, chinese academy of Sciences, beijing 100190, China state key {2. of {2. {4. Institute of Software Chinese Academy of Sciences Beijing 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

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 {2. of {2. {4., institute of software, chinese academy of Sciences, beijing 100190, China 2.Graduate University of the chinese academy of Sciences, beijing 10004., China The state key {2. of {2. {4. Institute of Software Chinese Academy of Sciences Beijing China Graduate University of the chinese academy of Sciences Beijing 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 {2. of {2. {4.,institute of software,chinese academy of Sciences,beijing 100190,China 2.Graduate University of chinese academy of Sciences,beijing 10004.,China state key {2. of {2. {4. Institute of Software Chinese Academy of Sciences Beijing China Graduate University of chinese academy of Sciences Beijing 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

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 {2. of {2. {4., Graduate University of chinese academy of Sciences, beijing 10004., China 2.0} key {2. of {2. {4., institute of software of chinese academy of Sciences, beijing 100080, China state key {2. of {2. {4. Graduate University of Chinese Academy of Sciences Beijing China state key {2. of {2. {4. Institute of Software of Chinese Academy of Sciences Beijing 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

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

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

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

作者： YANG Junhui and ZHAI Qibininstitute of software , chinese {2. of Sciences , beijing 100080, China {4. 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.

Dynamic tree-based authenticated group key exchange protocol

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China(information Sciences) 2010年第8期53卷 1591-1602页

作者： LI Hui 1,2., WU ChuanKun 1 & TENG JiKai 1,2.1 state key {2. of {2. {4., institute of software, chinese academy of Sciences, beijing 100190, China 2.Graduate University of chinese academy of Sciences, beijing 10004., China state key {2. of {2. {4. Institute of Software Chinese Academy of Sciences Beijing China Graduate University of chinese academy of Sciences Beijing 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

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 {2. {2. of information security, institute of software of chinese academy of Science, beijing 100039,China College of information Technology and Sciences Nankai University Tianjin China state key {2. of {2. {4. Institute of Software of Chinese Academy of Science Beijing 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 property-based attestation protocol for TCM

在线全文

学校读者我要写书评

暂无评论

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

作者： FENG DengGuo1,2.& QIN Yu1,2.1state key {2. of {2. {4., institute of software, chinese academy of Science, beijing 100190, China 2.ational Engineering Research Center of {2. {4., beijing 100190, China state key {2. of {2. {4. Institute of Software Chinese Academy of Science Beijing China National Engineering Research Center of information security Beijing 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

CBCR:CBC MAC with rotating transformations

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(information Sciences) 2011年第11期54卷 2247-2255页

作者： ZHANG LiTing 1,2.WU WenLing 1,ZHANG Lei 1 & WANG Peng 2. state key {2. of {2. {4.,institute of software,chinese academy of Sciences,beijing 100190,China 2.Graduate University of chinese academy of Sciences,beijing 10004.,China state key {2. of {2. {4. Institute of Software Chinese Academy of Sciences Beijing China Graduate University of chinese academy of Sciences Beijing China

Message authentication codes (MACs) are widely used to protect data integrity and data origin authentication in *** this paper,we propose a new block-cipher-based MAC algorithm,CBCR,with provable security for arbitrary-length *** adopts rotating operations in the end of cipherblock-chaining structure,and it appends fixed-length prefixes to all messages,which implies flexible usages in *** example,these fixed-length prefixes can be filled with some security parameters,message redundancies,*** also propose CBCR0,a special case of CBCR that sets its prefix to be an all-zero *** with CMAC,a recommended standard by the US National {2. of Standards and Technology (NIST),CBCR0 enjoys all the advantages that CMAC has,but requires less memory;so,in practical applications,CBCR0 behaves as well as CMAC does,and it is even more suitable for environments with limited memory resources,*** cards.

关键词： message authentication code cipher block chaining block cipher provable security