Functional Signatures and Pseudorandom Functions

By Elette Boyle, Shafi Goldwasser, Ioana Ivan. International Conference on Theory and Practice of Public Key Cryptography, 2014

437 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, background): “Delegating PRF evaluation in a similar vein as we consider here, was considered in [7, 8] after our work was submitted for publication.”
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.”
On the existence of extractable one-way functions (2014, background): “As shown in several recent works [13, 15, 43], such puncturable PRFs follow from the GGM construction [32].”
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.)”
Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation (2014, background): “[4], where they were called functional 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].”