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

Journal article


Publication Details

Author(s): Choi SG, Katz J, Schröder D, Yerukhimovich A, Zhou HS
Journal: Journal of Cryptology
Publication year: 2019
Volume: 32
Journal issue: 2
Pages range: 459-497
ISSN: 0933-2790


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.


FAU Authors / FAU Editors

Schröder, Dominique Prof. Dr.
Lehrstuhl für Informatik 13 (Angewandte Kryptographie)


External institutions with authors

University of Maryland
U.S. Naval Academy


How to cite

APA:
Choi, S.G., Katz, J., Schröder, D., Yerukhimovich, A., & Zhou, H.-S. (2019). (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens. Journal of Cryptology, 32(2), 459-497. https://dx.doi.org/10.1007/s00145-018-9288-x

MLA:
Choi, Seung Geol, et al. "(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens." Journal of Cryptology 32.2 (2019): 459-497.

BibTeX: 

Last updated on 2019-11-04 at 09:08