Constrained Pseudorandom Functions for Inner-Product Predicates from Weaker Assumptions

ePrint Report: Constrained Pseudorandom Functions for Inner-Product Predicates from Weaker Assumptions

Sacha Servan-Schreiber

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:


1. an adaptively-secure construction in the random oracle model;
2. a selectively-secure construction under the DDH assumption; …

attack build can eprint report framework functions ideas key oracle product random report secret security sharing suitable