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
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
-
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} }