Publication Date



Technical Report: UTEP-CS-18-85


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.