检索结果-南通市图书馆

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

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

Quasi-secure quantum dialogue using single photons

在线全文

学校读者我要写书评

暂无评论

science china(Physics,Mechanics & Astronomy) 2007年第5期50卷 558-562页

作者： yang yuguang1,2 & wen qiaoyan31 college of computer science and technology, beijing university of technology, beijing 100022, china 2 State Key Laboratory of Information Security, Graduate university of the Chinese Academy of sciences, beijing 100049, china 3 School of science, beijing university of Posts and Telecommunications, beijing 100876, 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

A quasi-secure quantum dialogue protocol using single photons was proposed. Different from the previous entanglement-based protocols, the present protocol uses batches of single photons which run back and forth between the two parties. A round run for each photon makes the two parties each obtain a classical bit of information. So the efficiency of information transmission can be increased. The present scheme is practical and well within the present-day technology.

关键词： quantum dialogue, single photon, quantum secure direct communication

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,china 2 State Key Laboratory of Information Security (Graduate university of the Chinese Academy of sciences),beijing 100049,china 3 School of science,beijing university of Posts and Telecommunications,beijing 100876,china 4 Institute of Electronic technology,Information Engineering university,Zhengzhou 450004,china 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

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

Terrain classification based on adaptive weights with airborne LiDAR data for mining area

在线全文

学校读者我要写书评

暂无评论

中国有色金属学会会刊：英文版 2011年第S3期21卷 648-653页

作者： LI Hui-ying1, WANG Zhi2, SUN Ya-feng1, LI wen-hui1 1. college of computer science and technology, Jilin university, Changchun 130012, china 2. college of Resources and Civil Engineering, Northeastern university, Shenyang 110004, china [a] college of computer science and technology Jilin University Changchun 130012 China [b] college of Resources and Civil Engineering Northeastern University Shenyang 110004 China

The fast high-efficiency inspection for mining subsidence of mine area is a reliable way for forecasting accident and evaluating losing expense. In order to monitor mining subsidence of exploitation mine efficiently, LiDAR data were used and a novel strip division method was brought forward based on separating-treatment theory, which divided the mass of discrete three-dimensional point cloud data into a series of parallel strips and reduced the dimension in each strip. Polynomial fitting algorithm based on the adaptive weights, which located in the range of the strip, was used for classification complex terrain data of mine-area. The results show that LiDAR datamation can be greatly reduced. In the mean time, the time spending for calculation is shortened, and computational complexity is simplified. Therefore, high-efficiency terrain classification of LiDAR point cloud method can be great beneficial to monitoring environment of mine area.

关键词： mining subsidence airborne LiDAR strip division adaptive weights

The construction of infinite families of any k-tight optimal and singular k-tight optimal directed double loop networks

在线全文

学校读者我要写书评

暂无评论

science china Mathematics 2007年第7期50卷 1055-1064页

作者： Bao-xing CHEN~(1+) Xie-bin CHEN~2 Ji-xiang MENG~3 wen-jun XIAO~4 1 Department of computer science,Zhangzhou Teachers college,Zhangzhou 363000,china 2 Department of Mathematics and Information science,Zhangzhou Teachers college,Zhangzhou 363000,china 3 college of Mathematics & System science,Xinjiang university,Urumqi 830046,china 4 Department of computer science,South china university of technology,Guangzhou 510641,china 1. Department of computer science Zhangzhou Teachers College Zhangzhou 363000 China 2. Department of Mathematics and Information science Zhangzhou Teachers College Zhangzhou 363000 China 3. college of Mathematics & System science Xinjiang University Urumqi 830046 China 4. Department of computer science South China University of Technology Guangzhou 510641 China

The double loop network(DLN)is a circulant digraph with n nodes and outdegree *** is an important topological structure of computer interconnection networks and has been widely used in the designing of local area networks and distributed *** the number n of nodes,how to construct a DLN which has minimum diameter?This problem has attracted great attention.A related and longtime unsolved problem is:for any given non-negative integer k,is there an infinite family of k-tight optimal DLN?In this paper,two main results are obtained:(1)for any k≥0,the infinite families of k-tight optimal DLN can be constructed,where the number n(k,e,c)of their nodes is a polynomial of degree 2 in e with integral coefficients containing a parameter c.(2)for any k≥0, an infinite family of singular k-tight optimal DLN can be constructed.

关键词： double loop network diameter k-tight optimal singular k-tight optimal 05C12 05C20 05C85

Web Application Comprehension Based on Dependence Analysis

在线全文

学校读者我要写书评

暂无评论

Wuhan university Journal of Natural sciences 2004年第5期9卷 731-734页

作者： WU Jun-hua 1,2 , XU Bao-wen 1 , JIANG Ji-xiang 1 1.Department of computer science and Engineering, Southeast university, Nanjing 210096, Jiangsu, china 2.college of computer science and Engineering, Nanjing university of technology, Nanjing 210009, Jiangsu , china Southeast university Department of Computer Science and Engineering Nanjing Jiangsu China (GRID:grid.263826.b) (ISNI:***) Najing university of technology College of Computer Science and Engineering Nanjing Jiangsu China (GRID:grid.41156.37) (ISNI:***) Southeast university Department of Computer Science and Engineering Nanjing Jiangsu China (GRID:grid.263826.b) (ISNI:***)

Many research indicate a lot of money and time are spent on maintaining and modifying program delivered. So the policies to support program comprehension are very important. Program comprehension is a crucial and difficult task. Insufficient design, illogical code structure, short documents will enhance the comprehensive difficulty. Developing Web application is usually a process with quick implementation and delivery. In addition, generally a Web application is coded by combining mark language statements with some embedded applets. Such programming mode affects comprehension of Web applications disadvantageously. This paper proposes a method to improving understanding Web by dependence analysis and slice technology. Key words Web application comprehension - program dependence - hyper graph - pogram slicing CLC number TP 311 Foundation item: Supported in part by the Young Scientist’s Fund of NSFC (60373066, 60303024). National Grand Fundamental Research 973 Program of china (2002CB312000) and National Research Foundation for the Doctoral Program of Higher Education of chinaBiography: WU Jun-hua (1965-), female, Ph. D. research direction: software engineering.

关键词： Web application comprehension program dependence hyper graph pogram slicing