## Publications## Constrained Keys for Invertible Pseudorandom FunctionsDan Boneh, Sam Kim, and David J. Wu Theory of Cryptography Conference (TCC), 2017 ## ResourcesAbstract
A constrained pseudorandom function (PRF) is a secure PRF for which one can
generate constrained keys that can only be used to evaluate the PRF on a
subset of the domain. Constrained PRFs are used widely, most notably in
applications of indistinguishability obfuscation (iO). In this paper we show
how to constrain an invertible PRF (IPF), which is significantly harder. An
IPF is a secure injective PRF accompanied by an inversion algorithm. A
constrained key for an IPF can only be used to evaluate the IPF on a subset BibTeX
@inproceedings{BKW17, author = {Dan Boneh and Sam Kim and David J. Wu}, title = {Constrained Keys For Invertible Pseudorandom Functions}, booktitle = {{TCC}}, year = {2017} } |