检索结果-南通市图书馆

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.

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

Paillier's trapdoor function hides Θ(n) bits

在线全文

学校读者我要写书评

暂无评论

Science china(information Sciences) 2011年第9期54卷 1827-1836页

作者： SU Dong & Lü KeWei state key laboratory of information security,Graduate University of Chinese Academy of Sciences,beijing 100049,china 1. state key laboratory of information security Graduate University of Chinese Academy of Sciences Beijing 100049 China

In this paper,we re-examine the bit security of Paillier’s trapdoor *** show that given a random w=gcyN mod N2 ∈ZN2* the most significant bit of its class c is a hard-core predicate,under a standard assumption that is computing composite residuosity class is *** the simultaneous security,we prove that n number of the class c’s bits are simultaneously hard-core under the standard assumption,where n is the length of c.

关键词： Paillier’s trapdoor function hard-core predicate hard-core function simultaneous security most significant bit

SOME RESULTS ON GENERALIZED DIFFERENCE SETS

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2008年第1期21卷 76-84页

作者： Xiwang CAO School of Mathematical Science, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, china state key Lab. of information security, beijing 100049, china. School of Mathematical Science Nanjing University of Aeronautics Astronautics Nanjing 210016 China state key Lab. of information security Beijing 100049 China

Sequences with ideal correlation functions have important applications in communications such as CDMA, FDMA, etc. It has been shown that difference sets can be used to construct such sequences. The author extends Pott and Bradley＇s method to a much broader case by proposing the concept of generalized difference sets. Some necessary conditions for the existence of generalized difference sets are established by means of some Diophantine equations. The author also provides an algorithm to determine the existence of generalized difference sets in the cyclic group Zv. Some examples are presented to illustrate that our method works.

关键词： Correlation functions diophantine equations generalized difference sets.

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

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

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

Quantum threshold group signature

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(Physics,Mechanics & Astronomy) 2008年第10期51卷 1505-1514页

作者： YANG YuGuang1,2,3 & WEN QiaoYan4 1 College of Computer Science and Technology, beijing University of Technology, beijing 100124, china 2.state key laboratory of Integrated Services Network, Xidian University, Xi’an 710071, china 3 state key laboratory of information security (Graduate University of Chinese Academy of Sciences), beijing 100049, china 4 state key laboratory of Networking and Switching Technology, beijing University of Posts and Tele-communications, beijing 100876, china College of Computer Science and Technology Beijing University of Technology Beijing 100124 China state key laboratory of Integrated Services Network Xidian University Xi’an 710071 China state key laboratory of information security Graduate University of Chinese Academy of Sciences Beijing 100049 China state key laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China

In most situations, the signer is generally a single person. However, when the message is written on behalf of an organization, a valid message may require the approval or consent of several persons. Threshold signature is a solution to this problem. Generally speaking, as an authority which can be trusted by all members does not exist, a threshold signature scheme without a trusted party appears more attractive. Following some ideas of the classical Shamir’s threshold signature scheme, a quantum threshold group signature one is proposed. In the proposed scheme, only t or more of n persons in the group can generate the group signature and any t-1 or fewer ones cannot do that. In the verification phase, any t or more of n signature receivers can verify the message and any t-1 or fewer receivers cannot verify the validity of the signature.

关键词： threshold quantum signature trusted party quantum cryptography

Threshold quantum secret sharing between multi-party and multi-party

在线全文

学校读者我要写书评

暂无评论

Science china(Physics,Mechanics & Astronomy) 2008年第9期51卷 1308-1315页

作者： YANG YuGuang1,2,3 & WEN QiaoYan4 1 College of Computer Science and Technology,beijing University of Technology,beijing 100124,china 2.state key laboratory of Integrated Services Network,Xidian University,Xi’an 710071,china 3 state key laboratory of information security (Graduate University of Chinese Academy of Sciences),beijing 100049,china 4 state key laboratory of Networking and Switching Technology,beijing University of Posts and Tele-communications,beijing 100876,china College of Computer Science and Technology Beijing University of Technology Beijing 100124 China state key laboratory of Integrated Services Network Xidian University Xi’an 710071 China state key laboratory of information security (Graduate University of Chinese Academy of Sciences) Beijing 100049 China state key laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China

A threshold quantum secret sharing (TQSS) scheme between multi-party and multi-party was proposed using a sequence of single photons,which is useful and efficient when the parties of communication are not all present. We described the process of this TQSS scheme and discussed its security. It was shown that entan-glement is not necessary for quantum secret sharing. Moreover,the theoretic effi-ciency was improved to approach 100% as almost all the instances can be used for generating the private key,and each photon can carry one bit of information. This protocol is feasible with the present-day technique.

关键词： threshold quantum secret sharing quantum cryptography single photon multi-party and multi-party