Abstract:
Function secret sharing (FSS), put forth by Boyle, Gilboa, and Ishai (Eurocrypt'15), is a form of "additive secret sharing" for functions f: {0,1}^n -> G, where G is an Abelian group.
Namely, an m-party FSS scheme for function class F enables one to split any function f from F into m succinctly described functions f_i, such that (1) for every input x, f(x) is equal to the sum of the m evaluations f_i(x), and (2) any strict subset of "share functions" f_i hides f.
In this talk, we present recent developments in constructions and implications of FSS.
Joint work with Niv Gilboa and Yuval Ishai.