In this paper, we show a concurrent oblivious transfer protocol in super-polynomial-simulation (SPS) security. Our protocol does not require any setup and does not assume any independence among the inputs. In addition, our protocol is efficient since it does not use any inefficient primitives such as general zero-knowledge proofs for all NP statements. This is the first concurrent oblivious transfer protocol that achieves both of these properties simultaneously. The security of our protocol is based on the decisional Diffie-Hellman (DDH) assumption. © Springer-Verlag Berlin Heidelberg 2012.
CITATION STYLE
Kiyoshima, S., Manabe, Y., & Okamoto, T. (2012). Efficient concurrent oblivious transfer in super-polynomial-simulation security. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7631 LNCS, pp. 216–232). Springer Verlag. https://doi.org/10.1007/978-3-642-34117-5_14
Mendeley helps you to discover research relevant for your work.