Oblivious keys are a fundamental resource to support secure multiparty computation. Nevertheless, classically it is very resource demanding to generate and distribute secure oblivious keys, which has been hindered their utilization. However, using quantum communications they can be generated and distributed with an efficiency similar to secret symmetric keys. This can allow the proliferation of applications supported by secure multiparty computation. In this work, we discuss the generation and distribution of oblivious keys in fiber optic networks using quantum communications.
Oblivious keys are a fundamental resource to support secure multiparty computation. Nevertheless, classically it is very resource demanding to generate and distribute secure oblivious keys, which has been hindered their utilization. However, using quantum communications they can be generated and distributed with an efficiency similar to secret symmetric keys. This can allow the proliferation of applications supported by secure multiparty computation. In this work, we discuss the generation and distribution of oblivious keys in fiber optic networks using quantum communications.
We analyze the use of a Quantum Key Distribution (QKD) system to generate and distribute oblivious keys. Oblivious keys can be used to implement secure multiparty computation services. After defining oblivious keys, we show how they can be reduced to symmetric keys and used to implement secure links, and how they can also be used to implement secure computation services. Oblivious keys can also be reversed. In this context, we analyze the advantages of using quantum resources to generate oblivious keys. Particularly, we analyze a protocol to generate oblivious keys, considering both the efficiency and security of the process. We show that by using QKD, we can simultaneously obtain an efficient and quantum-resistant solution to generate and distribute oblivious keys. Finally, we discuss a field trial where a quantum secure multiparty computation service for calculating phylogenetic trees was implemented in the Quantum Madrid Network.
The oblivious transfer primitive is sufficient to implement secure multiparty computation. However, secure multiparty computation based on public-key cryptography is limited by the security and efficiency of the oblivious transfer implementation. We present a method to generate and distribute oblivious keys by exchanging qubits and by performing commitments using classical hash functions. With the presented hybrid approach of quantum and classical, we obtain a practical and high-speed oblivious transfer protocol. We analyse the security and efficiency features of the technique and conclude that it presents advantages in both areas when compared to public-key based techniques.
Quantum technologies have the potential to improve in an unprecedented way the security and efficiency of communications in network infrastructures. We discuss the current landscape in quantum communication and cryptography, and focus in particular on recent photonic implementations, using encoding in discrete or continuous properties of light, of central quantum network protocols, enabling secret key distribution, verification of multiparty entanglement and transactions of quantum money, with security guarantees impossible to achieve with only classical resources. We also describe current challenges in this field and our efforts towards the miniaturization of the developed photonic systems, their integration into telecommunication network infrastructures, including with satellite links, as well as the practical demonstration of novel protocols featuring a quantum advantage for a wide range of tasks. These advances enrich the resources and applications of the emerging quantum networks that will play a central role in the context of future global-scale quantum-safe communications.
Entanglement distribution is a fundamental building block of quantum communication networks, enabling the secure and reliable exchange of quantum information over long distances. Unlike classical communication, quantum networks exploit the unique properties of quantum entanglement to support applications such as quantum key distribution, quantum teleportation, distributed quantum computing, and networked quantum sensing. Although significant progress has been made in recent years, the efficient generation, transmission, and preservation of entangled states remain major research challenges due to photon loss, decoherence, and limitations in current communication infrastructure.This review provides a comprehensive overview of entanglement distribution in quantum communication networks, focusing on the technologies that enable practical implementation and the latest experimental developments. It discusses key approaches for generating and distributing entangled photons through optical fibers, free-space links, and satellite-based communication, together with supporting technologies such as quantum repeaters, quantum memories, and photonic devices. The review also examines recent experimental demonstrations that have advanced long-distance quantum communication while highlighting the technical barriers that must be overcome for large-scale deployment. Finally, emerging applications and future research directions are presented, including the development of scalable quantum networks, the quantum internet, and secure global communication systems. This review aims to provide researchers and students with a clear understanding of the current state of entanglement distribution and its growing role in next-generation quantum communication technologies.
Symmetrically private information retrieval, a fundamental problem in the field of secure multiparty computation, is defined as follows: A database D of N bits held by Bob is queried by a user Alice who is interested in the bit Db in such a way that (1) Alice learns Db and only Db and (2) Bob does not learn anything about Alice's choice b. While solutions to this problem in the classical domain rely largely on unproven computational complexity theoretic assumptions, it is also known that perfect solutions that guarantee both database and user privacy are impossible in the quantum domain. Jakobi et al. [Phys. Rev. A 83, 022301 (2011)] proposed a protocol for oblivious transfer using well-known quantum key device (QKD) techniques to establish an oblivious key to solve this problem. Their solution provided a good degree of database and user privacy (using physical principles like the impossibility of perfectly distinguishing nonorthogonal quantum states and the impossibility of superluminal communication) while being loss-resistant and implementable with commercial QKD devices (due to the use of the Scarani-Acin-Ribordy-Gisin 2004 protocol). However, their quantum oblivious key distribution (QOKD) protocol requires a communication complexity of O(NlogN). Since modern databases can be extremely large, it is important to reduce this communication as much as possible. In this paper, we first suggest a modification of their protocol wherein the number of qubits that need to be exchanged is reduced to O(N). A subsequent generalization reduces the quantum communication complexity even further in such a way that only a few hundred qubits are needed to be transferred even for very large databases.
Modern cryptography is more than sending secret messages, and quantum cryptography is more than quantum key distribution. One example is oblivious transfer, which is interesting partly because it can be used to implement secure multiparty computation. We discuss a protocol for quantum XOR oblivious transfer, and how non-interactive quantum oblivious transfer protocols can be “reversed”, so that oblivious transfer is still implemented from a sender to a receiver, but so that it is the receiver who sends a quantum state to the sender, who measures it, instead of the other way round. This is useful when one party can only prepare and send quantum states, and the other party can only measure them, which is often the case in practical quantum communication systems. Both the “original” XOR oblivious transfer protocol and its reversed version have been implemented optically. We also discuss how quantum random access codes can be connected with quantum oblivious transfer.