Constructing oblivious transfer and bit commitment protocols based on chan-nel’s quantum nature to achieve statistical security has always been a basic aspect of quantum cryptography. Here we put forward a scheme to reach this goal. The idea is constructing first a random oblivious transfer (R-OT, an ex-tension of Rabin’s OT) protocol based on non-orthogonal states transmission over a quantum channel, then, as that usually do in modern cryptography, we construct a one-out-of-two oblivious transfer protocol on top of the R-OT protocol. Finally, we present a bit commitment protocol based on the one-out-of-two OT protocol, and show that it is statistically secure both in concealing and binding.Constructing oblivious transfer and bit commitment protocols based on chan-nel’s quantum nature to achieve statistical security has always been a basic aspect of quantum cryptography. Here we put forward a scheme to reach this goal. The idea is constructing first a random oblivious transfer (R-OT, an ex-tension of Rabin’s OT) protocol based on non-orthogonal states transmission over a quantum channel, then, as that usually do in modern cryptography, we construct a one-out-of-two oblivious transfer protocol on top of the R-OT protocol. Finally, we present a bit commitment protocol based on the one-out-of-two OT protocol, and show that it is statistically secure both in concealing and binding.

arXiv:1306.5863Jun 25, 20134 citations

Ferret: Fast Extension for Correlated OT with Small Communication

Kang Yang, Chenkai Weng, Xiao Lan +2 more

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\times$ , 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\times$ 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.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\times$, 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\times$ 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.

ACM SIGSAC Conference on Computer and Communications Security (CCS)Oct 30, 2020139 citations

Distributed Oblivious Transfer

Moni Naor, Benny Pinkas B

Lecture notes in computer scienceJan 1, 2000105 citations

Adaptive Oblivious Transfer and Generalizations

Olivier Blazy, Céline Chevalier, Paul Germouty

Jan 1, 20160 citations

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\times

, 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\times

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.