Paper 2024/582
Improved Alternating-Moduli PRFs and Post-Quantum Signatures
Abstract
We revisit the alternating-moduli paradigm for constructing symmetric-key primitives with a focus on constructing efficient protocols to evaluate them using secure multi-party computation (MPC). The alternating-moduli paradigm of Boneh, Ishai, Passelègue, Sahai, and Wu (TCC 2018) enables the construction of various symmetric-key primitives with the common characteristic that the inputs are multiplied by two linear maps over different moduli.
The first contribution focuses on efficient two-party evaluation of alternating-moduli pseudorandom functions (PRFs), effectively building an oblivious PRF. We present a generalized alternating-moduli PRF construction along with methods to lower the communication and computation. We then provide several variants of our protocols with different computation and communication tradeoffs for evaluating the PRF. Most of our protocols are in the hybrid model while one is based on specialized garbling. Our most efficient protocol effectively is about
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- A minor revision of an IACR publication in CRYPTO 2024
- Keywords
- MPC friendlyPRFPQCSignatureRing Signature
- Contact author(s)
-
alamati @ gmail com
guruvamsi policharla @ gmail com
srini131293 @ gmail com
peterrindal @ gmail com - History
- 2024-08-18: last of 5 revisions
- 2024-04-16: received
- See all versions
- Short URL
- https://ia.cr/2024/582
- License
-
CC BY-NC
BibTeX
@misc{cryptoeprint:2024/582, author = {Navid Alamati and Guru-Vamsi Policharla and Srinivasan Raghuraman and Peter Rindal}, title = {Improved Alternating-Moduli {PRFs} and Post-Quantum Signatures}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/582}, year = {2024}, url = {https://eprint.iacr.org/2024/582} }