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. © 2010 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Kurosawa, K., Nojima, R., & Phong, L. T. (2010). Efficiency-improved fully simulatable adaptive OT under the DDH assumption. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6280 LNCS, pp. 172–181). https://doi.org/10.1007/978-3-642-15317-4_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
