Document Type
Article
Publication Title
Cryptology ePrint Archive
Publication Date
7-11-2022
Abstract/ Summary
In this paper we resolve the question of whether or not constrained pseudorandom functions (CPRFs) can be built directly from pseudorandom synthesizers. In particular, we demonstrate that the generic PRF construction from pseudorandom synthesizers due to Naor and Reingold can be used to construct CPRFs with bit-fixed predicates using the "direct-line'' approach. We further introduce a property of CPRFs that may be of independent interest.
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.