Paper 2024/1784
Fine-Grained Non-Interactive Key-Exchange without Idealized Assumptions
, University of Electronic Science and Technology of China, University of Electronic Science and Technology of China, University of KasselAbstract
In this paper, we study multi-party non-interactive key exchange (NIKE) in the fine-grained setting. More precisely, we propose three multi-party NIKE schemes in three computation models, namely, the bounded parallel-time, bounded time, and bounded storage models. Their security is based on a very mild assumption (e.g., NC1 ⊊ ⊕L/poly) or even without any complexity assumption. This improves the recent work of Afshar, Couteau, Mahmoody, and Sadeghi (EUROCRYPT 2023) that requires idealized assumptions, such as random oracles or generic groups. Additionally, we show that all our constructions satisfy a natural desirable property that we refer to as extendability, and we give generic transformations from extendable multi-party NIKE to multi-party identity-based NIKEs in the fine-grained settings.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- A major revision of an IACR publication in CRYPTO 2024
- Keywords
- Multi-party non-interactive key exchangefine-grained cryptographyidentity-based cryptography.
- Contact author(s)
-
wangyuyu @ uestc edu cn
chuanjie su @ hotmail com
jiaxin pan @ uni-kassel de - History
- 2024-11-04: approved
- 2024-11-01: received
- See all versions
- Short URL
- https://ia.cr/2024/1784
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1784,
author = {Yuyu Wang and Chuanjie Su and Jiaxin Pan},
title = {Fine-Grained Non-Interactive Key-Exchange without Idealized Assumptions},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/1784},
year = {2024},
url = {https://eprint.iacr.org/2024/1784}
}
