Cryptology ePrint Archive: Report 2011/382

Generic Fully Simulatable Adaptive Oblivious Transfer

Kaoru Kurosawa and Ryo Nojima and Le Trieu Phong

Abstract: We aim at constructing adaptive oblivious transfer protocols, enjoying fully simulatable security, from various well-known assumptions such as DDH, $d$-Linear, QR, DCR, and LWE. To this end, we present two generic constructions of adaptive OT, one of which utilizes verifiable shuffles together with threshold decryption schemes, while the other uses permutation networks together with what we call {\em loosely-homomorphic} key encapsulation schemes. We then show that specific choices of the building blocks lead to concrete adaptive OT protocols with fully simulatable security in the standard model under the targeted assumptions. Our generic methods can be extended to build universally composable (UC) secure, and leakage-resilient OT protocols.

Category / Keywords: cryptographic protocols / adaptive OT, fully-simulatable, verifiable shuffles, permutation networks, loose homomorphism, leakage resilience

Publication Info: Full version of a paper at ACNS 2011

Date: received 14 Jul 2011, last revised 10 Mar 2014

Contact author: kurosawa at mx ibaraki ac jp, ryo-no@nict go jp, letrieu letrieuphong@gmail com

Available format(s): PDF | BibTeX Citation

Note: Adding intuitions and clarifying approaches.

Version: 20140311:030449 (All versions of this report)

Short URL: ia.cr/2011/382

Discussion forum: Show discussion | Start new discussion