Paper 2015/135

Generalizing Efficient Multiparty Computation

Bernardo David, Ryo Nishimaki, Samuel Ranellucci, and Alain Tapp


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.

Available format(s)
Cryptographic protocols
Publication info
Published elsewhere. MAJOR revision.ICITS 2015
Oblivious TransferStructure Preserving CryptographySecure ComputationUniversal ComposabilityGroth-Sahai Proof SystemIPS compiler
Contact author(s)
bernardo @ cs au dk
2015-03-02: revised
2015-02-26: received
See all versions
Short URL
Creative Commons Attribution


      author = {Bernardo David and Ryo Nishimaki and Samuel Ranellucci and Alain Tapp},
      title = {Generalizing Efficient Multiparty Computation},
      howpublished = {Cryptology ePrint Archive, Paper 2015/135},
      year = {2015},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.