Paper 2017/491

Laconic Oblivious Transfer and its Applications

Chongwon Cho, Nico Döttling, Sanjam Garg, Divya Gupta, Peihan Miao, and Antigoni Polychroniadou


In this work, we introduce a novel technique for secure computation over large inputs. Specifically, we provide a new oblivious transfer (OT) protocol with a laconic receiver. Laconic OT allows a receiver to commit to a large input $D$ (of length $M$) via a short message. Subsequently, a single short message by a sender allows the receiver to learn $m_{D[L]}$, where the messages $m_0, m_1$ and the location $L \in [M]$ are dynamically chosen by the sender. All prior constructions of OT required the receiver's outgoing message to grow with $D$. Our key contribution is an instantiation of this primitive based on the Decisional Diffie-Hellman (DDH) assumption in the common reference string (CRS) model. The technical core of this construction is a novel use of somewhere statistically binding (SSB) hashing in conjunction with hash proof systems. Next, we show applications of laconic OT to non-interactive secure computation on large inputs and multi-hop homomorphic encryption for RAM programs.

Available format(s)
Public-key cryptography
Publication info
A minor revision of an IACR publication in CRYPTO 2017
Oblivious TransferLaconic OTSecure ComputationHomomorphic Encryption for RAM
Contact author(s)
peihan @ berkeley edu
2017-07-13: last of 2 revisions
2017-05-31: received
See all versions
Short URL
Creative Commons Attribution


      author = {Chongwon Cho and Nico Döttling and Sanjam Garg and Divya Gupta and Peihan Miao and Antigoni Polychroniadou},
      title = {Laconic Oblivious Transfer and its Applications},
      howpublished = {Cryptology ePrint Archive, Paper 2017/491},
      year = {2017},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.