检索结果-南通市图书馆

An efficient quantum proactive incremental learning algorithm

在线全文

学校读者我要写书评

暂无评论

Science China(Physics,Mechanics & Astronomy) 2024年

作者： Lingxiao Li Jing Li Yanqi Song Sujuan Qin qiaoyan wen Fei Gao State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications School of Cyberspace Security Beijing University of Posts and Telecommunications

In scenarios where a large amount of data needs to be learned, incremental learning can make full use of old knowledge, significantly reduce the computational cost of the overall learning process, and maintain high performance. In this paper, taking the MaxCut problem as our example, we introduce the idea of incremental learning into quantum computing, and propose a Quantum Proactive Incremental Learning algorithm(QPIL). Instead of a one-off training of quantum circuit, QPIL contains a multi-phase training on gradually-increased subgraphs of all vertices, proactively reducing large-scale problems to smaller ones to solve in steps, providing an efficient solution for MaxCut. Specifically, some vertices and corresponding edges are randomly selected for training to obtain optimized parameters of the quantum circuit at first. Then, in each incremental phase, the remaining vertices and corresponding edges are gradually added and the parameters obtained from the previous phase are reused in the parameter initialization of the current phase. We perform experiments on 120 different small-scale graphs, and it shows that QPIL performs superior to prevalent quantum and classical baselines in terms of approximation ratio(AR), time cost, anti-forgetting, and solving stability. In particular, QPIL's AR surpasses 20% of mainstream quantum baselines, and the time cost is less than 1/5 of them. The idea of QPIL is expected to inspire efficient and high-quality solutions in large-scale MaxCut and other combinatorial optimization problems.

关键词：

Quantum position verification in bounded-attack-frequencymodel

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Physics,Mechanics & Astronomy) 2016年第11期59卷 17-27页

作者： Fei Gao Bin Liu qiaoyan wen State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications College of Computer Science Chongqing University

In 2011, Buhrman et al. proved that it is impossible to design an unconditionally secure quantum position verification(QPV)protocol if the adversaries are allowed to previously share unlimited entanglements. Afterwards, people started to design secure QPV protocols in practical settings, e.g. the bounded-storage model, where the adversaries' pre-shared entangled resources are supposed to be limited. Here we focus on another practical factor that it is very difficult for the adversaries to perform attack operations with unlimitedly high frequency. Concretely, we present a new kind of QPV protocols, called non-simultaneous *** we prove the security of a specific non-simultaneous QPV protocol with the assumption that the frequency of the adversaries' attack operations is bounded, but no assumptions on their pre-shared entanglements or quantum storage. Actually, in our nonsimultaneous protocol, the information whether there comes a signal at present time is also a piece of command. It renders the adversaries "blind", that is, they have to execute attack operations with unlimitedly high frequency no matter whether a signal arrives, which implies the non-simultaneous QPV is also secure in the bounded-storage model.

关键词： quantum cryptography position-based cryptography quantum position verification

A strongly secure pairing-free certificateless authenticated key agreement protocol under the CDH assumption

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2016年第3期59卷 107-122页

作者： Haiyan SUN qiaoyan wen wenmin LI State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Zhengzhou University of Light Industry

Certificateless authenticated key agreement(CL-AKA) protocols have been studied a great deal since they neither suffer from a heavy certificate management burden nor have the key escrow problem. Recently, many efficient CL-AKA protocols without pairings have been built. However, these pairing-free CL-AKA protocols are either not proved in any formal security model or proved under the gap Diffie-Hellman(GDH)assumption, a non-standard and strong assumption. With available implementation technologies, pairings are needed to realize the GDH assumption, which means that these pairing-free CL-AKA protocols are not pure pairing-free. Furthermore, these protocols are insecure in the strengthened e CK(se CK) model, which encompasses the e CK model and considers leakages on intermediate results. In this paper, we present a pure pairing-free CL-AKA protocol, which is provably secure in the se CK model under the standard computational Diffie-Hellman(CDH) assumption. Compared with the existing CL-AKA protocols, the proposed protocol has advantage over them in security or efficiency.

关键词： CDH assumption se CK model pairing certificateless cryptography authenticated key agreement

A Pairing-Free Certificateless Signcryption Scheme for Vehicular Ad Hoc Networks

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2021年第5期30卷 947-955页

作者： DU Hongzhen wen qiaoyan ZHANG Shanshan GAO Mingchu School of Mathematics and Information Science Baoji University of Arts and Sciences State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications School of Telecommunications Engineering Xidian University Department of Mathematics Louisiana College

