Almost Optimal Oblivious Transfer from QA-NIZK - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Almost Optimal Oblivious Transfer from QA-NIZK

Résumé

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 PAKEPAKE scheme. As a stepping stone, we first show how a two-flow PAKEPAKE 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 UC-secure Oblivious Transfer with a constant size flow from the receiver, and nearly optimal size for the server.
Fichier principal
Vignette du fichier
358.pdf (581.91 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01610411 , version 1 (29-11-2017)

Identifiants

Citer

Céline Chevalier, Paul Germouty, Olivier Blazy. Almost Optimal Oblivious Transfer from QA-NIZK. 15th International Conference on Applied Cryptography and Network Security (ACNS 2017), Jul 2017, Kanazawa, Japan. pp.579-598, ⟨10.1007/978-3-319-61204-1_29⟩. ⟨hal-01610411⟩
157 Consultations
182 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More