检索结果-南通市图书馆

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.

Round-optimal zero-knowledge proofs of knowledge for NP

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science China(information sciences) 2012年第11期55卷 2473-2484页

作者： LI HongDa1,FENG DengGuo2,LI Bao1 & XUE HaiXia1 1state key Lab of information security,graduate university of chinese academy of sciences,beijing 100049,China 2state key Lab of information security,Institute of software of chinese academy of sciences,beijing 100080,China 1. state key Lab of information security Graduate University of Chinese Academy of Sciences Beijing 100049 China2. State Key Lab of Information Security Institute of software of Chinese Academy of Sciences Beijing 100080 China

It is well known that all the known black-box zero-knowledge proofs of knowledge for NP are *** there exit constant-round black-box zero-knowledge proofs of knowledge for all NP languages under certain standard assumptions is an open *** paper focuses on the problem and gives a positive answer by presenting two constructions of constant-round(black-box) zero-knowledge proofs of knowledge for the HC(hamiltonian cycle) *** the recent result of Katz,our second construction which relies on the existence of claw-free functions has optimal round complexity(5-round) assuming the polynomial hierarchy does not collapse.

关键词： zero-knowledge proofs proofs of knowledge black-box simulation constant-round

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

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 100022, 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), beijing 100049, China 1. College of Computer science and Technology Beijing University of Technology Beijing 100022 China 3. state key laboratory 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

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

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 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 2. state key laboratory 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

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

An efficient quantum secret sharing protocol with orthogonal product states

在线全文

学校读者我要写书评

暂无评论

science China(Physics,Mechanics & Astronomy) 2007年第3期50卷 331-338页

作者： YANG YuGuang1,2, WEN QiaoYan3 & ZHU FuChen4 1 School of Computer, beijing university of Technology, beijing 100022, China 2 state key laboratory of information security, graduate university of chinese academy of sciences, beijing 100022, China 3 School of science, beijing university of Posts and Telecommunications, beijing 100876, China 4 National key laboratory for Modern Communications, Chengdu 610041, China 1. School of Computer Beijing University of Technology Beijing 100022 China 2. state key laboratory of information security Graduate University of Chinese Academy of Sciences Beijing 100022 China 3. School of science Beijing University of Posts and Telecommunications Beijing 100876 China 4. National key laboratory for Modern Communications Chengdu 610041 China

An efficient quantum secret sharing protocol with orthogonal product states in the 33 Hilbert space is presented. The particles in the orthogonal product states form two particle sequences. One sequence is sent to Bob and the other is sent to Charlie after rearranging the particle orders. With the help of Alice, Bob and Charlie make the corresponding local measurement to obtain the information of the or- thogonal product states prepared. This protocol has many distinct features such as great capacity and high efficiency.

关键词： quantum secret sharing orthogonal product state orthogonal measurement