## Publications## Constraining Pseudorandom Functions PrivatelyDan Boneh, Kevin Lewi, and David J. Wu International Conference on Practice and Theory of Public-Key Cryptography (PKC), 2017 ## ResourcesAbstract
In a constrained pseudorandom function (PRF), the master secret key can be
used to derive constrained keys, where each constrained key In this paper we introduce the concept of private constrained PRFs, which
are constrained PRFs with the additional property that a constrained key
does not reveal its constraint. Our main notion of privacy captures the
intuition that an adversary, given a constrained key To construct private constrained PRFs we first demonstrate that our strongest notions of privacy and functionality can be achieved using indistinguishability obfuscation. Then, for our main constructions, we build private constrained PRFs for bit-fixing constraints and for puncturing constraints from concrete algebraic assumptions. BibTeX
@inproceedings{BLW17, author = {Dan Boneh and Kevin Lewi and David J. Wu}, title = {Constraining Pseudorandom Functions Privately}, booktitle = {International Conference on Practice and Theory in Public-Key Cryptography ({PKC})}, year = {2017} } |