International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Fine-Grained Non-Interactive Key Exchange, Revisited

Authors:
Geoffroy Couteau , CNRS, IRIF, Université Paris Cité
Elahe Sadeghi , University of Texas
Balthazar Bauer , UVSQ
Download:
DOI: 10.1007/978-3-031-68379-4_9 (login may be required)
Search ePrint
Search Google
Presentation: Slides
Conference: CRYPTO 2024
Abstract: We revisit the construction of multiparty non-interactive key-exchange protocols with fine-grained security, which was recently studied in (Afshar et al., Eurocrypt 2023). Their work introduced a 4-party non-interactive key exchange with quadratic hardness, and proved it secure in Shoup's generic group model. This positive result was complemented with a proof that n-party non-interactive key exchange with superquadratic security cannot exist in Maurer's generic group model, for any n > 2. Because Shoup's model is stronger than Maurer's model, this leaves a gap between the positive and the negative result, and their work left as an open question the goal of closing this gap, and of obtaining fine-grained non-interactive key exchange without relying on idealized models. In this work, we make significant progress on both questions. We obtain two main results: - A 4-party non-interactive key exchange protocol, assuming the existence of exponentially secure injective pseudorandom generators, and the subexponential hardness of the computational Diffie-Hellman assumption. In addition, our scheme is conceptually simpler, and can be generalized to other settings (with more parties or from other assumptions). - Assuming the existence of non-uniformly secure injective pseudorandom generators with exponential hardness, we further show that our protocol is secure in Maurer's model, albeit with a smaller hardness gap (up to N^1.6), making progress on filling the gap between the positive and the negative result of (Afshar et al., Eurocrypt 2023). Somewhat intriguingly, proving the security of our scheme in Maurer's idealized model turns out to be significantly harder than proving its security in the standard model.
BibTeX
@inproceedings{crypto-2024-34168,
  title={Fine-Grained Non-Interactive Key Exchange, Revisited},
  publisher={Springer-Verlag},
  doi={10.1007/978-3-031-68379-4_9},
  author={Geoffroy Couteau and Elahe Sadeghi and Balthazar Bauer},
  year=2024
}