Paper 2020/606

Multiparty Noninteractive Key Exchange from Ring Key-Homomorphic Weak PRFs

Navid Alamati, VISA Research
Hart Montgomery, Linux Foundation
Sikhar Patranabis, IBM Research - India
Abstract

A weak pseudorandom function $F: \mathcal{K} \times \mathcal{X} \rightarrow \mathcal{Y}$ is said to be ring key-homomorphic if, given $F \left(k_{1}, x \right)$ and $F \left(k_{2}, x \right)$, there are efficient algorithms to compute $F \left(k_{1} \oplus k_{2}, x \right)$ and $F \left(k_{1} \otimes k_{2}, x \right)$ where $\oplus$ and $\otimes$ are the addition and multiplication operations in the ring $\mathcal{K}$, respectively. In this work, we initiate the study of ring key-homomorphic weak PRFs (RKHwPRFs). As our main result, we show that any RKHwPRF implies multiparty noninteractive key exchange (NIKE) for an arbitrary number of parties in the standard model. Our analysis of RKHwPRFs in a sense takes a major step towards the goal of building cryptographic primitives from Minicrypt primitives with structure, which has been studied in a recent line of works. With our result, most of the well-known asymmetric cryptographic primitives can be built from a weak PRF with either a group or ring homomorphism over either the input space or the key space.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Published elsewhere. CT-RSA 2023
Contact author(s)
sikharpatranabis @ gmail com
History
2023-02-19: last of 3 revisions
2020-05-25: received
See all versions
Short URL
https://ia.cr/2020/606
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2020/606,
      author = {Navid Alamati and Hart Montgomery and Sikhar Patranabis},
      title = {Multiparty Noninteractive Key Exchange from Ring Key-Homomorphic Weak {PRFs}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2020/606},
      year = {2020},
      url = {https://eprint.iacr.org/2020/606}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.