Constraining pseudorandom functions privately
In a constrained pseudorandom function (PRF), the master secret key can be used to derive
constrained keys, where each constrained key k is constrained with respect to some …
constrained keys, where each constrained key k is constrained with respect to some …
Verifiable random functions from non-interactive witness-indistinguishable proofs
N Bitansky - Journal of Cryptology, 2020 - Springer
Verifiable random functions (VRFs) are pseudorandom functions where the owner of the
seed, in addition to computing the function's value y at any point x, can also generate a non …
seed, in addition to computing the function's value y at any point x, can also generate a non …
Private puncturable PRFs from standard lattice assumptions
D Boneh, S Kim, H Montgomery - … on the Theory and Applications of …, 2017 - Springer
A puncturable pseudorandom function (PRF) has a master key k that enables one to
evaluate the PRF at all points of the domain, and has a punctured key k_x that enables one …
evaluate the PRF at all points of the domain, and has a punctured key k_x that enables one …
Adaptively secure puncturable pseudorandom functions in the standard model
S Hohenberger, V Koppula, B Waters - … on the theory and application of …, 2015 - Springer
We study the adaptive security of constrained PRFs in the standard model. We initiate our
exploration with puncturable PRFs. A puncturable PRF family is a special class of …
exploration with puncturable PRFs. A puncturable PRF family is a special class of …
New negative results on differing-inputs obfuscation
We provide the following negative results for differing-inputs obfuscation (diO):(1) If sub-
exponentially secure one-way functions exist then sub-exponentially secure diO for TMs …
exponentially secure one-way functions exist then sub-exponentially secure diO for TMs …
Constrained keys for invertible pseudorandom functions
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 keys that can only be used to evaluate the PRF on a subset of the domain …
An anonymous verifiable random function with applications in blockchain
S Yao, D Zhang - Wireless Communications and Mobile …, 2022 - Wiley Online Library
Verifiable random function is a powerful function that provides a noninteractively public
verifiable proof for its output. Recently, verifiable random function has found essential …
verifiable proof for its output. Recently, verifiable random function has found essential …
Constrained pseudorandom functions for unconstrained inputs
A Deshpande, V Koppula, B Waters - … on the Theory and Applications of …, 2016 - Springer
A constrained pseudo random function (PRF) behaves like a standard PRF, but with the
added feature that the (master) secret key holder, having secret key K, can produce a …
added feature that the (master) secret key holder, having secret key K, can produce a …
Privately Puncturing PRFs from Lattices: Adaptive Security and Collusion Resistant Pseudorandomness
R Yang - Annual International Conference on the Theory and …, 2023 - Springer
A private puncturable pseudorandom function (PRF) enables one to create a constrained
version of a PRF key, which can be used to evaluate the PRF at all but some punctured …
version of a PRF key, which can be used to evaluate the PRF at all but some punctured …
Constrained pseudorandom functions for unconstrained inputs revisited: achieving verifiability and key delegation
P Datta, R Dutta, S Mukhopadhyay - … on Practice and Theory in Public-Key …, 2017 - Springer
In EUROCRYPT 2016, Deshpande et al. presented a construction of constrained
pseudorandom function (CPRF) supporting inputs of unconstrained polynomial length …
pseudorandom function (CPRF) supporting inputs of unconstrained polynomial length …