Constrained Pseudorandom Functions from Pseudorandom Synthesizers

Zachary A Kissel

Paper 2022/897

Constrained Pseudorandom Functions from Pseudorandom Synthesizers

Zachary A Kissel

, Merrimack College

Abstract

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.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Preprint.
Keywords: pseudorandom synthesizers constrained pseudorandom functions
Contact author(s): kisselz @ merrimack edu
History: 2022-07-11: approved; 2022-07-08: received; See all versions
Short URL: https://ia.cr/2022/897
License: CC BY

BibTeX

@misc{cryptoeprint:2022/897,
      author = {Zachary A Kissel},
      title = {Constrained Pseudorandom Functions from Pseudorandom Synthesizers},
      howpublished = {Cryptology {ePrint} Archive, Paper 2022/897},
      year = {2022},
      url = {https://eprint.iacr.org/2022/897}
}