Fine-Grained Non-Interactive Key-Exchange: Constructions and Lower Bounds
Overview & Synopsis
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.
Indexed from repository: HAL Open Science
(
hal.science)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Fine-Grained Non-Interactive Key-Exchange: Constructions and Lower Bounds |
|---|---|
| Author / Organization | Abtin Afshar, Geoffroy Couteau, Mohammad Mahmoody, Elahe Sadeghi |
| Subject & Discipline | Multidisciplinary Academic Open Research |
| Categories | Science & Mathematics |
| Publication Year | 2023 |
| License / Rights | Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
HAL Open Science
(hal.science)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-166836 |
| Original Source Link | Visit Source Page on hal.science » |