Welcome to the resource topic for 2024/058
Title:
Constrained Pseudorandom Functions for Inner-Product Predicates from Weaker Assumptions
Authors: Sacha Servan-Schreiber
Abstract:In this paper, we build a framework for constructing Constrained Pseudorandom Functions (CPRFs) with inner-product constraint predicates, using ideas from subtractive secret sharing and related-key-attack security.
Our framework can be instantiated using a random oracle or any suitable Related-Key-Attack (RKA) secure pseudorandom function. We provide three instantiations of our framework:
- an adaptively-secure construction in the random oracle model;
- a selectively-secure construction under the DDH assumption; and
- a selectively-secure construction under the assumption that one-way functions exist.
All three instantiations are constraint-hiding and support inner-product predicates, leading to
the first constructions of such expressive CPRFs under each corresponding assumption. Moreover, while the OWF-based construction is primarily of theoretical interest, the random oracle and DDH-based constructions are concretely efficient, which we show via an implementation.
ePrint: https://eprint.iacr.org/2024/058
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .