Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security

Ran Canetti*, Pratik Sarkar, Xiao Wang

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We construct the most efficient two-round adaptively secure bit-OT in the Common Random String (CRS ) model. The scheme is UC secure under the Decisional Diffie-Hellman (DDH) assumption. It incurs O(1 ) exponentiations and sends O(1 ) group elements, whereas the state of the art requires O(κ2) exponentiations and communicates poly (κ) bits, where κ is the computational security parameter. Along the way, we obtain several other efficient UC-secure OT protocols under DDH:The most efficient yet two-round adaptive string-OT protocol assuming global programmable random oracle. Furthermore, the protocol can be made non-interactive in the simultaneous message setting, assuming random inputs for the sender.The first two-round string-OT with amortized constant exponentiations and communication overhead which is secure in the global observable random oracle model.The first two-round receiver equivocal string-OT in the CRS model that incurs constant computation and communication overhead. We also obtain the first non-interactive adaptive string UC-commitment in the CRS model which incurs a sublinear communication overhead in the security parameter. Specifically, we commit to polylog (κ) bits while communicating O(κ) bits. Moreover, it is additively homomorphic. We can also extend our results to the single CRS model where multiple sessions share the same CRS. As a corollary, we obtain a two-round adaptively secure MPC protocol in this model.

Original languageEnglish (US)
Title of host publicationAdvances in Cryptology – ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, 2020, Proceedings
EditorsShiho Moriai, Huaxiong Wang
PublisherSpringer Science and Business Media Deutschland GmbH
Pages277-308
Number of pages32
ISBN (Print)9783030648398
DOIs
StatePublished - 2020
Event26th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2020 - Daejeon, Korea, Republic of
Duration: Dec 7 2020Dec 11 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12493 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference26th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2020
CountryKorea, Republic of
CityDaejeon
Period12/7/2012/11/20

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security'. Together they form a unique fingerprint.

Cite this