Efficiency-Improved Fully Simulatable Adaptive OT under the DDH Assumption

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.

• Type: Journal
• Year: 2010
• Where: SCN
• Authors: Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong
• Keywords: Adaptive Oblivious Transfer, Communications, DDH Assumption, SCN 2010, Verifiable Shuffle Protocol