检索结果-南通市图书馆

Threshold proxy quantum signature scheme with threshold shared verification

在线全文

学校读者我要写书评

暂无评论

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

作者： yang yuguang1,3.4 & wen {3. 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 qiaoyan3. College of {3. 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

Quantum threshold group signature

在线全文

学校读者我要写书评

暂无评论

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

作者： yang yuguang1,2,3.& wen qiaoyan4 1 College of {3. 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), {13. 100049, china 4 State Key Laboratory of Networking and Switching technology, {13. university of Posts and Tele-communications, {13. 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 {3. 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),{13. 100049,china 4 State Key Laboratory of Networking and Switching technology,{13. university of Posts and Tele-communications,{13. 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

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 {3. 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 {3., 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

A quantum federated learning framework for classical clients

在线全文

学校读者我要写书评

暂无评论

science china(Physics,Mechanics & Astronomy) 2024年第5期67卷 1-10页

作者： Yanqi Song Yusen Wu Shengyao Wu Dandan Li qiaoyan wen Sujuan Qin Fei Gao State Key Laboratory of Networking and Switching technology Beijing University of Posts and TelecommunicationsBeijing 00876China Department of Physics The University of Western AustraliaPerthWA 6009Australia School of computer science(National Pilot Software Engineering School) Beijing University of Posts and TelecommunicationsBeijing100876China

Quantum federated learning(QFL)enables collaborative training of a quantum machine learning(QML)model among multiple clients possessing quantum computing capabilities,without the need to share their respective local ***,the limited availability of quantum computing resources poses a challenge for each client to acquire quantum computing *** raises a natural question:Can quantum computing capabilities be deployed on the server instead?In this paper,we propose a QFL framework specifically designed for classical clients,referred to as CC-QFL,in response to this *** each iteration,the collaborative training of the QML model is assisted by the shadow tomography technique,eliminating the need for quantum computing capabilities of ***,the server constructs a classical representation of the QML model and transmits it to the *** clients encode their local data onto observables and use this classical representation to calculate local *** local gradients are then utilized to update the parameters of the QML *** evaluate the effectiveness of our framework through extensive numerical simulations using handwritten digit images from the MNIST *** framework provides valuable insights into QFL,particularly in scenarios where quantum computing resources are scarce.

关键词： client server quantum

On the construction of multi-output Boolean functions with optimal algebraic immunity

在线全文

学校读者我要写书评

暂无评论

science china(Information sciences) 2012年第7期55卷 1617-1623页

作者： ZHANG Jie 1,2 ,SONG ShouChao 1 ,DU Jiao 2,3.& wen qiaoyan 2 1 School of science,{3. university of Posts and Telecommunications,{3. 100876,china 2 State Key Laboratory of Networking and Switching technology,{3. university of Posts and Telecommunications,{3. 100876,china 3.Department of Mathematics,Xinxiang university,Xinxiang 453.03.china 1. School of science Beijing University of Posts and Telecommunications Beijing 100876 China2. State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China3. Department of Mathematics Xinxiang University Xinxiang 453003 China

In this paper,we show a construction of multi-output Boolean functions with optimal algebraic ***,the relationship between the algebraic immunity of a multi-output Boolean function and those of its component functions is *** show that all the component functions,together with their nonzero linear combination,of the multi-output Boolean functions achieved by this construction have optimal algebraic immunity simultaneously.

关键词： algebraic immunity Boolean functions algebraic attacks annihilators

More efficient automatic repair of large-scale programs using weak recompilation

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china(Information sciences) 2012年第12期55卷 2785-2799页

作者： QI YuHua 1,MAO XiaoGuang 1,wen YanJun 1,DAI ZiYing 1 & GU Bin 2 1 School of computer,National university of Defense {3.,Changsha 410073.china 2 beijing Institute of Control Engineering,beijing 100190,china 1. School of computer National University of Defense Technology Changsha 410073 China2. Beijing Institute of Control Engineering Beijing 100190 China

Automatically repairing a bug can be a time-consuming process especially for large-scale programs owing to the significant amount of time spent recompiling and reinstalling the patched *** reduce this time overhead and speed up the repair process,in this paper we present a recompilation technique called weak *** weak recompilation,we assume that a program consists of a set of components,and for each candidate patch only the altered components are recompiled to a shared *** original program is then dynamically updated by a function indirection *** advantage of weak recompilation is that redundant recompilation cost can be avoided,and while the reinstallation cost is completely eliminated as the original executable program is not modified at *** maximum applicability of weak recompilation we created WAutoRepair,a scalable system for fixing bugs with high efficiency in large-scale C *** experiments on real bugs in widely used programs show that our repair system significantly outperforms Genprog,a wellknown approach to automatic program *** the wireshark program containing over 2 million lines of code,WAutoRepair is over 128 times faster in terms of recompilation cost than Genprog.

关键词： weak recompilation efficiency automated program repair automated debugging experiment