CryptoDB
Efficiency-Improved Fully Simulatable Adaptive OT under the DDH Assumption
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2010-23228, title={Efficiency-Improved Fully Simulatable Adaptive OT under the DDH Assumption}, booktitle={IACR Eprint archive}, keywords={cryptographic protocols / Adaptive OT, verifiable shuffles, DDH, standard model}, url={http://eprint.iacr.org/2010/327}, note={To appear in SCN 2010. This is the full version. ryo-no@nict.go.jp 14763 received 2 Jun 2010}, author={Kaoru Kurosawa and Ryo Nojima and Le Trieu Phong}, year=2010 }