## Private Constrained PRFsA constrained pseudorandom function (PRF) is a PRF for which one can generate
constrained keys that can only be used to evaluate the PRF on a subset of the
domain. In this line of work, we introduce the notion of a ## Constraining Pseudorandom Functions Privately
Abstract:
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} } ## Watermarking Cryptographic Functionalities from Standard Lattice Assumptions
Abstract:
A software watermarking scheme allows one to embed a “mark” into a program without significantly altering the behavior of the program. Moreover, it should be difficult to remove the watermark without destroying the functionality of the program. Recently, Cohen et al. (STOC 2016) and Boneh et al. (PKC 2017) showed how to watermark cryptographic functions such as PRFs using the full power of general-purpose indistinguishability obfuscation. Notably, in their constructions, the watermark remains intact even against arbitrary removal strategies. A natural question is whether we can build watermarking schemes from standard assumptions that achieve this strong mark-unremovability property. We give the first construction of a watermarkable family of PRFs that satisfy this strong mark-unremovability property from standard lattice assumptions (namely, the learning with errors (LWE) and the one-dimensional short integer solution (SIS) problems). As part of our construction, we introduce a new cryptographic primitive called a translucent PRF. Next, we give a concrete construction of a translucent PRF family from standard lattice assumptions. Finally, we show that using our new lattice-based translucent PRFs, we obtain the first watermarkable family of PRFs with strong unremovability against arbitrary strategies from standard assumptions.
BibTeX:
@inproceedings{KW17a, author = {Sam Kim and David J. Wu}, title = {Watermarking Cryptographic Functionalities from Standard Lattice Assumptions}, booktitle = {{CRYPTO}}, year = {2017} } ## Constrained Keys for Invertible Pseudorandom Functions
Abstract:
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} } |