In many economic and financial applications, it is important to have secure communications. At present, communication security is provided mostly by RSA coding, but the emergent quantum computing can break this encoding, thus making it not secure. One way to make communications absolutely secure is to use quantum encryption. The existing schemes for quantum encryption are aimed at agent-to-agent communications; however, in practice, we often need secure multi-agent communications, where each of the agents has the ability to securely send messages to everyone else. In principle, we can repeat the agent-to-agent scheme for each pair of agents, but this requires a large number of complex preliminary quantum communications. In this paper, we show how to minimize the number of such preliminary communications - without sacrificing reliability of the all-pairs scheme.
In many economic and financial applications, it is important to have secure communications. At present, communication security is provided mostly by RSA coding, but the emergent quantum computing can break this encoding, thus making it not secure. One way to make communications absolutely secure is to use quantum encryption. The existing schemes for quantum encryption are aimed at agent-to-agent communications; however, in practice, we often need secure multi-agent communications, where each of the agents has the ability to securely send messages to everyone else. In principle, we can repeat the agent-to-agent scheme for each pair of agents, but this requires a large number of complex preliminary quantum communications. In this paper, we show how to minimize the number of such preliminary communications - without sacrificing reliability of the all-pairs scheme.
One of the main reasons for the current interest in quantum computing is that, in principle, quantum algorithms can break the RSA encoding, the encoding that is used for the majority secure communications - in particular, the majority of e-commerce transactions are based on this encoding. This does not mean, of course, that with the emergence of quantum computers, there will no more ways to secretly communicate: while the existing non-quantum schemes will be compromised, there exist a quantum cryptographic scheme that will enables us to secretly exchange information. In this scheme, however, there is a certain probability that an eavesdropper will not be detected. A natural question is: can we decrease this probability by an appropriate modification of the current quantum cryptography algorithm? In this paper, we show that such a decrease is not possible: the current quantum cryptography algorithm is, in some reasonable sense, optimal.
The contest between code-makers and code-breakers has been going on for thousands of years. Recently, quantum mechanics has made a remarkable entry in the field. On the one hand, it has been rigorously proven that quantum cryptography can provide absolute security for communications between two users. On the other hand, code-breakers in possession of a quantum computer can easily break popular encryption schemes such as RSA and Data Encryption Standard (DES) which are essentially intractable with any classical computer. Here I survey these recent developments.
The cyber-security of multi-agent control systems has become vital in practice. To protect the communication process between the individual agents over TCP/IP networks, one must encrypt the messages to be sent, which is costly in a large-scale network when high-level security is demanded. To lessen the burden of heavy encryption and decryption processes, we introduce the Homomorphic Encryption to reduce the number of encryption/decryption terminals that are supposed to equip with every agent. The security is enhanced by the quantum key distribution technology, which can generate secret keys that are theoretically absolutely secure even against quantum computation. We proposed a hybrid method that make good use of the randomness of quantum keys, one-time pad and symmetric encryption to make sure the overall security of homomorphic encryption algorithms. Numerical simulations are provided to illustrate how our scheme.
In the absence of any efficient classical schemes for verifying a universal quantum computer, the importance of limiting the required quantum resources for this task has been highlighted recently. Currently, most of efficient quantum verification protocols are based on cryptographic techniques where an almost classical verifier executes her desired encrypted quantum computation remotely on an untrusted quantum prover. In this work we present a new protocol for quantum verification by incorporating existing techniques in a non-standard composition to reduce the required quantum communications between the verifier and the prover.
Over the past 40 years there has been a dramatic miniaturization in computer technology. If current trends continue, by the year 2020 the basic memory components of a computer will be the size of individual atoms. At such scales, the current model of computation, based on a mathematical idealization known as the Universal Turing Machine, is simply invalid. A new field, called "quantum computing" is emerging that is re-inventing the foundations of computer science and information theory in a way that is consistent with quantum physics - the most accurate model of reality that is currently known. Remarkably this new theory predicts that quantum computers can perform tasks exponentially faster than any conventional computer. Moreover, quantum effects allow unprecedented tasks to be performed such as teleporting information, breaking supposedly "unbreakable" codes, generating true random numbers, and communicating with messages that betray the presence of eavesdropping. These capabilities are of significant practical importance to banks and government agencies. lndeed, a quantum scheme for sending and receiving ultra-secure messages has already been implemented over a distance of 30km-far enough to wire the financial district of any major city. Modem microprocessors have to be designed with quantum mechanics in mind in order to ensure that they function correctly. In essence they use quantum effects to ensure that their classical computations are upheld. What no current processor does is to fully exploit quantum effects Recently, it took 1,600 computers communicating over the Internet 8 months to solve the factorisation of a 129-digit number. Should it be possible to build a microprocessor which fully exploits quantum mechanics then it may be possible to carry out such factorisations in remarkably less time. The RSA algorithm, a widely used encryption system, is safe only if such factorisations cannot be performed quickly. Although modem computers already exploit some quantum phenomena they do not make use of the full repertoire of quantum phenomena that Nature provides. Harnessing these phenomena will take computing technology to the very brink of what is possible in this Universe.
Currently, theoretical and experimental work in the field of quantum cryptography is being carried out in many research centers around the world. Over the past two decades since the start of active research, many quantum cryptographic protocols have been proposed, a significant number of laboratory experiments have been performed on their practical implementation, important work has been done to prove the resistance of the proposed protocols to certain types of attacks, and the first commercial quantum key distribution systems have been developed. However, there are still many tasks and problems in the field of quantum cryptography, the solution of which is of great scientific and technical importance. So, in particular, such a promising direction as quantum protocols for direct secure communication requires further development, allowing, under certain conditions, to transfer secret information without encryption, both between two and between a large number of users. Currently, such protocols have been developed using two-and three-particle entangled states, but there are almost no similar protocols with entangled states of a larger number of qubits that do not require large quantum memory for their implementation and, at the same time, have a large information capacity. Therefore, the development of new quantum direct secure communication protocols with increased information capacity, the analysis of their resistance to attacks, as well as the determination of the best protocols according to the criteria of resistance and information capacity.