Randomized Oblivious Transfer for Secure Multiparty Computation in the Quantum Setting

Randomized Oblivious Transfer for Secure Multiparty Computation in the Quantum Setting

Blog Article

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 Mouthpiece 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 Little girls L/S onesie 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.