Extending Cut-and-Choose Oblivious Transfer

  • Kolesnikov V.
  • Kumaresan R.

Motivated by the recent rapid progress in improving efficiency of secure computation, we study cut-and-choose oblivious transfer - a basic building block of state-of-the-art constant round two-party secure computation protocols. In particular, we study the question of realizing cut-and-choose oblivious transfer and its variants in an OT-hybrid model. Towards this, we provide new definitions of cut-and-choose oblivious transfer (and its variants) that suffice for its application in cut-and-choose techniques for garbled circuit based two-party protocols. Our main result is that it is possible to realize cut-and-choose OT and its variants with very little concrete communication overhead while using only a small number of calls to the OT functionality. Further, our new definitions lead us to a construction for multistage cut-and-choose OT (a variant useful in the multiple execution setting) that is more efficient than prior work.

View Original Article

Recent Publications

January 01, 2018

Fair Dynamic Spectrum Management for QRD-Based Precoding with User Encoding Ordering in Downstream G.fast Transmission

In next generation DSL networks such as G.fast, employing discrete multi-tone transmission in high frequencies up to 212 MHz, the crosstalk among lines reaches very high levels. To precompensate the crosstalk in downstream transmission, QRD-based precoding has been proposed as a near-optimal dynamic spectrum management (DSM) technique. However, the performance ...

January 01, 2018

Practical Mitigation of Passive Intermodulation in Microstrip Circuits

This paper presents new experimental evidence and a novel practical approach for mitigation of passive intermodulation (PIM) in microstrip circuits fabricated on commercial printed circuit board laminates. The mechanisms of distributed PIM in microstrip circuits are reviewed and a phenomenology of PIM generation due to locally enhanced electromagnetic fields at ...

January 01, 2018

Efficient Cooperative HARQ for Multi-Source Multi-Relay Wireless Networks

In this paper, we compare the performance of three different cooperative Hybrid Automatic Repeat reQuest (HARQ) protocols for slow-fading half-duplex orthogonal multiple access multiple relay channel. Channel State Information (CSI) is available at the receiving side of each link only. Time Division Multiplexing is assumed, where each orthogonal transmission occurs ...