Delegatable pseudorandom functions and applications

362 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.

How to use indistinguishability obfuscation: deniable encryption, and more (2014, background): “To do this, we again make use of the punctured programs technique with multiple PRFs that have been enhanced to have additional properties: we consider injective PRFs, where the function PRF( K, · ) is injective with high probability over the choice of key K ; and also what we call extracting PRFs, ”
Pseudorandom Functions: Three Decades Later (2017, background): “Which of the words here is incorrect? LEONID LEVIN (1989) A function family is puncturable if it can be evaluated at all but a single point x̊ and its value at this point is secret [86, 45].”
Functional Signatures and Pseudorandom Functions (2014, background): “the name delegatable pseudorandom functions [23].”
Forward and Backward Private Searchable Encryption from Constrained Cryptographic Primitives (2017, methodology): “This instantiation has been described by Kiayias et al. [KPTZ13] and is called best range cover (BRC).”
Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation (2014, background): “In other words, the GGM PRF can be constrained to sets of a common prefix, as shown in [4,14,54].”