Cryptology ePrint Archive: Report 2015/135

Generalizing Efficient Multiparty Computation

Bernardo David and Ryo Nishimaki and Samuel Ranellucci and Alain Tapp

Abstract: We focus on generalizing constructions of Batch Single-Choice Cut-And-Choose Oblivious Transfer and Multi-sender k-out-of-n Oblivious Transfer, which are at the core of efficient secure computation constructions proposed by Lindell \textit{et al.} and the IPS compiler. Our approach consists in showing that such primitives can be based on a much weaker and simpler primitive called Verifiable Oblivious Transfer (VOT) with low overhead. As an intermediate step we construct Generalized Oblivious Transfer from VOT. Finally, we show that Verifiable Oblivious Transfer can be obtained from a structure preserving oblivious transfer protocol (SPOT) through an efficient transformation that uses Groth-Sahai proofs and structure preserving commitments.

Category / Keywords: cryptographic protocols / Oblivious Transfer, Structure Preserving Cryptography, Secure Computation, Universal Composability, Groth-Sahai Proof System, IPS compiler

Original Publication (with major differences): ICITS 2015

Date: received 19 Feb 2015, last revised 2 Mar 2015

Contact author: bernardo at cs au dk

Available format(s): PDF | BibTeX Citation

Version: 20150302:104635 (All versions of this report)

Short URL: ia.cr/2015/135

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]