(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens
Name
145_2018_9288_ReferencePDF.pdf
Size
415.21 KB
Format
Unknown
Checksum (MD5)
7f1381981a2368652ab0efd1c12cf30b
Author(s)
Choi, Seung G
Katz, Jonathan
Schröder, Dominique
Yerukhimovich, Arkady
Zhou, Hong-Sheng
Date Issued
March 2018
Publisher
Springer US
Version
Author's final manuscript
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 transfer 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.
MIT Department
Lincoln Laboratory
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s00145-018-9288-x
