Constrained Pseudorandom Functions and Their Applications

By Dan Boneh, Brent Waters. International Conference on the Theory and Application of Cryptology and Information Security, 2013

436 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Delegatable pseudorandom functions and applications (2013, methodology): “For instance, [2, 7] is covered by the subtrees rooted at nodes 001 and 01 (colored in grey).”
Forward and Backward Private Searchable Encryption from Constrained Cryptographic Primitives (2017, methodology): “Constrained pseudorandom functions were concurrently introduced in [BW13, KPTZ13, BGI14], and applied to broadcast encryption, identity-based key-exchange, or SNARGs.”
Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits (2014, methodology): “The construction here relies on a generalization of broadcast encryption [FN93, BGW05, BW13] and the attribute-based encryption scheme of [GGH + 13c].”
Functional Signatures and Pseudorandom Functions (2014, methodology): “Based on the Multilinear Decisional Diﬃe-Hellman assumption (a recently coined assumption related to existence of secure multilinear maps), [BW13] show that PRFs with Selective Access can be constructed for all predicates describable as polynomial-sized circuits.”
Pseudorandom Functions: Three Decades Later (2017, background): “Constrained PRFs extend puncturable PRFs in that they allow for more general constraints than mere puncturing [43, 86, 45].”
How to use indistinguishability obfuscation: deniable encryption, and more (2014, methodology): “(We use the subscript of PDE to denote the original deniable encryption system and DE to denote the constructed deniable encryption system.)”