搜索结果: 1-10 共查到“密码学 constrained PRFs”相关记录10条 . 查询时间(0.085 秒)
Note on Constructing Constrained PRFs from OWFs with Constant Collusion Resistance
Constrained PRF collusion-resistance one-way functions
<
2018/11/8
Constrained pseudorandom functions (CPRFs) are a type of PRFs that allows one to derive a constrained key KCKC from the master key KK. While the master key KK allows one to evaluate on any input as a ...
Constrained PRFs for Bit-fixing from OWFs with Constant Collusion Resistance
Constrained PRF Collusion-resistance One-way functions
<
2018/11/5
Constrained pseudorandom functions (CPRFs) allow learning `constrained' PRF keys that can evaluate the PRF on a subset of the input space, or based on some sort of predicate. First introduced by Boneh...
Adaptively Single-Key Secure Constrained PRFs for NC1
constrained pseudorandom function adaptive security obfuscation
<
2018/11/5
We present a construction of an adaptively single-key secure constrained PRF (CPRF) for NC1NC1 assuming the existence of indistinguishability obfuscation (IO) and the subgroup hiding assumption over a...
Constrained PRFs for NC1 in Traditional Groups
pseudo-randomness constrained PRF pairing free group
<
2018/3/7
We propose new constrained pseudorandom functions (CPRFs) in traditional groups. Traditional groups mean cyclic and multiplicative groups of prime order that were widely used in the 1980s and 1990s (s...
Private Constrained PRFs (and More) from LWE
private constrained PRF lattices learning with errors
<
2017/8/28
In a constrained PRF, the owner of the PRF key K can generate constrained keys K_f that allow anyone to evaluate the PRF on inputs x that satisfy the predicate f (namely, where f(x) is “true”) but rev...
Constraint-hiding Constrained PRFs for NC1 from LWE
Graded encodings constraint-hiding PRFs functional encryption
<
2017/2/21
Constraint-hiding constrained PRFs (CHCPRFs), initially studied by Boneh, Lewi and Wu [PKC 2017], are constrained PRFs where the constrained key hides the description of the constraint. Envisioned wit...
A constrained pseudorandom function (CPRF) F:K×X→Y for a family T of subsets of X is a function where for any key k∈K and set S∈T one can efficiently compute a short constrained key kS, which allows t...
Adaptive Security of Constrained PRFs
Constrained PRF complexity leveraging full security
<
2016/1/9
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
func...
Constrained PRFs for Unbounded Inputs
Constrained PRFs broadcast encryption identity-based non-interactive key exchange
<
2016/1/6
A constrained pseudorandom function F:K×X→Y for a family T of subsets of X is a function where for any key k∈K and set S∈T one can efficiently compute a constrained key kS which allows to evaluate F(k...
Reducing Multilinear Map Levels in Constrained PRFs and ABE
Constrained PRFs multilinear maps ABE
<
2015/12/23
The candidate construction of multilinear maps by Garg, Gentry, and Halevi (Eurocrypt
2013) has lead to an explosion of new cryptographic constructions ranging from attribute-based encryption
(ABE) ...