检索结果-南通市图书馆

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 {3. {3., Institute of Software, Chinese Academy of Sciences, beijing 100190, China 1. state key laboratory of {3. {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 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

Simulation study of phase retrieval for hard X-ray in-line phase contrast imaging

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Physics,Mechanics & Astronomy) 2005年第4期48卷 450-458页

作者： YU Bin1,2, PENG Xiang1,2, TIAN Jindong1, NIU Hanben1, DIAO Luhong3.& LI Hua3.1. key laboratory of Optoelectronic Devices and Systems of Ministry of Education, Institute of Optoelec- tronics, Shenzhen University, Shenzhen 518060, China 2. state key laboratory of Precision Measuring Technology and Instruments, Tianjin University, Tianjin 3.0072,China 3. key laboratory of Intelligent information Processing, Institute of Computing Technology, Chinese Academy of Sciences, beijing 100080,China 1. key laboratory of Optoelectronic Devices and Systems of Ministry of Education Institute of Optoelectronics Shenzhen University 518060 Shenzhen China 2. state key laboratory of Precision Measuring Technology and Instruments Tianjin University 300072 Tianjin China 3. key laboratory of Intelligent information Processing Institute of Computing Technology Chinese Academy of Sciences 100080 Beijing China

Two algorithms for the phase retrieval of hard X-ray in-line phase contrast imaging are presented. One is referred to as Iterative Angular Spectrum Algorithm (IASA) and the other is a hybrid algorithm that combines IASA with TIE (transport of intensity equation). The calculations of the algorithms are based on free space propagation of the angular spectrum. The new approaches are demonstrated with numerical simulations. Comparisons with other phase retrieval algorithms are also performed. It is shown that the phase retrieval method combining the IASA and TIE is a promising technique for the application of hard X-ray phase contrast imaging.

关键词： X-ray optics, phase contrast imaging, phase retrieval, angular spectrum, hard X-ray.

Analysis of a kind of quantum cryptographic schemes based on secret sharing

在线全文

学校读者我要写书评

暂无评论

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 {3. {3. 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 {3. {3. 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

Power functions with low uniformity on odd characteristic finite fields

在线全文

学校读者我要写书评

暂无评论

Science China Mathematics 2010年第8期53卷 1931-1940页

作者： ZHA ZhengBang 1,3.& WANG XueLi 2 1 School of Mathematical Sciences,Luoyang Normal University,Luoyang 471022,China 2 School of Mathematical Sciences,South China Normal University,Guangzhou 51063.,China 3.state key laboratory of {3. {3.,Graduate University of Chinese Academy of Sciences,beijing 100049,China 1. School of Mathematical Sciences Luoyang Normal University Luoyang 471022 China3. State Key Laboratory of Information Security Graduate University of Chinese Academy of Sciences Beijing 100049 China2. School of Mathematical Sciences South China Normal University Guangzhou 510631 China

In this paper,we give some new low differential uniformity of some power functions defined on finite fields with odd *** corollaries of the uniformity,we obtain two families of almost perfect nonlinear functions in GF... 详细信息

关键词： almost perfect nonlinear function differential uniform function finite field

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 {3. of {3. 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.

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 {3. {3. of Networking and Switching Technology, beijing University of Posts and Telecommunications, beijing 100876, China 2{3. {3. of Network and information Attack and Defence Technology of MOE, beijing University of Posts and Telecommunications, beijing 100876, China 3.ational Engineering {3. 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

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 {3. {3.,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 {3. {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

On designated-weight Boolean functions with highest algebraic immunity

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China Mathematics 2010年第11期53卷 2847-2854页

作者： LIU MeiCheng1,3. DU YuSong2, PEI DingYi2 & LIN DongDai1 1The state key laboratory of {3. {3., Institute of Software of Chinese Academy of Sciences, beijing 100190, China 2College of Mathematics and {3. Sciences, Guangzhou University, Guangzhou 510006, China 3.raduate University of Chinese Academy of Sciences, beijing 100049, China 1. The state key laboratory of {3. {3. Institute of Software of Chinese Academy of Sciences Beijing 100190 China3. Graduate University of Chinese Academy of Sciences Beijing 100049 China2. College of Mathematics and Information Sciences Guangzhou University Guangzhou 510006 China

Algebraic immunity has been considered as one of cryptographically significant properties for Boolean functions. In this paper, we study ∑d-1 i=0 (ni)-weight Boolean functions with algebraic immunity achiev-ing the minimum of d and n - d + 1, which is highest for the functions. We present a simpler sufficient and necessary condition for these functions to achieve highest algebraic immunity. In addition, we prove that their algebraic degrees are not less than the maximum of d and n - d + 1, and for d = n1 +2 their nonlinearities equalthe minimum of ∑d-1 i=0 (ni) and ∑ d-1 i=0 (ni). Lastly, we identify two classes of such functions, one having algebraic degree of n or n-1.

关键词： cryptography Boolean function algebraic immunity algebraic degree nonlinearity

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 {3. {3., 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 {3. {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