Paper 2010/327

Efficiency-Improved Fully Simulatable Adaptive OT under the DDH Assumption

Kaoru Kurosawa, Ryo Nojima, and Le Trieu Phong

Abstract

At Asiacrypt 2009, Kurosawa and Nojima showed a fully simulatable adaptive oblivious transfer (OT) protocol under the DDH assumption in the standard model. However, Green and Hohenberger pointed out that the communication cost of each transfer phase is O(n), where n is the number of the sender's messages. In this paper, we show that the cost can be reduced to O(1) by utilizing a verifiable shuffle protocol.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. To appear in SCN 2010. This is the full version.
Keywords
Adaptive OTverifiable shufflesDDHstandard model
Contact author(s)
ryo-no @ nict go jp
History
2010-06-04: received
Short URL
https://ia.cr/2010/327
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2010/327,
      author = {Kaoru Kurosawa and Ryo Nojima and Le Trieu Phong},
      title = {Efficiency-Improved Fully Simulatable Adaptive {OT} under the {DDH} Assumption},
      howpublished = {Cryptology {ePrint} Archive, Paper 2010/327},
      year = {2010},
      url = {https://eprint.iacr.org/2010/327}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.