Quantum Oblivious Transfer for Universal Function

ABSTRACT Oblivious transfer (OT) is an important two‐party cryptographic primitive, and it is a universal building block for secure multiparty computation. In this paper, we for the first time introduce the notion of oblivious transfer for universal function (UFOT), where the sender Alice has two bits (, ) , and the receiver Bob obtains either the first bit , the second bit , or their function . Bob should not learn anything more than this, and Alice should not learn what Bob has learnt. To show the feasibility of this concept, we implement a quantum UFOT protocol based on oblivious quantum key distribution, and then analyze its security. We also show its advantages, such as lower cheating probabilities for two parties, loss tolerance, flexibility, and universality. It paves the way for solving privacy‐preserving machine learning problems.