Journal of Cryptology Прикладные компьютерные науки

Fine-Grained Non-interactive Key Exchange without Idealized Assumptions, and Lower Bounds

Wang, Yuyu, Su, Chuanjie, Pan, Jiaxin, Xu, Chunxiang
Springer Nature · 2026-11-09 · DOI 10.1007/s00145-026-09589-2

Аннотация

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 computational models, namely, the bounded-parallel-time, bounded-time, and bounded-storage models. The bounded-parallel-time and bounded-time constructions rely on mild fine-grained assumptions, whereas the bounded-storage construction is unconditional. 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 NIKEs to multi-party identity-based NIKEs in the fine-grained setting. Furthermore, we generalize the lower bound on users’ storage consumption in the bounded-storage model by Dziembowski and Maurer (Eurocrypt 2004) to encompass any multi-party NIKE with extendability and local key independence. Together with our construction, this lower bound shows that the users’ storage consumption of our multi-party NIKE in the bounded-storage model is optimal up to constant factors within this natural class.

Читать у издателя →