Paper 2014/768

Cut-and-Choose Bilateral Oblivious Transfer and Its Application in Secure Two-party Computation

Han Jiang, Xiaochao Wei, Chuan Zhao, and Qiuliang Xu

Abstract

In secure two-party computation protocols, the cut-and-choose paradigm is used to prevent the malicious party who constructs the garbled circuits from cheating. In previous realization of the cut-and-choose technique on the garbled circuits, the delivery of the random keys is divided into multiple stages. Thus, the round complexity is high and the consistency of cut-and-choose challenge should be proved. In this paper, we introduce a new primitive called cut-and-choose bilateral oblivious transfer, which transfers all necessary keys of garbled circuits in one process. Specifically, in our oblivious transfer protocol, the sender inputs two pairs , and a bit ; the receiver inputs two bits and . After the protocol execution, the receiver obtains for , and for . By the introduction of this new primitive, the round complexity of secure two-party computation protocol can be decreased; the cut-and-choose challenge is no need to be opened anymore, therefore the consistency proof of is omitted. In addition, the primitive is of independent interest and could be useful in many cut-and-choose scenarios.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint. MINOR revision.
Keywords
Secure Two-party ComputationRound ComplexityCut-and-choose Inverse OTCut-and-choose Bilateral OT
Contact author(s)
jianghan @ sdu edu cn
History
2014-09-30: received
Short URL
https://ia.cr/2014/768
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2014/768,
      author = {Han Jiang and Xiaochao Wei and Chuan Zhao and Qiuliang Xu},
      title = {Cut-and-Choose Bilateral Oblivious Transfer and Its Application in Secure Two-party Computation},
      howpublished = {Cryptology {ePrint} Archive, Paper 2014/768},
      year = {2014},
      url = {https://eprint.iacr.org/2014/768}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.