arXiv:1909.11701 · Applied Sciences

Generation and Distribution of Quantum Oblivious Keys for Secure Multiparty Computation

Mariano Lemus, Mariana F. Ramos, Preeti Yadav, Nuno A. Silva, Nelson J. Muga, André Souto, Nikola Paunković, Paulo Mateus, Armando N. Pinto

Published Jun 12, 2020• 26 citations

arXiv HTML PDF

Abstract

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.

DOI: 10.3390/app10124080

Related papers

Performance of Practical Quantum Oblivious Key Distribution

Mariano Lemus, Peter Schiansky, Manuel Goulão +5 more

Motivated by the applications of secure multi-party computation as a privacy-protecting data analysis tool, and identifying oblivious transfer as one of its main practical enablers, we propose a practical realization of randomized quantum oblivious transfer. By using only symmetric cryptography primitives to implement commitments, we construct computationally secure randomized oblivious transfer without the need for public-key cryptography or assumptions imposing limitations on the adversarial devices. We show that the protocol is secure under an indistinguishability-based notion of security and demonstrate an experimental implementation to test its real-world performance. Its security and performance are then compared to both quantum and classical alternatives, showing potential advantages over existing solutions based on the noisy storage model and public-key cryptography.

arXiv:2501.03973PRX QuantumAug 21, 20253 citations

Quantum and classical oblivious transfer: A comparative analysis

Manuel B. Santos, Armando N. Pinto, Paulo Mateus

Abstract Secure multiparty computation has the potential to be a disruptive technique in the realm of data analysis and computation. It enables several parties to compute virtually any function while preserving the privacy of their inputs. However, most of its protocols’ security and efficiency relies on the security and efficiency of oblivious transfer (OT). In this work, we make a detailed comparison between the complexity of the hybrid quantum oblivious transfer (HQOT) protocol presented in [11] and the classical OT [12], which to the best of our knowledge, is the fastest OT protocol. We also propose an optimised version of HQOT and discuss several other OT protocols generated from oblivious keys.

IET Quantum CommunicationMay 21, 202111 citations

Experimental secure multiparty computation from quantum oblivious transfer with bit commitment

Kaiyi Zhang, An-Jing Huang, Kun Tu +5 more

Secure multiparty computation enables collaborative computations across multiple users while preserving individual privacy, which has a wide range of applications in finance, machine learning and healthcare. Secure multiparty computation can be realized using oblivious transfer as a primitive function. In this paper, we present an experimental implementation of a quantum-secure quantum oblivious transfer (QOT) protocol using an adapted quantum key distribution system combined with a bit commitment scheme, surpassing previous approaches only secure in the noisy storage model. We demonstrate the first practical application of the QOT protocol by solving the private set intersection, a prime example of secure multiparty computation, where two parties aim to find common elements in their datasets without revealing any other information. In our experiments, two banks can identify common suspicious accounts without disclosing any other data. This not only proves the experimental functionality of QOT, but also showcases its real-world commercial applications.

arXiv:2411.04558npj Quantum InformationMar 14, 20260 citations

Oblivious Keys for Secure Multiparty Computation Obtained from a CV-QKD

Armando N. Pinto, Manuel B. Santos, Nuno A. Silva +2 more

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.

International Conference on Transparent Optical NetworksJul 2, 20234 citations

Quantum cryptography beyond quantum key distribution: variants of quantum oblivious transfer

Erika Andersson, Lara Stroh, Ittoop Vergheese Puthoor +6 more

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.

Quantum Computing, Communication, and SimulationMar 8, 20231 citation

Randomized Oblivious Transfer for Secure Multiparty Computation in the Quantum Setting

Bruno Costa, Pedro Costa Branco, Manuel Goulão +2 more

Secure computation is a powerful cryptographic tool that encompasses the evaluation of any multivariate function with arbitrary inputs from mutually distrusting parties. The oblivious transfer primitive serves is a basic building block for the general task of secure multi-party computation. Therefore, analyzing the security in the universal composability framework becomes mandatory when dealing with multi-party computation protocols composed of oblivious transfer subroutines. Furthermore, since the required number of oblivious transfer instances scales with the size of the circuits, oblivious transfer remains as a bottleneck for large-scale multi-party computation implementations. Techniques that allow one to extend a small number of oblivious transfers into a larger one in an efficient way make use of the oblivious transfer variant called randomized oblivious transfer. In this work, we present randomized versions of two known oblivious transfer protocols, one quantum and another post-quantum with ring learning with an error assumption. We then prove their security in the quantum universal composability framework, in a common reference string model.

EntropyJul 31, 202112 citations