Results 1  10
of
16
Constrained Pseudorandom Functions and Their Applications
"... We put forward a new notion of pseudorandom functions (PRFs) we call constrained PRFs. In a standard PRF there is a master key k that enables one to evaluate the function at all points in the domain of the function. In a constrained PRF it is possible to derive constrained keys ks from the master ke ..."
Abstract

Cited by 69 (11 self)
 Add to MetaCart
We put forward a new notion of pseudorandom functions (PRFs) we call constrained PRFs. In a standard PRF there is a master key k that enables one to evaluate the function at all points in the domain of the function. In a constrained PRF it is possible to derive constrained keys ks from the master
Adaptive security of constrained prfs
 GGH+13] Sanjam Garg, Craig Gentry, Shai Halevi, Mariana Raykova, Amit
"... Abstract. Constrained pseudorandom functions have recently been introduced independently by Boneh and Waters [Asiacrypt’13], Kiayias et al. [CCS’13], and Boyle et al. [PKC’14]. In a standard pseudorandom function (PRF) a key k is used to evaluate the PRF on all inputs in the domain. Constrained PRFs ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. Constrained pseudorandom functions have recently been introduced independently by Boneh and Waters [Asiacrypt’13], Kiayias et al. [CCS’13], and Boyle et al. [PKC’14]. In a standard pseudorandom function (PRF) a key k is used to evaluate the PRF on all inputs in the domain. Constrained
Adaptively Secure Constrained Pseudorandom Functions
"... 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 constrained key, Kf, that allows for the evaluation of the PRF on a subset of the domain as determined by a predicate function f ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
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 constrained key, Kf, that allows for the evaluation of the PRF on a subset of the domain as determined by a predicate function f
Reducing Multilinear Map Levels in Constrained Pseudorandom Functions and Attributebased Encryption
"... Abstract. The candidate construction of multilinear maps by Garg, Gentry, and Halevi (Eurocrypt 2013) has lead to an explosion of new cryptographic constructions ranging from attributebased encryption (ABE) for arbitrary polynomial size circuits, to program obfuscation, and to constrained pseudora ..."
Abstract
 Add to MetaCart
the following objects: A constrained PRF for arbitrary circuit predicates based on (n+ `OR − 1)−linear maps (where n is the input length and `OR denotes the ORdepth of the circuit). For circuits with a specific structure, we also show how to construct such PRFs based on (n+ `AND− 1)−linear maps (where `AND
Constrained PRFs for Unbounded Inputs
"... A constrained pseudorandom function F: K × X → Y for family of subsets of X is a function where for any key k ∈ K and set S from the family one can efficiently compute a short constrained key kS which allows to evaluate F (k, ·) on all inputs x ∈ S, while given this key, the outputs on all inputs x ..."
Abstract
 Add to MetaCart
/ ∈ S look random. Constrained PRFs have been constructed for several families of sets, the most general being the circuitconstrained PRF by Boneh and Waters [Asiacrypt’13]. Their construction allows for constrained keys kC, where C is a boolean circuit that defines the set S = {x ∈ X  C(x) = 1
Keyhomomorphic constrained pseudorandom functions
 In TCC(II
, 2015
"... Abstract. A pseudorandom function (PRF) is a keyed function F: K × X → Y where, for a random key k ∈ K, the function F (k, ·) is indistinguishable from a uniformly random function, given blackbox access. A keyhomomorphic PRF has the additional feature that for any keys k, k ′ and any input x, we h ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
have F (k+ k′, x) = F (k, x)⊕F (k′, x) for some group operations +, ⊕ on K and Y, respectively. A constrained PRF for a family of sets S ⊆ P(X) has the property that, given any key k and set S ∈ S, one can efficiently compute a “constrained” key kS that enables evaluation of F (k, x) on all inputs x
Constrained KeyHomomorphic PRFs from Standard Lattice Assumptions Or: How to Secretly Embed a Circuit in Your PRF
"... Boneh et al. (Crypto 13) and Banerjee and Peikert (Crypto 14) constructed pseudorandom functions (PRFs) from the Learning with Errors (LWE) assumption by embedding combinatorial objects, a path and a tree respectively, in instances of the LWE problem. In this work, we show how to generalize this app ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
this approach to embed circuits, inspired by recent progress in the study of Attribute Based Encryption. Embedding a universal circuit for some class of functions allows us to produce constrained keys for functions in this class, which gives us the first standardlatticeassumptionbased constrained PRF (CPRF
Constraining Pseudorandom Functions Privately
"... In a constrained pseudorandom function (PRF), the holder of the master secret key can derive constrained keys with respect to a boolean circuit C. The constrained key can be used to evaluate the PRF on all inputs x for which C(x) = 1. In almost all existing constructions of constrained PRFs, the co ..."
Abstract
 Add to MetaCart
In a constrained pseudorandom function (PRF), the holder of the master secret key can derive constrained keys with respect to a boolean circuit C. The constrained key can be used to evaluate the PRF on all inputs x for which C(x) = 1. In almost all existing constructions of constrained PRFs
Constrained Pseudorandom Functions: Verifiable and Delegatable
"... Constrained pseudorandom functions (introduced independently by Boneh and Waters (CCS 2013), Boyle, Goldwasser, and Ivan (PKC 2014), and Kiayias, Papadopoulos, Triandopoulos, and Zacharias (CCS 2013)), are pseudorandom functions (PRFs) that allow the owner of the secret key k to compute a constraine ..."
Abstract
 Add to MetaCart
constrained key kf, such that anyone who possesses kf can compute the output of the PRF on any input x such that f(x) = 1 for some predicate f. The security requirement of constrained PRFs state that the PRF output must still look indistinguishable from random for any x such that f(x) = 0. Boneh and Waters
Fully secure constrained pseudorandom functions using random oracles
 IACR Cryptology ePrint Archive
"... A constrained pseudorandom function (CPRF) PRF allows to derive constrained evaluation keys that only allow to evaluate PRF on a subset of inputs. CPRFs have only recently been introduced independently by three groups of researchers. However, somewhat curiously, all of them could only achieve a comp ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
A constrained pseudorandom function (CPRF) PRF allows to derive constrained evaluation keys that only allow to evaluate PRF on a subset of inputs. CPRFs have only recently been introduced independently by three groups of researchers. However, somewhat curiously, all of them could only achieve a
Results 1  10
of
16