Generation and Distribution of Quantum Oblivious Keys for Secure Multiparty Computation

TL;DR

This paper introduces a hybrid quantum-classical method for efficiently generating and distributing oblivious keys, enabling secure multiparty computation that is resistant to quantum attacks and suitable for practical high-speed applications.

Contribution

It presents a novel hybrid protocol combining quantum exchanges and classical hash commitments to produce secure oblivious keys for multiparty computation.

Findings

Achieves high-speed secure oblivious transfer

Secure against quantum computer attacks

Enables practical secure multiparty computation applications

Abstract

The oblivious transfer primitive is sufficient to implement secure multiparty computation. However, secure multiparty computation based only on classical cryptography is severely limited by the security and efficiency of the oblivious transfer implementation. We present a method to efficiently and securely generate and distribute oblivious keys by exchanging qubits and by performing commitments using classical hash functions. With the presented hybrid approach, quantum and classical, we obtain a practical and high-speed oblivious transfer protocol, secure even against quantum computer attacks. The oblivious distributed keys allow implementing a fast and secure oblivious transfer protocol, which can pave the way for the widespread of applications based on secure multiparty computation.