Cryptology ePrint Archive: Report 2013/840

(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens

Seung Geol Choi and Jonathan Katz and Dominique Schröder and Arkady Yerukhimovich and Hong Sheng Zhou

Abstract: We continue the line of work initiated by Katz (Eurocrypt 2007) on using tamper-proof hardware tokens for universally composable secure computation. As our main result, we show an oblivious-transfer (OT) protocol in which two parties each create and exchange a single, stateless token and can then run an unbounded number of OTs. We also show a more efficient protocol, based only on standard symmetric-key primitives (block ciphers and collision-resistant hash functions), that can be used if a bounded number of OTs suffice.

Motivated by this result, we investigate the number of stateless tokens needed for universally composable OT. We prove that our protocol is optimal in this regard for constructions making black-box use of the tokens (in a sense we define). We also show that nonblack-box techniques can be used to obtain a construction using only a single stateless token.

Category / Keywords: cryptographic protocols /

Original Publication (with major differences): IACR-TCC-2014

Date: received 11 Dec 2013, last revised 25 Jan 2016

Contact author: jkatz at cs umd edu

Available format(s): PDF | BibTeX Citation

Note: This replaces eprint report 2011/689, and corrects some errors in the proceedings version of this work.

Version: 20160125:155101 (All versions of this report)

Short URL: ia.cr/2013/840

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]