Paper 2011/382

Generic Fully Simulatable Adaptive Oblivious Transfer

Kaoru Kurosawa, Ryo Nojima, and Le Trieu Phong


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.

Note: Adding intuitions and clarifying approaches.

Available format(s)
Cryptographic protocols
Publication info
Published elsewhere. Full version of a paper at ACNS 2011
adaptive OTfully-simulatableverifiable shufflespermutation networksloose homomorphismleakage resilience
Contact author(s)
kurosawa @ mx ibaraki ac jp
ryo-no @ nict go jp
letrieu letrieuphong @ gmail com
2014-03-11: revised
2011-07-15: received
See all versions
Short URL
Creative Commons Attribution


      author = {Kaoru Kurosawa and Ryo Nojima and Le Trieu Phong},
      title = {Generic Fully Simulatable Adaptive Oblivious Transfer},
      howpublished = {Cryptology ePrint Archive, Paper 2011/382},
      year = {2011},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.