检索结果-南通市图书馆

science China(Physics,Mechanics & Astronomy) 2009年第9期52卷 1313-1316页

作者： ZHANG XingLan1 & JI DongYao2 1 College of Computer science and Technology, beijing university of Technology, beijing 100124, China 2 state key laboratory of information security, graduate university of chinese academy of sciences, beijing 100049, China College of Computer science and Technology Beijing University of Technology Beijing 100124 China state key laboratory of information security Graduate University of Chinese Academy of Sciences Beijing 100049 China

Recently, Yang et al. proposed a kind of quantum cryptographic schemes based on secret sharing. The main idea is drawn from the case, where any n participants who share a secret K can co-operate as K does. This process can be applied to encryption, authentication, signature and so on. Unfortunately, since there is no identity authentication of the share's holder, these schemes inherit the limitation of secret sharing in practice. If some participants do not follow the protocol, the protocol would be a failure at last. Moreover, these schemes encounter another serious attack. Any two participants can co-operate to defeat the schemes by sending different shares to the parties unknown to the distributor of the secret K, such that these parties can execute the protocol as well. The attack proves that it is not enough for quantum cryptographic schemes that only the secret key is secure.

关键词： quantum identity authentication quantum secure direct communication quantum signature secret sharing

维普期刊数据库

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 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

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

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

维普期刊数据库

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 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

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

Joint source channel VL coding/decoding for deep space communication networks based on a space trellis

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science China(information sciences) 2011年第9期54卷 1883-1894页

作者： WU WeiRen 1,TU Juan 2,TU GuoFang 1,GAO ShaoShuai 1 & ZHANG Can 1,3 1 School of information science and Engineering,graduate university of chinese academy of sciences,beijing 100049,China 2 beijing Institute of Electronic System Engineering,China Aerospace science & Industry Corp.,beijing 100854,China 3 state key laboratory of information security,graduate university of chinese academy of science,beijing 100049,China 1. School of information science and Engineering Graduate University of Chinese Academy of Sciences Beijing 100049 China2. Beijing Institute of Electronic System Engineering China Aerospace Science & Industry Corp. Beijing 100854 China3. State Key Laboratory of Information Security Graduate University of Chinese Academy of Science Beijing 100049 China

This paper presents joint source channel variable length (VL) coding/decoding based on a space *** constructing a joint decoding plane trellis,better decoding performance can be achieved than by using the bit-level decoding ***,the plane trellis is complicated,which results in high decoding complexity for decoding VL turbo *** solve this problem,we construct a space trellis and design a low-complexity joint decoding algorithm with a variable length symbol-a posteriori probability (VLS-APP) algorithm in resource constrained deep space communication *** results show that the proposed approach reduces the decoding complexity by 10% compared with the plane trellis,and the gain of Eb/N0 is about 0.2 dB at SER=***,it provides substantial error protection for variable-length encoded image data.

关键词： joint coding/decoding VL turbo codes space trellis VLS-APP

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 21 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

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 Institute 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

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 100190,China 2state key laboratory of information security,graduate university of chinese academy of sciences,beijing 100049,China 3National 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. 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