Chapter

Theory of Cryptography

Volume 5444 of the series Lecture Notes in Computer Science pp 387-402

Simple, Black-Box Constructions of Adaptively Secure Protocols

  • Seung Geol ChoiAffiliated withColumbia University
  • , Dana Dachman-SoledAffiliated withColumbia University
  • , Tal MalkinAffiliated withColumbia University
  • , Hoeteck WeeAffiliated withQueens College, CUNY

Abstract

We present a compiler for transforming an oblivious transfer (OT) protocol secure against an adaptive semi-honest adversary into one that is secure against an adaptive malicious adversary. Our compiler achieves security in the universal composability framework, assuming access to an ideal commitment functionality, and improves over previous work achieving the same security guarantee in two ways: it uses black-box access to the underlying protocol and achieves a constant multiplicative overhead in the round complexity. As a corollary, we obtain the first constructions of adaptively secure protocols in the stand-alone model using black-box access to a low-level primitive.