Results 1  10
of
11
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
PRFs additionally offer the functionality to delegate “constrained ” keys kS which allow to evaluate the PRF only on a subset S of the domain. The three abovementioned papers all show that the classical GGM construction [J.ACM’86] of a PRF from a pseudorandom generator (PRG) directly gives a
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
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
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 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
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
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
Constrained Verifiable Random Functions
"... We extend the notion of verifiable random functions (VRF) to constrained VRFs, which generalize the concept of constrained pseudorandom functions, put forward by Boneh and Waters (Asiacrypt’13), and independently by Kiayias et al. (CCS’13) and Boyle et al. (PKC’14), who call them delegatable PRFs a ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We extend the notion of verifiable random functions (VRF) to constrained VRFs, which generalize the concept of constrained pseudorandom functions, put forward by Boneh and Waters (Asiacrypt’13), and independently by Kiayias et al. (CCS’13) and Boyle et al. (PKC’14), who call them delegatable PRFs
Adaptively secure puncturable pseudorandom functions in the standard model
, 2014
"... 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 constrained PRFs, where the constrained key is associated with an element x ′ in the input domain. The key allows evaluation at ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
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 constrained PRFs, where the constrained key is associated with an element x ′ in the input domain. The key allows evaluation
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
∈ S, while the values F (k, x) for x / ∈ S remain pseudorandom even given kS. In this paper we construct PRFs that are simultaneously constrained and key homomorphic, where the homomorphic property holds even for constrained keys. We first show that the multilinear mapbased bitfixing and circuitconstrained
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
within some family F. While previous constructions gave constrained PRFs for polysized circuits, all reductions for such functionality were based in the selective model of security where an attacker declares which point he is attacking before seeing any constrained keys. In this paper we give new
Results 1  10
of
11