@inproceedings{3cd9113fe2e9441ca29bc99633945b60,
title = "Almost optimal oblivious transfer from QA-NIZK",
abstract = "We show how to build a UC-Secure Oblivious Transfer in the presence of Adaptive Corruptions from Quasi-Adaptive Non-Interactive Zero-Knowledge proofs. Our result is based on the work of Jutla and Roy at Asiacrypt 2015, where the authors proposed a constant-size very efficient PAKE scheme. As a stepping stone, we first show how a two-flow PAKE scheme can be generically transformed in an optimized way, in order to achieve an efficient three-flow Oblivious-Transfer scheme. We then compare our generic transformations to existing OT constructions and see that we manage to gain at least a factor 2 to the best known constructions. To the best of our knowledge, our scheme is the first UCsecure Oblivious Transfer with a constant size flow from the receiver, and nearly optimal size for the server.",
keywords = "OT, Pairing-based cryptography, QA-NIZK, UC",
author = "Olivier Blazy and C{\'e}line Chevalier and Paul Germouty",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2017.; 15th International Conference on Applied Cryptography and Network Security, ACNS 2017 ; Conference date: 10-07-2017 Through 12-07-2017",
year = "2017",
month = jan,
day = "1",
doi = "10.1007/978-3-319-61204-1\_29",
language = "English",
isbn = "9783319612034",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "579--598",
editor = "Dieter Gollmann and Atsuko Miyaji and Hiroaki Kikuchi",
booktitle = "Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Proceedings",
}