Vehicular ad hoc networks(VANETs) create an vital platform for communication between vehicles,which can realize accident warning, auxiliary driving, road traffic information query, passenger communication and other applications. While providing convenient services for people, VANETs also bring some security risks. Security and privacy are the primary issues in the research of VANETs. Signcryption is an ideal way to transfer messages in a logical step in a secure and authenticated *** design a Certificateless signcryption(CLSC) scheme to provide confidentiality, authentication, integrity, nonrepudiation and user privacy preservation for the information transmitted between vehicle communication *** demonstrate the confidentiality and unforgeability of the proposed scheme in the random oracle ***, compared with the existing CLSC schemes, ours realizes the perfect combination of efficiency, security and privacy, and it is particularly well adapted to the secure communication of vehicle networks.

关键词： Cryptography Mobile radio systems Data security Certificateless public key cryptography Signcryption Vehicular ad hoc networks Elliptic curve

Minimum best success probability by classical strategies for quantum pseudo-telepathy

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Physics,Mechanics & Astronomy) 2014年第7期57卷 1244-1249页

作者： GAO Fei FANG Wei wen qiaoyan State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications

Quantum pseudo-telepathy(QPT)is a new type of game where the quantum team can win with certainty while the classical one *** means the advantages of quantum participants over classical ones in ***,there has been no systematic and formal analysis on the QPT game *** we present the formal description of the QPT game and the definition of the most simplified *** on the above definitions,we simplify a famous QPT game,*** Cabllo ***,according to some instances,we analyze the minimum best success probability by classical strategies of the two-player QPT,which reflects the advantage of the quantum ***,we prove the best success probability by classical strategies for the most simplified QPT is totally related to the number of all possible question combinations.

关键词： quantum game pseudo-telepathy quantum strategy

Algebraic immunities of vector-valued functions over finite fields

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2015年第5期22卷 16-21页

作者： Liu Zhenhua Zhang Jie wen qiaoyan Computer science department China Women's University School of Science Beijing University of Posts and Telecommunications State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications

Algebraic immunity is an important cryptographic property of Boolean functions. The notion of algebraic immunity of Boolean functions has been generalized in several ways to vector-valued functions over arbitrary finite fields. In this paper, the results of Ref. [25] are generalized to arbitrary finite fields. We obtain vector-valued functions over arbitrary finite fields such that their algebraic immunities can reach the upper bounds. Furthermore, all the component functions, together with their some nonzero linear combinations, of vector-valued Boolean functions achieved by this construction have optimal algebraic immunities simultaneously.

关键词： cryptography Boolean functions algebraic immunity

A novel pairing-free certificateless authenticated key agreement protocol with provable security

在线全文

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2013年第4期7卷 544-557页

作者： Haiyan SUN qiaoyan wen Hua ZHANG Zhengping JIN State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China

Recently, He et al. （Computers and Mathematics with Applications, 2012） proposed an efficient pairing-free certificateless authenticated key agreement （CL-AKA） protocol and claimed their protocol was provably secure in the extended Canetti-Krawczyk （eCK） model. By giving concrete attacks, we indicate that their protocol is not secure in the eCK model. We propose an improved protocol and show our improvement is secure in the eCK model under the gap DiffieHellman （GDH） assumption. Furthermore, the proposed protocol is very efficient.

关键词： attacks pairings eCK model provable security,certificateless authenticated key agreement

Cryptanalysis and improvement of a certificateless encryption scheme in the standard model

在线全文

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2014年第1期8卷 163-173页

作者： Lin CHENG qiaoyan wen Zhengping JIN Hua ZHANG State Key Laboratory of Networking and Switch Technology Beijing University of Posts and Telecommunications Beijing 100876 China

Certificateless public key cryptography elimi- nates inherent key escrow problem in identity-based cryptog- raphy, and does not yet requires certificates as in the tradi- tional public key infrastructure. In this paper, we give crypt- analysis to Hwang et al.＇s certificateless encryption scheme which is the first concrete certificateless encryption scheme that can be proved to be secure against ＂malicious-but- passive＂ key generation center （KGC） attack in the stan- dard model. Their scheme is proved to be insecure even in a weaker security model called ＂honest-but-curious＂ KGC at- tack model. We then propose an improved scheme which is really secure against ＂malicious-but-passive＂ KGC attack in the standard model.

关键词： certificateless public key cryptography stan-dard model provable security

Quantum secure direct communication with cluster states

在线全文

学校读者我要写书评

暂无评论

Science China(Physics,Mechanics & Astronomy) 2010年第7期53卷 1271-1275页

作者： CAO WeiFeng YANG YuGuang wen qiaoyan College of Electric and Information Engineering Zhengzhou University of Light IndustryZhengzhou 450002China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and TelecommunicationsBeijing 100876China College of Computer Science and Technology Beijing University of TechnologyBeijing 100124China State Key Laboratory of Integrated Services Network Xidian UniversityXi’an 710071China State key Laboratory of Information Security Gradute University of Chinese Academy of Sciences Beijing 100049China

A quantum secure direct communication protocol with cluster states is *** with the deterministic secure quantum communication protocol with the cluster state proposed by Yuan and Song(***.,2009,7:689),this protocol ca... 详细信息

关键词： quantum secure direct communication deterministic secure quantum communication cluster state