Cryptology ePrint Archive: Report 2010/327

Efficiency-Improved Fully Simulatable Adaptive OT under the DDH Assumption

Kaoru Kurosawa and 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.

Category / Keywords: cryptographic protocols / Adaptive OT, verifiable shuffles, DDH, standard model

Publication Info: To appear in SCN 2010. This is the full version.

Date: received 2 Jun 2010

Contact author: ryo-no at nict go jp

Available format(s): PDF | BibTeX Citation

Version: 20100604:104302 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]