- Our framework is round-efficient. E.g., under the DLIN or SXDH assumptions we achieve round-optimal protocols with static security, or 3-round protocols with adaptive security (assuming erasure).
- Our resulting protocols are more efficient than any known previously, and in particular yield protocols for string OT using O(1) exponentiations and communicating O(1) group elements.
Our result improves on that of Peikert et al. (Crypto 2008), which uses a CRS whose length depends on the number of parties in the network and achieves only static security. Compared to Garay et al. (Crypto 2009), we achieve adaptive security with better round complexity and efficiency.Category / Keywords: cryptographic protocols / oblivious transfer, universal composability, adaptive security Publication Info: PKC 2013 Date: received 12 Dec 2012, last revised 14 May 2014 Contact author: sgchoi at cs columbia edu Available format(s): PDF | BibTeX Citation Version: 20140514:185431 (All versions of this report) Discussion forum: Show discussion | Start new discussion