(Efficient) universally composable oblivious transfer using a minimal number of stateless tokens

Authored book
(Volume of book series)


Publication Details

Author(s): Choi SG, Katz J, Schröder D, Yerukhimovich A, Zhou HS
Publisher: Springer Verlag
Publication year: 2014
Title of series: Theory of Cryptography - TCC 2014
Pages range: 638-662
ISBN: 9783642542411
Language: English


Abstract


We continue the line of work initiated by Katz (Eurocrypt 2007) on using tamper-proof hardware for universally composable secure computation. As our main result, we show an efficient 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. Our result yields what we believe is the most practical and efficient known approach for oblivious transfer based on tamper-proof tokens, and implies that the parties can perform (repeated) secure computation of arbitrary functions without exchanging additional tokens. Motivated by this result, we investigate the minimal number of stateless tokens needed for universally composable OT/secure computation. 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. © 2014 International Association for Cryptologic Research.



FAU Authors / FAU Editors

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


How to cite

APA:
Choi, S.G., Katz, J., Schröder, D., Yerukhimovich, A., & Zhou, H.-S. (2014). (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens. Springer Verlag.

MLA:
Choi, Seung Geol, et al. (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens. Springer Verlag, 2014.

BibTeX: 

Last updated on 2018-29-11 at 20:50