检索结果-南通市图书馆

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 {2. of information security, graduate School of chinese academy of Sciences, beijing 100049, china) [a]state key {2. 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.

Paillier's trapdoor function hides Θ(n) bits

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

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

作者： SU Dong & Lü KeWei state key {2. of information security,graduate university of chinese academy of Sciences,beijing 100049,china 1. state key {2. 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

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

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 10012., china 2.state key laboratory of information security, graduate university of chinese {12. of Sciences, beijing 100049, china College of Computer Science and Technology Beijing University of Technology Beijing 100124 China state key {2. 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

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 10012., 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 {12. 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 {2. of Integrated Services Network Xidian University Xi’an 710071 China state key {2. of information security Graduate University of Chinese Academy of Sciences Beijing 100049 China state key {2. 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 secure direct communication without entanglement

在线全文

学校读者我要写书评

暂无评论

Science china(Physics,Mechanics & Astronomy) 2008年第2期51卷 176-183页

作者： YANG YuGuang1,3 & WEN QiaoYan2.1 College of Computer Science and Technology, beijing university of Technology, beijing 10002., china 2.School of Science, beijing university of Posts and Telecommunications, beijing 100876, china 3.state key laboratory of information security (graduate School of chinese academy of Sciences), {12., china 1. College of Computer Science and Technology Beijing University of Technology Beijing 100022 China 3. state key {2. of information security (graduate School of chinese academy of Sciences) Beijing 100049 China 2. School of Science Beijing University of Posts and Telecommunications Beijing 100876 China

For the first time, a threshold quantum secure direct communication (TQSDC) scheme is presented. Similar to the classical Shamir's secret sharing scheme, the sender makes n shares, S1, …, Sn of secret key K and each receiver keeps a share secretly. If the sender wants to send a secret message M to the receivers, he en-codes the information of K and M on a single photon sequence and sends it to one of the receivers. According to the secret shares, the t receivers sequentially per-form the corresponding unitary operations on the single photon sequence and ob-tain the secret message M. The shared shares may be reusable if it can be judged that there is no eavesdropper in line. We discuss that our protocol is feasible with current technology.

关键词： quantum secure direct communication threshold secure direct communication quantum secret sharing

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 10012.,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 {12. 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 {2. of Integrated Services Network Xidian University Xi’an 710071 China state key {2. of information security (graduate university of chinese academy of Sciences) Beijing 100049 China state key {2. 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 {2.. This protocol is feasible with the present-day technique.

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

Threshold proxy quantum signature scheme with threshold shared verification

在线全文

学校读者我要写书评

暂无评论

Science china(Physics,Mechanics & Astronomy) 2008年第8期51卷 1079-1088页

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

A threshold proxy quantum signature scheme with threshold shared verification is proposed. An original signer could authorize a group as its proxy signers. Then only t or more of n persons in the proxy group can generate the proxy signature on behalf of the original signer and any t-1 or fewer ones cannot do that. When the proxy signature needs to be verified,any t or more of n persons belonging to the verification group can verify the message and any t-1 or fewer ones cannot verify the validity of the proxy signature.

关键词： quantum signature threshold proxy quantum group signature threshold shared verification