Efficiency-Improved Fully Simulatable Adaptive OT under the DDH Assumption

Kaoru Kurosawa; Ryo Nojima; Le Trieu Phong

Paper 2010/327 Original: eprint.iacr.org/2010/327 ↗

Efficiency-Improved Fully Simulatable Adaptive OT under the DDH Assumption

Kaoru Kurosawa

Ryo Nojima

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: Preprint.
History: 2010-06-04: last updated; 2010-06-04: published
Short URL: https://ia.cr/2010/327
License: https://creativecommons.org/licenses/by/4.0/

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}
}