Cryptology ePrint Archive: Report 2018/1151

Analysis Of The Simulatability Of An Oblivious Transfer

Bing Zeng

Abstract: In the Journal of Cryptology (25(1): 158-193. 2012), Shai Halevi and Yael Kalai proposed a general framework for constructing two-message oblivious transfer protocols using smooth projective hashing. The authors asserts that this framework gives a simulation-based security guarantee when the sender is corrupted. Later this work has been believed to be half-simulatable in literatures. In this paper, we show that the assertion is not true and present our ideas to construct a fully-simulatable oblivious transfer framework.

Category / Keywords: cryptographic protocols / oblivious transfer, secure multiparty computation, malicious adversaries, smooth projective hashing

Date: received 25 Nov 2018

Contact author: zeng bing zb at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20181203:023653 (All versions of this report)

Short URL: ia.cr/2018/1151


[ Cryptology ePrint archive ]