检索结果-南通市图书馆

Multiparty simultaneous quantum identity authentication with secret sharing

在线全文

学校读者我要写书评

暂无评论

Science china.Physics,Mechanics & Astronomy) 2008年第3期51卷 321-327页

作者： YANG YuGuang1,2,WEN QiaoYan3 & ZHANG Xing4.5 1 College of computer Science and Technology,beijing university of Technology,beijing 100022,{4.2 State Key Laboratory of information Security (Graduate university of the Chinese Academy of Sciences),beijing 100049,{4.3 School of Science,beijing university of Posts and Telecommunications,beijing 100876,{4.4.Institute of Electronic Technology,information engineering university,Zhengzhou 4.0004.{4.5 Trusted Computing Laboratory,beijing university of Technology,beijing 100022,china College of computer Science Technology Beijing University of Technology Beijing 100022 China State Key Laboratory of information Security [Graduate university of the Chinese Academy of Sciences] Beijing 100049 China School of Science Beijing University of Posts Telecommunications Beijing 100876 China Institute of Electronic Technology Information Engineering University Zhengzhou 450004 China Trusted Computing Laboratory Beijing University of Technology Beijing 100022 China

Two multiparty simultaneous quantum identity authentication (MSQIA) protocols based on secret sharing are presented. All the users can be authenticated by a trusted third party (TTP) simultaneously. In the first protocol,the TTP shares a random key K with all the users using quantum secret sharing. The ith share acts as the authentication key of the ith user. When it is necessary to perform MSQIA,the TTP generates a random number R secretly and sends a sequence of single photons encoded with K and R to all the users. According to his share,each user performs the corresponding unitary operations on the single photon sequence sequentially. At last,the TTP can judge whether the impersonator exists. The sec-ond protocol is a modified version with a circular structure. The two protocols can be efficiently used for MSQIA in a network. They are feasible with current technol-ogy.

关键词： quantum identity authentication secret sharing quantum cryptography

Dense coding scheme using superpositions of Bell-states and its NMR implementation

在线全文

学校读者我要写书评

暂无评论

Science china.Physics,Mechanics & Astronomy) 2005年第1期48卷 57-67页

作者： ZHANG Jingfu, XIE Jingyi, DENG Zhiwei & LU Zhiheng Key Laboratory for Quantum information and Measurements, Department of Physics, Tsinghua university, beijing 100084. china.Center for Quantum information, Tsinghua university, beijing 100084. china.Department of Materials Science and engineering, beijing Normal university, beijing 100875, china.Testing and Analytical Center, beijing Normal university, beijing 100875, china.Department of Physics, beijing Normal university, beijing 100875, china 1. Key Laboratory for Quantum information and Measurements Department of Physics Tsinghua University 100084 Beijing China 2. Center for Quantum information Tsinghua University 100084 Beijing China 3. Department of Materials Science and engineering Beijing Normal University 100875 Beijing China 4. Testing and Analytical Center Beijing Normal University 100875 Beijing China 5. Department of Physics Beijing Normal University 100875 Beijing China

Dense coding using superpositions of Bell-states is proposed. The generalized Grover's algorithm is used to prepare the initial entangled states, and the reverse process of the quantum algorithm is used to determine the entangled state in the decoding measurement. Compared with the previous schemes, the superpositions of two Bell-states are exploited. Our scheme is demonstrated using a nuclear magnetic resonance (NMR)quantum computer. The corresponding manipulations are obtained. Experimental results show a good agreement between theory and experiment. We also generalize the scheme to transmit eight messages by introducing an additional two-state system.

关键词： dense coding, superpositions of Bell-states, generalized Grover's algorithm, nuclear magnetic res-onance, quantum computer.

Implementation of a multiple round quantum dense coding using nuclear magnetic resonance

在线全文

学校读者我要写书评

暂无评论

Science china.Physics,Mechanics & Astronomy) 2005年第6期48卷 706-715页

作者： ZHANG Jingfu1, XIE Jingyi2, WANG Chuan1, DENG Zhiwei3, LU Zhiheng4. & LONG Guilu1,5 1. Key Laboratory For Quantum information and Measurements of MOE, Department of Physics, Tsinghua university, beijing 100084.china.2. Department of Materials Science and {4., beijing Normal university, beijing 100875, china.3. Testing and Analytical Center, beijing Normal university, beijing 100875,china.4. Department of Physics, beijing Normal university, beijing 100875, china.5. Key Laboratory For atomic and Molecular Nanosciences, Tsinghua university, beijing 100084.china 1. Key Laboratory For Quantum information and Measurements of MOE Department of Physics Tsinghua University 100084 Beijing China 2. Department of Materials science and engineering Beijing Normal University 100875 Beijing China 3. Testing and Analytical Center Beijing Normal University 100875 Beijing China 4. Department of Physics Beijing Normal University 100875 Beijing China 5. Key Laboratory For Atomic and Molecular Nanosciences Tsinghua University 100084 Beijing China

A multiple round quantum dense coding scheme based on the quantum phase estimation algorithm is proposed and implemented in a three qubit nuclear magnetic resonance (NMR) quantum computer. Using an m + 1 qubit system, Bob can transmit one of 2m+1 messages to Alice, through manipulating only one qubit and exchanging it between Alice and Bob for m rounds. The information capacity is enhanced to m + 1 bits as compared to m bits in a classical scheme. The scheme has been demonstrated in NMR system, and the experimental results show a good agreement between theory and experiment.

关键词： quantum dense coding, multiple round, nuclear magnetic resorance

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, {4.2 State Key Laboratory of information Security, Graduate university of Chinese Academy of Sciences, beijing 100022, {4.3 School of Science, beijing university of Posts and Telecommunications, beijing 100876, {4.4.National Key Laboratory for Modern Communications, Chengdu 61004., 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

Complex conforming Delaunay triangulation

在线全文

学校读者我要写书评

暂无评论

Science china.information Sciences) 2010年第6期53卷 1130-1140页

作者： MENG XianHai 1, LI JiGang 1, YANG Qin 1, CAI Qiang 2 & CHEN QiMing 3 1 NLSDE, School of computer Science and engineering, BeiHang university, beijing 100083, {4.2 School of computer Sciences, beijing Technology and business university, beijing 100037, {4.3 School of Mechanical engineering and Automation, BeiHang university, beijing 100083, {14. 1. NLSDE School of Computer Science and Engineering BeiHang University Beijing 100083 China2. School of Computer Sciences Beijing Technology and Business University Beijing 100037 China3. School of Mechanical Engineering and Automation BeiHang University Beijing 100083 China

A novel algorithm of conforming Delaunay triangulation for curved geometry is presented in the paper.A progress has been made for the problem puzzled Delaunay refinement where curved constraints cannot be accepted as input *** algorithm is based on a new sufficient condition for the existence of constraints in *** requires computing only the intersection between constraints and Voronoi edges or faces instead of the circum-sphere of curved *** the termination of the algorithm when small input angles exist in constraints, a weighted method is applied to ensure that the algorithm can terminate under any *** two-dimensional and three-dimensional results are also *** is shown that the algorithm has the capability of dealing with both linear and nonlinear constraints in a consistent way, without the need of maintaining triangular meshes on face constraints.

关键词： mesh generation Delaunay triangulation conforming curved constraints tetrahedralization weight

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. {4.2 State Key Laboratory of Integrated Services Network, Xidian university, Xi’an 710071, {4.3 State Key Laboratory of information Security (Graduate university of Chinese Academy of Sciences), beijing 100049, {4.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 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.{4.2 State Key Laboratory of Networking and Switching Technology,beijing university of Posts and Tele-communications,beijing 100876,{4.3 State Key Laboratory of Integrated Services Network,Xidian university,Xi’an 710071,{4.4.State Key Laboratory of information Security(Graduate university of Chinese Academy of Sciences) ,beijing {14.9,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

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.{4.2 State Key Laboratory of Integrated Services Network,Xidian university,Xi’an 710071,{4.3 State Key Laboratory of information Security (Graduate university of Chinese Academy of Sciences),beijing 100049,{4.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

Fuzzy tolerance quotient spaces and fuzzy subsets

在线全文

学校读者我要写书评

暂无评论

Science china.information Sciences) 2010年第4期53卷 704-714页

作者： ZHANG Ling1 & ZHANG Bo2,3,4. 1computer Science & Technology College, Anhui university, Anhui 230039, china.2State Key Laboratory of Intelligent Technology and Systems, beijing 100084. china.3Tsinghua National Laboratory of information Science & Technology, beijing 100084. china.4.5} Science & Technology College, computer Science & Technology Department, Tsinghua university, beijing 100084. china 1. computer Science & Technology College Anhui University Anhui 230039 China2. State Key Laboratory of Intelligent Technology and Systems Beijing 100084 China3. Tsinghua National Laboratory of Information Science & Technology Beijing 100084 China4. Information Science & Technology College Computer Science & Technology Department Tsinghua University Beijing 100084 China

The structure and characteristic of fuzzy subsets are discussed by using the concepts of granulation and hierarchy in quotient space theory. First, the equivalence relation based quotient space theory is extended to the fuzzy tolerance relation. Second, the isomorphism and its discriminant of fuzzy tolerance relations are discussed. Finally, by using the fuzzy tolerance relation to define the fuzzy subset, its properties are addressed. The main results are given below: (1) several equivalent statements of fuzzy tolerance relations; (2) the definition of isomorphism of fuzzy tolerance relations; (3) the isomorphic discriminant of fuzzy tolerance relations; (4. the definition and properties of fuzzy subsets based on the fuzzy tolerance relations; and (5) the necessary and sufficient condition of the isomorphism of fuzzy subsets. These results will help us further comprehend the concepts of fuzzy tolerance relations and fuzzy subsets.

关键词： Fuzzy tolerance relation quotient space isomorphism fuzzy subset