Fine-Grained Non-Interactive Key-Exchange: Constructions and Lower Bounds
Résumé
In this work, we initiate a study of K-NIKE protocols in the fine-grained setting, in which there is a polynomial gap between the running time of the honest parties and that of the adversary. Our goal is to show the possibility, or impossibility, of basing such protocols on weaker assumptions than those of K-NIKE for K ≥ 3. Our contribution is threefold.
Domaines
Informatique [cs]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|