Generation and Distribution of Quantum Oblivious Keys for Secure Multiparty Computation
This addresses the problem of enabling widespread secure multiparty computation applications by providing a quantum-resistant oblivious transfer protocol.
The paper tackles the security and efficiency limitations of classical oblivious transfer for secure multiparty computation by proposing a hybrid quantum-classical method to generate and distribute oblivious keys, resulting in a practical, high-speed protocol that is secure against quantum attacks.
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.