2013 · 348 citations · 12 references
ComputingComputer ScienceComputer SystemsComputer SecurityCryptographySecurity ArchitectureData ProtectionPrivacy-preserving ProtocolsBandwidthBandwidth EfficiencyPrivacy-preserving ComputationPrivate Function EvaluationPseudorandom FunctionsSecure Function EvaluationTrapdoor Functions
We put forth the problem of delegating the evaluation of a pseudorandom function (PRF) to an untrusted proxy and introduce a novel cryptographic primitive called delegatable pseudorandom functions, or DPRFs for short: A DPRF enables a proxy to evaluate a pseudorandom function on a strict subset of its domain using a trapdoor derived from the DPRF secret key. The trapdoor is constructed with respect to a certain policy predicate that determines the subset of input values which the proxy is allowed to compute. The main challenge in constructing DPRFs is to achieve bandwidth efficiency (which mandates that the trapdoor is smaller than the precomputed sequence of the PRF values conforming to the predicate), while maintaining the pseudorandomness of unknown values against an attacker that adaptively controls the proxy. A DPRF may be optionally equipped with an additional property we call policy privacy, where any two delegation predicates remain indistinguishable in the view of a DPRF-querying proxy: achieving this raises new design challenges as policy privacy and bandwidth efficiency are seemingly conflicting goals.
12
How to construct random functions
Oded Goldreich, Shafi Goldwasser, Silvio Micali · Journal of the ACM · 1986 · 2.1K citations · Full text
Searchable symmetric encryption
Reza Curtmola, Juan A. Garay, Seny Kamara et al. · 2006 · 1.6K citations
Dynamic searchable symmetric encryption
Seny Kamara, Charalampos Papamanthou, Tom Roeder · 2012 · 1.1K citations
Silvio Micali, M. O. Rabin, Salil Vadhan · 2003 · 687 citations · Full text
Proxy signatures for delegating signing operation
Masahiro Mambo, Keisuke Usuda, Eiji Okamoto · 1996 · 588 citations · Full text