Correlated oblivious transfer (COT) is a crucial building block for secure multi-party computation (MPC) and can be generated efficiently via OT extension. Recent works based on the pseudorandom correlation generator (PCG) paradigm presented a new way to generate random COT correlations using only communication sublinear to the output length. However, due to their high computational complexity, these protocols are only faster than the classical IKNP-style OT extension under restricted network bandwidth. In this paper, we propose new COT protocols in the PCG paradigm that achieve unprecedented performance. \em With
50 Mbps network bandwidth, our maliciously secure protocol can produce one COT correlation in
22 nanoseconds. More specifically, our results are summarized as follows: \beginenumerate \item We propose a semi-honest COT protocol with sublinear communication and linear computation. This protocol assumes primal-LPN and is built upon a recent VOLE protocol with semi-honest security by Schoppmann et al. (CCS 2019). We are able to apply various optimizations to reduce its communication cost by roughly
15×, not counting a one-time setup cost that diminishes as we generate more COT correlations. \item We strengthen our COT protocol to malicious security with no loss of efficiency. Among all optimizations, our new protocol features a new checking technique that ensures correctness and consistency essentially for free. In particular, our maliciously secure protocol is only \em
1−3 nanoseconds slower for each COT. \item We implemented our protocols, and the code will be publicly available at EMP toolkit. We observe at least
9× improvement in running time compared to the state-of-the-art protocol by Boyle et al. (CCS 2019) in both semi-honest and malicious settings under any network faster than
50 Mbps. \endenumerate With this new record of efficiency for generating COT correlations, we anticipate new protocol designs and optimizations will flourish on top of our protocol.
As a basic protocol of Secure Multi-party Computation,Oblivious Transfer(OT) is of significant research and application value.Most of previous oblivious transfer protocols in classical environment rely either on public-key cryptography or on additional computational assumptions which will be very vulnerable under quantum mechanics.Based on the characteristics of Bell States,a new quantum oblivious transfer protocol is proposed in this paper.The correctness and security of the protocol are analyzed and proved.The protocol is secure in the presence of noise on the channel and a potential eavesdropper.Comparing with oblivious transfer protocols in classical computational environment,the protocol in this paper is superior in security,soundness and wire-tapping detecting.
We present an experimentally feasible implementation of a secure multiparty computation application enabled by quantum oblivious transfer (QOT) on an entanglement-based physical layer. The QOT protocol uses polarization-encoded entangled states to share oblivious keys between two parties with quantum key distribution (QKD) providing authentication. Our system integrates the post-processing for QOT and QKD, both sharing a single physical layer, ensuring efficient key generation and authentication, respectively. Authentication involves hashing messages into a cryptographic context, verifying tags, and replenishing keys. This process uses a parallel QKD pipeline specifically for authentication, not for secure key generation. Oblivious keys are generated over a distance up to 25.8 km with a channel loss of 8.47 dB. In a back-to-back setup, a QOT rate of [Formula: see text] OTs/second is achieved, corresponding to 1 minute and 53 seconds per OT, primarily limited by the entanglement source. Using pre-distributed oblivious keys improved the rate to 0.11 OTs/second, or 9.1 seconds per OT. The considered QOT protocol is statistically correct, computationally secure for an honest receiver, and statistically secure for an honest sender, assuming a computationally hiding, statistically binding commitment. An experimentally feasible use case is demonstrated for privacy-preserving fingerprint matching against no-fly lists for border control. The fingerprint is secret-shared across two sites, ensuring security, while the matching is performed using the MASCOT protocol, supported by QOT. The application required 128 1-out-of-2 OTs, each with message length of 128 bits, with the highest security achieved in 20 minutes and 39 seconds. This work demonstrates the feasibility of QOT in secure quantum communication applications.